./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/popl20-more-buffer-mult2.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c ./goblint.2024-05-21_14-57-05.files/mutex-meet/popl20-more-buffer-mult2.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 16:28:01,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 16:28:01,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 16:28:01,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 16:28:01,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 16:28:01,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 16:28:01,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 16:28:01,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 16:28:01,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 16:28:01,600 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 16:28:01,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 16:28:01,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 16:28:01,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 16:28:01,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 16:28:01,602 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 16:28:01,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 16:28:01,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 16:28:01,603 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 16:28:01,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 16:28:01,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 16:28:01,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 16:28:01,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 16:28:01,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 16:28:01,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 16:28:01,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 16:28:01,605 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 16:28:01,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 16:28:01,605 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 16:28:01,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 16:28:01,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 16:28:01,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 16:28:01,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 16:28:01,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:28:01,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 16:28:01,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 16:28:01,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 16:28:01,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 16:28:01,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 16:28:01,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 16:28:01,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 16:28:01,609 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 16:28:01,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 16:28:01,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 16:28:01,610 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 16:28:01,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 16:28:01,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 16:28:01,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 16:28:01,857 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 16:28:01,857 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 16:28:01,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/popl20-more-buffer-mult2.wvr.yml/witness.yml [2024-06-04 16:28:01,977 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 16:28:01,978 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 16:28:01,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2024-06-04 16:28:02,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 16:28:03,126 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 16:28:03,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2024-06-04 16:28:03,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36380b211/e8d65a0e00f24a3e996f4b18434cf96c/FLAG08c9fcfba [2024-06-04 16:28:03,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36380b211/e8d65a0e00f24a3e996f4b18434cf96c [2024-06-04 16:28:03,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 16:28:03,147 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 16:28:03,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 16:28:03,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 16:28:03,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 16:28:03,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:28:01" (1/2) ... [2024-06-04 16:28:03,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ce156e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:28:03, skipping insertion in model container [2024-06-04 16:28:03,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:28:01" (1/2) ... [2024-06-04 16:28:03,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@36d1af4a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:28:03, skipping insertion in model container [2024-06-04 16:28:03,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:28:03" (2/2) ... [2024-06-04 16:28:03,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ce156e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03, skipping insertion in model container [2024-06-04 16:28:03,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:28:03" (2/2) ... [2024-06-04 16:28:03,158 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 16:28:03,175 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 16:28:03,180 INFO L97 edCorrectnessWitness]: Location invariant before [L140-L140] (((! multithreaded || 0 <= j) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2147483648LL + (long long )i) + (long long )q1_front >= 0LL && (2147483648LL + (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )i) + (long long )n1 >= 0LL) && (2147483648LL + (long long )i) + (long long )n2 >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )j) + (long long )n1 >= 0LL) && (2147483648LL + (long long )j) + (long long )n2 >= 0LL) && (2147483648LL + (long long )N) + (long long )i >= 0LL) && (2147483648LL + (long long )N) + (long long )j >= 0LL) && (2147483648LL + (long long )C) + (long long )i >= 0LL) && (2147483648LL + (long long )C) + (long long )j >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q2_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )n2 >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )n1 >= 0LL) && (4294967296LL + (long long )N) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )C) + (long long )n1 >= 0LL) && (4294967296LL + (long long )C) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )N >= 0LL) && (2147483647LL - (long long )N) + (long long )i >= 0LL) && (2147483647LL - (long long )N) + (long long )j >= 0LL) && (2147483647LL - (long long )C) + (long long )i >= 0LL) && (2147483647LL - (long long )C) + (long long )j >= 0LL) && (2147483648LL - (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL - (long long )j) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )n2 >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )n1 >= 0LL) && (4294967295LL - (long long )N) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )C) + (long long )n1 >= 0LL) && (4294967295LL - (long long )C) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )N >= 0LL) && (long long )i + (long long )j >= 0LL) && (2147483647LL + (long long )i) - (long long )q1_back >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )q2_back >= 0LL) && (2147483647LL + (long long )j) - (long long )n1 >= 0LL) && (2147483647LL + (long long )j) - (long long )n2 >= 0LL) && (4294967295LL + (long long )n1) - (long long )n2 >= 0LL) && (4294967295LL + (long long )N) - (long long )n1 >= 0LL) && (4294967295LL + (long long )N) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )n1 >= 0LL) && (4294967295LL + (long long )C) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )N >= 0LL) && (4294967294LL - (long long )n1) - (long long )n2 >= 0LL) && (4294967294LL - (long long )N) - (long long )n1 >= 0LL) && (4294967294LL - (long long )N) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )n1 >= 0LL) && (4294967294LL - (long long )C) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )N >= 0LL))) && (! multithreaded || (0 <= i && 0 <= j))) && (! multithreaded || 0 <= i) [2024-06-04 16:28:03,180 INFO L97 edCorrectnessWitness]: Location invariant before [L142-L142] (((! multithreaded || 0 <= j) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2147483648LL + (long long )i) + (long long )q1_front >= 0LL && (2147483648LL + (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )i) + (long long )n1 >= 0LL) && (2147483648LL + (long long )i) + (long long )n2 >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )j) + (long long )n1 >= 0LL) && (2147483648LL + (long long )j) + (long long )n2 >= 0LL) && (2147483648LL + (long long )N) + (long long )i >= 0LL) && (2147483648LL + (long long )N) + (long long )j >= 0LL) && (2147483648LL + (long long )C) + (long long )i >= 0LL) && (2147483648LL + (long long )C) + (long long )j >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q2_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )n2 >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )n1 >= 0LL) && (4294967296LL + (long long )N) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )C) + (long long )n1 >= 0LL) && (4294967296LL + (long long )C) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )N >= 0LL) && (2147483647LL - (long long )N) + (long long )i >= 0LL) && (2147483647LL - (long long )N) + (long long )j >= 0LL) && (2147483647LL - (long long )C) + (long long )i >= 0LL) && (2147483647LL - (long long )C) + (long long )j >= 0LL) && (2147483648LL - (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL - (long long )j) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )n2 >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )n1 >= 0LL) && (4294967295LL - (long long )N) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )C) + (long long )n1 >= 0LL) && (4294967295LL - (long long )C) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )N >= 0LL) && (long long )i + (long long )j >= 0LL) && (2147483647LL + (long long )i) - (long long )q1_back >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )q2_back >= 0LL) && (2147483647LL + (long long )j) - (long long )n1 >= 0LL) && (2147483647LL + (long long )j) - (long long )n2 >= 0LL) && (4294967295LL + (long long )n1) - (long long )n2 >= 0LL) && (4294967295LL + (long long )N) - (long long )n1 >= 0LL) && (4294967295LL + (long long )N) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )n1 >= 0LL) && (4294967295LL + (long long )C) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )N >= 0LL) && (4294967294LL - (long long )n1) - (long long )n2 >= 0LL) && (4294967294LL - (long long )N) - (long long )n1 >= 0LL) && (4294967294LL - (long long )N) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )n1 >= 0LL) && (4294967294LL - (long long )C) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )N >= 0LL))) && (! multithreaded || (0 <= i && 0 <= j))) && (! multithreaded || 0 <= i) [2024-06-04 16:28:03,181 INFO L97 edCorrectnessWitness]: Location invariant before [L141-L141] (((! multithreaded || 0 <= j) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2147483648LL + (long long )i) + (long long )q1_front >= 0LL && (2147483648LL + (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )i) + (long long )n1 >= 0LL) && (2147483648LL + (long long )i) + (long long )n2 >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )j) + (long long )n1 >= 0LL) && (2147483648LL + (long long )j) + (long long )n2 >= 0LL) && (2147483648LL + (long long )N) + (long long )i >= 0LL) && (2147483648LL + (long long )N) + (long long )j >= 0LL) && (2147483648LL + (long long )C) + (long long )i >= 0LL) && (2147483648LL + (long long )C) + (long long )j >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q2_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )n2 >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )n1 >= 0LL) && (4294967296LL + (long long )N) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )C) + (long long )n1 >= 0LL) && (4294967296LL + (long long )C) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )N >= 0LL) && (2147483647LL - (long long )N) + (long long )i >= 0LL) && (2147483647LL - (long long )N) + (long long )j >= 0LL) && (2147483647LL - (long long )C) + (long long )i >= 0LL) && (2147483647LL - (long long )C) + (long long )j >= 0LL) && (2147483648LL - (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL - (long long )j) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )n2 >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )n1 >= 0LL) && (4294967295LL - (long long )N) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )C) + (long long )n1 >= 0LL) && (4294967295LL - (long long )C) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )N >= 0LL) && (long long )i + (long long )j >= 0LL) && (2147483647LL + (long long )i) - (long long )q1_back >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )q2_back >= 0LL) && (2147483647LL + (long long )j) - (long long )n1 >= 0LL) && (2147483647LL + (long long )j) - (long long )n2 >= 0LL) && (4294967295LL + (long long )n1) - (long long )n2 >= 0LL) && (4294967295LL + (long long )N) - (long long )n1 >= 0LL) && (4294967295LL + (long long )N) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )n1 >= 0LL) && (4294967295LL + (long long )C) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )N >= 0LL) && (4294967294LL - (long long )n1) - (long long )n2 >= 0LL) && (4294967294LL - (long long )N) - (long long )n1 >= 0LL) && (4294967294LL - (long long )N) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )n1 >= 0LL) && (4294967294LL - (long long )C) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )N >= 0LL))) && (! multithreaded || (0 <= i && 0 <= j))) && (! multithreaded || 0 <= i) [2024-06-04 16:28:03,181 INFO L97 edCorrectnessWitness]: Location invariant before [L139-L139] (((! multithreaded || 0 <= j) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2147483648LL + (long long )i) + (long long )q1_front >= 0LL && (2147483648LL + (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )i) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )i) + (long long )n1 >= 0LL) && (2147483648LL + (long long )i) + (long long )n2 >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q1_back >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_front >= 0LL) && (2147483648LL + (long long )j) + (long long )q2_back >= 0LL) && (2147483648LL + (long long )j) + (long long )n1 >= 0LL) && (2147483648LL + (long long )j) + (long long )n2 >= 0LL) && (2147483648LL + (long long )N) + (long long )i >= 0LL) && (2147483648LL + (long long )N) + (long long )j >= 0LL) && (2147483648LL + (long long )C) + (long long )i >= 0LL) && (2147483648LL + (long long )C) + (long long )j >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_front) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )q1_back) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )q2_back) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n1) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )n1) + (long long )n2 >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )n2) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )N) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )N) + (long long )n1 >= 0LL) && (4294967296LL + (long long )N) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )C) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )C) + (long long )n1 >= 0LL) && (4294967296LL + (long long )C) + (long long )n2 >= 0LL) && (4294967296LL + (long long )C) + (long long )N >= 0LL) && (2147483647LL - (long long )N) + (long long )i >= 0LL) && (2147483647LL - (long long )N) + (long long )j >= 0LL) && (2147483647LL - (long long )C) + (long long )i >= 0LL) && (2147483647LL - (long long )C) + (long long )j >= 0LL) && (2147483648LL - (long long )i) + (long long )q1_back >= 0LL) && (2147483648LL - (long long )j) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n1) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )n1) + (long long )n2 >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )n2) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )N) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )N) + (long long )n1 >= 0LL) && (4294967295LL - (long long )N) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )C) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )C) + (long long )n1 >= 0LL) && (4294967295LL - (long long )C) + (long long )n2 >= 0LL) && (4294967295LL - (long long )C) + (long long )N >= 0LL) && (long long )i + (long long )j >= 0LL) && (2147483647LL + (long long )i) - (long long )q1_back >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )q2_back >= 0LL) && (2147483647LL + (long long )j) - (long long )n1 >= 0LL) && (2147483647LL + (long long )j) - (long long )n2 >= 0LL) && (4294967295LL + (long long )n1) - (long long )n2 >= 0LL) && (4294967295LL + (long long )N) - (long long )n1 >= 0LL) && (4294967295LL + (long long )N) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )n1 >= 0LL) && (4294967295LL + (long long )C) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )N >= 0LL) && (4294967294LL - (long long )n1) - (long long )n2 >= 0LL) && (4294967294LL - (long long )N) - (long long )n1 >= 0LL) && (4294967294LL - (long long )N) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )n1 >= 0LL) && (4294967294LL - (long long )C) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )N >= 0LL))) && (! multithreaded || (0 <= i && 0 <= j))) && (! multithreaded || 0 <= i) [2024-06-04 16:28:03,182 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 16:28:03,182 INFO L106 edCorrectnessWitness]: ghost_update [L138-L138] multithreaded = 1; [2024-06-04 16:28:03,202 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 16:28:03,335 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:28:03,341 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 16:28:03,560 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:28:03,581 INFO L206 MainTranslator]: Completed translation [2024-06-04 16:28:03,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03 WrapperNode [2024-06-04 16:28:03,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 16:28:03,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 16:28:03,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 16:28:03,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 16:28:03,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03" (1/1) ... [2024-06-04 16:28:03,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03" (1/1) ... [2024-06-04 16:28:03,641 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 301 [2024-06-04 16:28:03,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 16:28:03,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 16:28:03,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 16:28:03,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 16:28:03,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03" (1/1) ... [2024-06-04 16:28:03,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03" (1/1) ... [2024-06-04 16:28:03,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03" (1/1) ... [2024-06-04 16:28:03,670 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-06-04 16:28:03,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03" (1/1) ... [2024-06-04 16:28:03,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03" (1/1) ... [2024-06-04 16:28:03,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03" (1/1) ... [2024-06-04 16:28:03,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03" (1/1) ... [2024-06-04 16:28:03,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03" (1/1) ... [2024-06-04 16:28:03,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03" (1/1) ... [2024-06-04 16:28:03,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 16:28:03,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 16:28:03,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 16:28:03,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 16:28:03,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03" (1/1) ... [2024-06-04 16:28:03,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:28:03,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:28:03,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 16:28:03,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 16:28:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 16:28:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-04 16:28:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-04 16:28:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-04 16:28:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-04 16:28:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-04 16:28:03,810 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-04 16:28:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-04 16:28:03,811 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-04 16:28:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-04 16:28:03,811 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-04 16:28:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-04 16:28:03,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-04 16:28:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 16:28:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-04 16:28:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 16:28:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 16:28:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-04 16:28:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 16:28:03,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 16:28:03,819 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 16:28:03,930 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 16:28:03,932 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 16:28:04,410 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 16:28:04,411 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 16:28:04,695 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 16:28:04,695 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-04 16:28:04,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:28:04 BoogieIcfgContainer [2024-06-04 16:28:04,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 16:28:04,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 16:28:04,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 16:28:04,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 16:28:04,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:28:01" (1/4) ... [2024-06-04 16:28:04,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714cccd2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:28:04, skipping insertion in model container [2024-06-04 16:28:04,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:28:03" (2/4) ... [2024-06-04 16:28:04,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714cccd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:28:04, skipping insertion in model container [2024-06-04 16:28:04,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:28:03" (3/4) ... [2024-06-04 16:28:04,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714cccd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:28:04, skipping insertion in model container [2024-06-04 16:28:04,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:28:04" (4/4) ... [2024-06-04 16:28:04,703 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2024-06-04 16:28:04,716 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 16:28:04,716 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-04 16:28:04,717 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 16:28:04,817 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-04 16:28:04,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 56 transitions, 140 flow [2024-06-04 16:28:04,887 INFO L124 PetriNetUnfolderBase]: 6/52 cut-off events. [2024-06-04 16:28:04,888 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-04 16:28:04,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 52 events. 6/52 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-06-04 16:28:04,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 56 transitions, 140 flow [2024-06-04 16:28:04,895 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 50 transitions, 121 flow [2024-06-04 16:28:04,902 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:28:04,906 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;@dd7479e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:28:04,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-04 16:28:04,910 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:28:04,911 INFO L124 PetriNetUnfolderBase]: 2/10 cut-off events. [2024-06-04 16:28:04,911 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:28:04,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:28:04,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:28:04,912 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:28:04,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:28:04,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1214658719, now seen corresponding path program 1 times [2024-06-04 16:28:04,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:28:04,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374584459] [2024-06-04 16:28:04,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:28:04,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:28:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:28:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:28:06,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:28:06,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374584459] [2024-06-04 16:28:06,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374584459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:28:06,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:28:06,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:28:06,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592385737] [2024-06-04 16:28:06,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:28:06,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:28:06,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:28:06,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:28:06,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:28:06,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 56 [2024-06-04 16:28:06,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:28:06,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:28:06,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 56 [2024-06-04 16:28:06,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:28:07,062 INFO L124 PetriNetUnfolderBase]: 1699/2640 cut-off events. [2024-06-04 16:28:07,063 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2024-06-04 16:28:07,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5024 conditions, 2640 events. 1699/2640 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14508 event pairs, 295 based on Foata normal form. 40/2494 useless extension candidates. Maximal degree in co-relation 4513. Up to 1901 conditions per place. [2024-06-04 16:28:07,104 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 46 selfloop transitions, 4 changer transitions 3/70 dead transitions. [2024-06-04 16:28:07,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 285 flow [2024-06-04 16:28:07,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:28:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:28:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2024-06-04 16:28:07,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6339285714285714 [2024-06-04 16:28:07,115 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 121 flow. Second operand 4 states and 142 transitions. [2024-06-04 16:28:07,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 285 flow [2024-06-04 16:28:07,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 261 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-04 16:28:07,123 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 134 flow [2024-06-04 16:28:07,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2024-06-04 16:28:07,126 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-06-04 16:28:07,126 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 134 flow [2024-06-04 16:28:07,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:28:07,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:28:07,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:28:07,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 16:28:07,127 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:28:07,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:28:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash -167942174, now seen corresponding path program 1 times [2024-06-04 16:28:07,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:28:07,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286787023] [2024-06-04 16:28:07,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:28:07,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:28:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:28:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:28:07,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:28:07,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286787023] [2024-06-04 16:28:07,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286787023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:28:07,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:28:07,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:28:07,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583120347] [2024-06-04 16:28:07,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:28:07,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:28:07,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:28:07,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:28:07,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:28:07,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2024-06-04 16:28:07,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:28:07,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:28:07,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2024-06-04 16:28:07,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:28:07,652 INFO L124 PetriNetUnfolderBase]: 1569/2695 cut-off events. [2024-06-04 16:28:07,652 INFO L125 PetriNetUnfolderBase]: For 803/851 co-relation queries the response was YES. [2024-06-04 16:28:07,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5922 conditions, 2695 events. 1569/2695 cut-off events. For 803/851 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18236 event pairs, 1080 based on Foata normal form. 157/2641 useless extension candidates. Maximal degree in co-relation 2045. Up to 1547 conditions per place. [2024-06-04 16:28:07,667 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 52 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2024-06-04 16:28:07,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 77 transitions, 315 flow [2024-06-04 16:28:07,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:28:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:28:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2024-06-04 16:28:07,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-06-04 16:28:07,673 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 134 flow. Second operand 5 states and 180 transitions. [2024-06-04 16:28:07,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 77 transitions, 315 flow [2024-06-04 16:28:07,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 77 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:28:07,679 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 163 flow [2024-06-04 16:28:07,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-06-04 16:28:07,680 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 1 predicate places. [2024-06-04 16:28:07,684 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 163 flow [2024-06-04 16:28:07,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:28:07,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:28:07,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:28:07,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 16:28:07,685 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:28:07,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:28:07,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1766562398, now seen corresponding path program 1 times [2024-06-04 16:28:07,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:28:07,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595439740] [2024-06-04 16:28:07,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:28:07,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:28:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:28:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:28:09,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:28:09,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595439740] [2024-06-04 16:28:09,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595439740] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:28:09,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195833683] [2024-06-04 16:28:09,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:28:09,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:28:09,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:28:09,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:28:09,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-04 16:28:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:28:09,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 32 conjunts are in the unsatisfiable core [2024-06-04 16:28:09,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:28:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:28:09,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:28:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:28:14,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195833683] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-04 16:28:14,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-04 16:28:14,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2024-06-04 16:28:14,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383977402] [2024-06-04 16:28:14,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-04 16:28:14,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-04 16:28:14,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:28:14,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-04 16:28:14,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2024-06-04 16:28:15,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 56 [2024-06-04 16:28:15,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 163 flow. Second operand has 17 states, 17 states have (on average 22.764705882352942) internal successors, (387), 17 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:28:15,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:28:15,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 56 [2024-06-04 16:28:15,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:28:16,704 INFO L124 PetriNetUnfolderBase]: 1987/3369 cut-off events. [2024-06-04 16:28:16,704 INFO L125 PetriNetUnfolderBase]: For 1551/1551 co-relation queries the response was YES. [2024-06-04 16:28:16,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7450 conditions, 3369 events. 1987/3369 cut-off events. For 1551/1551 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 22741 event pairs, 1089 based on Foata normal form. 294/3461 useless extension candidates. Maximal degree in co-relation 6047. Up to 2137 conditions per place. [2024-06-04 16:28:16,711 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 0 selfloop transitions, 0 changer transitions 93/93 dead transitions. [2024-06-04 16:28:16,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 93 transitions, 416 flow [2024-06-04 16:28:16,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:28:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:28:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 252 transitions. [2024-06-04 16:28:16,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-06-04 16:28:16,714 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 163 flow. Second operand 8 states and 252 transitions. [2024-06-04 16:28:16,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 93 transitions, 416 flow [2024-06-04 16:28:16,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 93 transitions, 412 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-04 16:28:16,717 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2024-06-04 16:28:16,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2024-06-04 16:28:16,718 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-06-04 16:28:16,718 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2024-06-04 16:28:16,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 22.764705882352942) internal successors, (387), 17 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:28:16,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 8 remaining) [2024-06-04 16:28:16,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 8 remaining) [2024-06-04 16:28:16,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-06-04 16:28:16,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 8 remaining) [2024-06-04 16:28:16,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-06-04 16:28:16,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-06-04 16:28:16,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-06-04 16:28:16,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-06-04 16:28:16,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-04 16:28:16,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:28:16,935 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-06-04 16:28:16,938 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 16:28:16,938 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 16:28:16,941 INFO L507 ceAbstractionStarter]: Automizer considered 4 witness invariants [2024-06-04 16:28:16,942 INFO L508 ceAbstractionStarter]: WitnessConsidered=4 [2024-06-04 16:28:16,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 04:28:16 BasicIcfg [2024-06-04 16:28:16,942 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 16:28:16,946 INFO L158 Benchmark]: Toolchain (without parser) took 13795.98ms. Allocated memory was 138.4MB in the beginning and 637.5MB in the end (delta: 499.1MB). Free memory was 79.0MB in the beginning and 501.9MB in the end (delta: -422.9MB). Peak memory consumption was 377.8MB. Max. memory is 16.1GB. [2024-06-04 16:28:16,946 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 16:28:16,946 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 138.4MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 16:28:16,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.89ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 79.0MB in the beginning and 160.4MB in the end (delta: -81.4MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2024-06-04 16:28:16,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.27ms. Allocated memory is still 197.1MB. Free memory was 160.4MB in the beginning and 156.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-04 16:28:16,948 INFO L158 Benchmark]: Boogie Preprocessor took 77.06ms. Allocated memory is still 197.1MB. Free memory was 156.2MB in the beginning and 152.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-04 16:28:16,950 INFO L158 Benchmark]: RCFGBuilder took 976.86ms. Allocated memory is still 197.1MB. Free memory was 152.0MB in the beginning and 83.8MB in the end (delta: 68.2MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2024-06-04 16:28:16,952 INFO L158 Benchmark]: TraceAbstraction took 12244.33ms. Allocated memory was 197.1MB in the beginning and 637.5MB in the end (delta: 440.4MB). Free memory was 82.8MB in the beginning and 501.9MB in the end (delta: -419.1MB). Peak memory consumption was 322.2MB. Max. memory is 16.1GB. [2024-06-04 16:28:16,953 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 138.4MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.89ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 79.0MB in the beginning and 160.4MB in the end (delta: -81.4MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.27ms. Allocated memory is still 197.1MB. Free memory was 160.4MB in the beginning and 156.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.06ms. Allocated memory is still 197.1MB. Free memory was 156.2MB in the beginning and 152.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 976.86ms. Allocated memory is still 197.1MB. Free memory was 152.0MB in the beginning and 83.8MB in the end (delta: 68.2MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12244.33ms. Allocated memory was 197.1MB in the beginning and 637.5MB in the end (delta: 440.4MB). Free memory was 82.8MB in the beginning and 501.9MB in the end (delta: -419.1MB). Peak memory consumption was 322.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 140]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 141]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 142]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 79 locations, 8 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: 12.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 349 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1240 IncrementalHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 4 mSDtfsCounter, 1240 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=2, InterpolantAutomatonStates: 17, 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, 8.3s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 5333 SizeOfPredicates, 2 NumberOfNonLiveVariables, 144 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-04 16:28:16,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE