./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-03 21:02:26,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 21:02:26,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 21:02:26,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 21:02:26,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 21:02:26,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 21:02:26,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 21:02:26,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 21:02:26,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 21:02:26,749 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 21:02:26,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 21:02:26,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 21:02:26,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 21:02:26,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 21:02:26,752 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 21:02:26,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 21:02:26,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 21:02:26,753 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 21:02:26,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 21:02:26,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 21:02:26,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 21:02:26,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 21:02:26,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 21:02:26,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 21:02:26,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 21:02:26,754 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 21:02:26,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 21:02:26,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 21:02:26,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 21:02:26,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 21:02:26,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 21:02:26,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 21:02:26,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:02:26,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 21:02:26,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 21:02:26,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 21:02:26,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 21:02:26,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 21:02:26,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 21:02:26,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 21:02:26,758 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 21:02:26,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 21:02:26,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 21:02:26,759 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 21:02:26,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 21:02:27,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 21:02:27,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 21:02:27,016 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 21:02:27,017 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 21:02:27,018 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-03 21:02:27,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 21:02:27,117 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 21:02:27,118 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-03 21:02:28,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 21:02:28,406 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 21:02:28,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2024-06-03 21:02:28,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a2c7218/46d23480dfe54886a0252a2305927f80/FLAG0ecb7e2f0 [2024-06-03 21:02:28,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a2c7218/46d23480dfe54886a0252a2305927f80 [2024-06-03 21:02:28,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 21:02:28,425 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 21:02:28,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 21:02:28,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 21:02:28,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 21:02:28,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:02:27" (1/2) ... [2024-06-03 21:02:28,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@696e275 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:02:28, skipping insertion in model container [2024-06-03 21:02:28,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:02:27" (1/2) ... [2024-06-03 21:02:28,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1d8dc5c2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:02:28, skipping insertion in model container [2024-06-03 21:02:28,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:02:28" (2/2) ... [2024-06-03 21:02:28,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@696e275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28, skipping insertion in model container [2024-06-03 21:02:28,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:02:28" (2/2) ... [2024-06-03 21:02:28,433 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 21:02:28,449 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 21:02:28,450 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-03 21:02:28,451 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-03 21:02:28,451 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-03 21:02:28,452 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-03 21:02:28,452 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 21:02:28,453 INFO L106 edCorrectnessWitness]: ghost_update [L138-L138] multithreaded = 1; [2024-06-03 21:02:28,475 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 21:02:28,742 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:02:28,761 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-03 21:02:28,965 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:02:28,979 INFO L206 MainTranslator]: Completed translation [2024-06-03 21:02:28,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28 WrapperNode [2024-06-03 21:02:28,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 21:02:28,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 21:02:28,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 21:02:28,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 21:02:28,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28" (1/1) ... [2024-06-03 21:02:29,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28" (1/1) ... [2024-06-03 21:02:29,038 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 297 [2024-06-03 21:02:29,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 21:02:29,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 21:02:29,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 21:02:29,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 21:02:29,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28" (1/1) ... [2024-06-03 21:02:29,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28" (1/1) ... [2024-06-03 21:02:29,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28" (1/1) ... [2024-06-03 21:02:29,068 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-03 21:02:29,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28" (1/1) ... [2024-06-03 21:02:29,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28" (1/1) ... [2024-06-03 21:02:29,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28" (1/1) ... [2024-06-03 21:02:29,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28" (1/1) ... [2024-06-03 21:02:29,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28" (1/1) ... [2024-06-03 21:02:29,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28" (1/1) ... [2024-06-03 21:02:29,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 21:02:29,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 21:02:29,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 21:02:29,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 21:02:29,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28" (1/1) ... [2024-06-03 21:02:29,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:02:29,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:02:29,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-03 21:02:29,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-03 21:02:29,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 21:02:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-03 21:02:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-03 21:02:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-03 21:02:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-03 21:02:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-03 21:02:29,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-03 21:02:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-03 21:02:29,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-03 21:02:29,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-03 21:02:29,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-03 21:02:29,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-03 21:02:29,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-03 21:02:29,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 21:02:29,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-03 21:02:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 21:02:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 21:02:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-03 21:02:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 21:02:29,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 21:02:29,158 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 21:02:29,241 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 21:02:29,242 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 21:02:29,792 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 21:02:29,796 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 21:02:30,085 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 21:02:30,085 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-03 21:02:30,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:02:30 BoogieIcfgContainer [2024-06-03 21:02:30,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 21:02:30,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 21:02:30,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 21:02:30,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 21:02:30,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:02:27" (1/4) ... [2024-06-03 21:02:30,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb8b42e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:02:30, skipping insertion in model container [2024-06-03 21:02:30,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:02:28" (2/4) ... [2024-06-03 21:02:30,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb8b42e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:02:30, skipping insertion in model container [2024-06-03 21:02:30,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:02:28" (3/4) ... [2024-06-03 21:02:30,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb8b42e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:02:30, skipping insertion in model container [2024-06-03 21:02:30,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:02:30" (4/4) ... [2024-06-03 21:02:30,094 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2024-06-03 21:02:30,107 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 21:02:30,108 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-03 21:02:30,108 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 21:02:30,187 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-03 21:02:30,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 52 transitions, 132 flow [2024-06-03 21:02:30,273 INFO L124 PetriNetUnfolderBase]: 6/48 cut-off events. [2024-06-03 21:02:30,274 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-03 21:02:30,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 48 events. 6/48 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-06-03 21:02:30,278 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 52 transitions, 132 flow [2024-06-03 21:02:30,281 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 46 transitions, 113 flow [2024-06-03 21:02:30,292 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 21:02:30,302 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;@1ead8784, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 21:02:30,302 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-03 21:02:30,308 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 21:02:30,308 INFO L124 PetriNetUnfolderBase]: 2/12 cut-off events. [2024-06-03 21:02:30,309 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:02:30,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:02:30,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:02:30,310 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-03 21:02:30,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:02:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash -373514412, now seen corresponding path program 1 times [2024-06-03 21:02:30,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:02:30,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278260255] [2024-06-03 21:02:30,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:02:30,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:02:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:02:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:02:31,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:02:31,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278260255] [2024-06-03 21:02:31,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278260255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:02:31,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:02:31,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 21:02:31,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859604352] [2024-06-03 21:02:31,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:02:31,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 21:02:31,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:02:31,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 21:02:31,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 21:02:31,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2024-06-03 21:02:31,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:02:31,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:02:31,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2024-06-03 21:02:31,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:02:32,404 INFO L124 PetriNetUnfolderBase]: 1699/2639 cut-off events. [2024-06-03 21:02:32,405 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2024-06-03 21:02:32,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5023 conditions, 2639 events. 1699/2639 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14070 event pairs, 295 based on Foata normal form. 46/2529 useless extension candidates. Maximal degree in co-relation 4512. Up to 1901 conditions per place. [2024-06-03 21:02:32,424 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 46 selfloop transitions, 4 changer transitions 3/66 dead transitions. [2024-06-03 21:02:32,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 277 flow [2024-06-03 21:02:32,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 21:02:32,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 21:02:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-06-03 21:02:32,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2024-06-03 21:02:32,437 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 113 flow. Second operand 4 states and 126 transitions. [2024-06-03 21:02:32,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 277 flow [2024-06-03 21:02:32,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 253 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-03 21:02:32,447 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 126 flow [2024-06-03 21:02:32,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2024-06-03 21:02:32,452 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-06-03 21:02:32,452 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 126 flow [2024-06-03 21:02:32,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:02:32,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:02:32,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:02:32,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 21:02:32,453 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-03 21:02:32,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:02:32,454 INFO L85 PathProgramCache]: Analyzing trace with hash 893480601, now seen corresponding path program 1 times [2024-06-03 21:02:32,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:02:32,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130101894] [2024-06-03 21:02:32,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:02:32,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:02:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:02:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:02:32,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:02:32,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130101894] [2024-06-03 21:02:32,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130101894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:02:32,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:02:32,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 21:02:32,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342609634] [2024-06-03 21:02:32,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:02:32,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 21:02:32,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:02:32,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 21:02:32,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 21:02:32,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-06-03 21:02:32,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 126 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-03 21:02:32,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:02:32,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-06-03 21:02:32,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:02:32,992 INFO L124 PetriNetUnfolderBase]: 1569/2615 cut-off events. [2024-06-03 21:02:32,992 INFO L125 PetriNetUnfolderBase]: For 803/811 co-relation queries the response was YES. [2024-06-03 21:02:32,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5842 conditions, 2615 events. 1569/2615 cut-off events. For 803/811 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16431 event pairs, 1080 based on Foata normal form. 158/2691 useless extension candidates. Maximal degree in co-relation 2023. Up to 1547 conditions per place. [2024-06-03 21:02:33,006 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 52 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2024-06-03 21:02:33,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 307 flow [2024-06-03 21:02:33,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:02:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:02:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-06-03 21:02:33,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-06-03 21:02:33,008 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 126 flow. Second operand 5 states and 160 transitions. [2024-06-03 21:02:33,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 307 flow [2024-06-03 21:02:33,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 21:02:33,010 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 155 flow [2024-06-03 21:02:33,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-06-03 21:02:33,011 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2024-06-03 21:02:33,011 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 155 flow [2024-06-03 21:02:33,011 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-03 21:02:33,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:02:33,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:02:33,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 21:02:33,012 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-03 21:02:33,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:02:33,012 INFO L85 PathProgramCache]: Analyzing trace with hash 876986057, now seen corresponding path program 1 times [2024-06-03 21:02:33,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:02:33,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952877024] [2024-06-03 21:02:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:02:33,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:02:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:02:34,554 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-03 21:02:34,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:02:34,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952877024] [2024-06-03 21:02:34,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952877024] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-03 21:02:34,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488766944] [2024-06-03 21:02:34,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:02:34,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:02:34,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:02:34,573 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-03 21:02:34,582 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-03 21:02:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:02:34,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 32 conjunts are in the unsatisfiable core [2024-06-03 21:02:34,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 21:02:35,235 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-03 21:02:35,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-03 21:02:39,787 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-03 21:02:39,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488766944] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-03 21:02:39,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-03 21:02:39,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2024-06-03 21:02:39,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305030008] [2024-06-03 21:02:39,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-03 21:02:39,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-03 21:02:39,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:02:39,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-03 21:02:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-06-03 21:02:40,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2024-06-03 21:02:40,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 155 flow. Second operand has 17 states, 17 states have (on average 18.764705882352942) internal successors, (319), 17 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:02:40,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:02:40,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2024-06-03 21:02:40,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:02:42,580 INFO L124 PetriNetUnfolderBase]: 2482/4159 cut-off events. [2024-06-03 21:02:42,580 INFO L125 PetriNetUnfolderBase]: For 2015/2015 co-relation queries the response was YES. [2024-06-03 21:02:42,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9234 conditions, 4159 events. 2482/4159 cut-off events. For 2015/2015 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 27492 event pairs, 1225 based on Foata normal form. 454/4494 useless extension candidates. Maximal degree in co-relation 7858. Up to 2229 conditions per place. [2024-06-03 21:02:42,589 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 0 selfloop transitions, 0 changer transitions 130/130 dead transitions. [2024-06-03 21:02:42,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 130 transitions, 599 flow [2024-06-03 21:02:42,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:02:42,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:02:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 319 transitions. [2024-06-03 21:02:42,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2024-06-03 21:02:42,594 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 155 flow. Second operand 11 states and 319 transitions. [2024-06-03 21:02:42,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 130 transitions, 599 flow [2024-06-03 21:02:42,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 130 transitions, 595 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-03 21:02:42,598 INFO L231 Difference]: Finished difference. Result has 59 places, 0 transitions, 0 flow [2024-06-03 21:02:42,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=59, PETRI_TRANSITIONS=0} [2024-06-03 21:02:42,599 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2024-06-03 21:02:42,599 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 0 transitions, 0 flow [2024-06-03 21:02:42,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.764705882352942) internal successors, (319), 17 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:02:42,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 8 remaining) [2024-06-03 21:02:42,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 8 remaining) [2024-06-03 21:02:42,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-06-03 21:02:42,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 8 remaining) [2024-06-03 21:02:42,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-06-03 21:02:42,605 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-06-03 21:02:42,605 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-06-03 21:02:42,605 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-06-03 21:02:42,629 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-03 21:02:42,832 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-03 21:02:42,832 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-06-03 21:02:42,835 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 21:02:42,835 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 21:02:42,839 INFO L507 ceAbstractionStarter]: Automizer considered 4 witness invariants [2024-06-03 21:02:42,839 INFO L508 ceAbstractionStarter]: WitnessConsidered=4 [2024-06-03 21:02:42,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 09:02:42 BasicIcfg [2024-06-03 21:02:42,840 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 21:02:42,843 INFO L158 Benchmark]: Toolchain (without parser) took 14415.60ms. Allocated memory was 113.2MB in the beginning and 549.5MB in the end (delta: 436.2MB). Free memory was 56.3MB in the beginning and 431.5MB in the end (delta: -375.2MB). Peak memory consumption was 330.5MB. Max. memory is 16.1GB. [2024-06-03 21:02:42,844 INFO L158 Benchmark]: Witness Parser took 0.11ms. Allocated memory is still 113.2MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 21:02:42,844 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 113.2MB. Free memory was 72.0MB in the beginning and 71.9MB in the end (delta: 74.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 21:02:42,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.19ms. Allocated memory was 113.2MB in the beginning and 138.4MB in the end (delta: 25.2MB). Free memory was 56.1MB in the beginning and 94.7MB in the end (delta: -38.5MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-06-03 21:02:42,845 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.29ms. Allocated memory is still 138.4MB. Free memory was 94.7MB in the beginning and 89.8MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-03 21:02:42,847 INFO L158 Benchmark]: Boogie Preprocessor took 48.58ms. Allocated memory is still 138.4MB. Free memory was 89.8MB in the beginning and 86.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-03 21:02:42,847 INFO L158 Benchmark]: RCFGBuilder took 997.86ms. Allocated memory is still 138.4MB. Free memory was 86.5MB in the beginning and 65.2MB in the end (delta: 21.3MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2024-06-03 21:02:42,850 INFO L158 Benchmark]: TraceAbstraction took 12752.01ms. Allocated memory was 138.4MB in the beginning and 549.5MB in the end (delta: 411.0MB). Free memory was 65.2MB in the beginning and 431.5MB in the end (delta: -366.3MB). Peak memory consumption was 312.3MB. Max. memory is 16.1GB. [2024-06-03 21:02:42,852 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.11ms. Allocated memory is still 113.2MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.09ms. Allocated memory is still 113.2MB. Free memory was 72.0MB in the beginning and 71.9MB in the end (delta: 74.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 554.19ms. Allocated memory was 113.2MB in the beginning and 138.4MB in the end (delta: 25.2MB). Free memory was 56.1MB in the beginning and 94.7MB in the end (delta: -38.5MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.29ms. Allocated memory is still 138.4MB. Free memory was 94.7MB in the beginning and 89.8MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.58ms. Allocated memory is still 138.4MB. Free memory was 89.8MB in the beginning and 86.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 997.86ms. Allocated memory is still 138.4MB. Free memory was 86.5MB in the beginning and 65.2MB in the end (delta: 21.3MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12752.01ms. Allocated memory was 138.4MB in the beginning and 549.5MB in the end (delta: 411.0MB). Free memory was 65.2MB in the beginning and 431.5MB in the end (delta: -366.3MB). Peak memory consumption was 312.3MB. 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, 71 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.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 461 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 413 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1730 IncrementalHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 4 mSDtfsCounter, 1730 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=2, InterpolantAutomatonStates: 20, 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.1s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 4993 SizeOfPredicates, 2 NumberOfNonLiveVariables, 136 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-03 21:02:42,888 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 Result: TRUE