./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.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-bad-buffer-mult-alt.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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-bad-buffer-mult-alt.wvr.c ./goblint.2024-05-21_14-57-05.files/mutex-meet/popl20-bad-buffer-mult-alt.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-cde23df-m [2024-06-14 16:14:11,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 16:14:11,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 16:14:11,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 16:14:11,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 16:14:11,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 16:14:11,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 16:14:11,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 16:14:11,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 16:14:11,620 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 16:14:11,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 16:14:11,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 16:14:11,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 16:14:11,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 16:14:11,621 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 16:14:11,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 16:14:11,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 16:14:11,622 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 16:14:11,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 16:14:11,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 16:14:11,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 16:14:11,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 16:14:11,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 16:14:11,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 16:14:11,624 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 16:14:11,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 16:14:11,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 16:14:11,625 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 16:14:11,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 16:14:11,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 16:14:11,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 16:14:11,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 16:14:11,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 16:14:11,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 16:14:11,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 16:14:11,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 16:14:11,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 16:14:11,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 16:14:11,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 16:14:11,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 16:14:11,629 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 16:14:11,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 16:14:11,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 16:14:11,641 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-14 16:14:11,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 16:14:11,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 16:14:11,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 16:14:11,869 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 16:14:11,870 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 16:14:11,871 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-bad-buffer-mult-alt.wvr.yml/witness.yml [2024-06-14 16:14:12,066 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 16:14:12,067 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 16:14:12,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2024-06-14 16:14:13,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 16:14:13,254 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 16:14:13,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2024-06-14 16:14:13,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/800bdc52c/1e67aa9820204281a37597751ec6a235/FLAG1731dfd08 [2024-06-14 16:14:13,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/800bdc52c/1e67aa9820204281a37597751ec6a235 [2024-06-14 16:14:13,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 16:14:13,286 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 16:14:13,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 16:14:13,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 16:14:13,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 16:14:13,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:14:12" (1/2) ... [2024-06-14 16:14:13,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6087a4fe and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:14:13, skipping insertion in model container [2024-06-14 16:14:13,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:14:12" (1/2) ... [2024-06-14 16:14:13,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4188b80b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:14:13, skipping insertion in model container [2024-06-14 16:14:13,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 04:14:13" (2/2) ... [2024-06-14 16:14:13,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6087a4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13, skipping insertion in model container [2024-06-14 16:14:13,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 04:14:13" (2/2) ... [2024-06-14 16:14:13,294 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 16:14:13,312 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 16:14:13,313 INFO L97 edCorrectnessWitness]: Location invariant before [L148-L148] (((! 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 )C) + (long long )i >= 0LL) && (2147483648LL + (long long )C) + (long long )j >= 0LL) && (2147483648LL + (long long )N) + (long long )i >= 0LL) && (2147483648LL + (long long )N) + (long long )j >= 0LL) && (2147483648LL + (long long )M) + (long long )i >= 0LL) && (2147483648LL + (long long )M) + (long long )j >= 0LL) && (4294967296LL + (long long )C) + (long long )N >= 0LL) && (4294967296LL + (long long )C) + (long long )M >= 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 )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 )M) + (long long )N >= 0LL) && (4294967296LL + (long long )M) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )M) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )M) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )M) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )M) + (long long )n1 >= 0LL) && (4294967296LL + (long long )M) + (long long )n2 >= 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) && (2147483647LL - (long long )C) + (long long )i >= 0LL) && (2147483647LL - (long long )C) + (long long )j >= 0LL) && (2147483647LL - (long long )N) + (long long )i >= 0LL) && (2147483647LL - (long long )N) + (long long )j >= 0LL) && (2147483647LL - (long long )M) + (long long )i >= 0LL) && (2147483647LL - (long long )M) + (long long )j >= 0LL) && (4294967295LL - (long long )C) + (long long )N >= 0LL) && (4294967295LL - (long long )C) + (long long )M >= 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 )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 )M) + (long long )N >= 0LL) && (4294967295LL - (long long )M) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )M) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )M) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )M) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )M) + (long long )n1 >= 0LL) && (4294967295LL - (long long )M) + (long long )n2 >= 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) && (long long )i + (long long )j >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )n1 >= 0LL) && (2147483647LL + (long long )j) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )N >= 0LL) && (4294967295LL + (long long )C) - (long long )M >= 0LL) && (4294967295LL + (long long )C) - (long long )n1 >= 0LL) && (4294967295LL + (long long )C) - (long long )n2 >= 0LL) && (4294967295LL + (long long )N) - (long long )n1 >= 0LL) && (4294967295LL + (long long )N) - (long long )n2 >= 0LL) && (4294967295LL + (long long )M) - (long long )N >= 0LL) && (4294967295LL + (long long )M) - (long long )n1 >= 0LL) && (4294967295LL + (long long )M) - (long long )n2 >= 0LL) && (4294967295LL + (long long )n1) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )N >= 0LL) && (4294967294LL - (long long )C) - (long long )M >= 0LL) && (4294967294LL - (long long )C) - (long long )n1 >= 0LL) && (4294967294LL - (long long )C) - (long long )n2 >= 0LL) && (4294967294LL - (long long )N) - (long long )n1 >= 0LL) && (4294967294LL - (long long )N) - (long long )n2 >= 0LL) && (4294967294LL - (long long )M) - (long long )N >= 0LL) && (4294967294LL - (long long )M) - (long long )n1 >= 0LL) && (4294967294LL - (long long )M) - (long long )n2 >= 0LL) && (4294967294LL - (long long )n1) - (long long )n2 >= 0LL)) && (! multithreaded || 0 <= i)) && (! multithreaded || (0 <= i && 0 <= j))) && (! multithreaded || 0 <= j) [2024-06-14 16:14:13,314 INFO L97 edCorrectnessWitness]: Location invariant before [L146-L146] (((! 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 )C) + (long long )i >= 0LL) && (2147483648LL + (long long )C) + (long long )j >= 0LL) && (2147483648LL + (long long )N) + (long long )i >= 0LL) && (2147483648LL + (long long )N) + (long long )j >= 0LL) && (2147483648LL + (long long )M) + (long long )i >= 0LL) && (2147483648LL + (long long )M) + (long long )j >= 0LL) && (4294967296LL + (long long )C) + (long long )N >= 0LL) && (4294967296LL + (long long )C) + (long long )M >= 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 )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 )M) + (long long )N >= 0LL) && (4294967296LL + (long long )M) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )M) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )M) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )M) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )M) + (long long )n1 >= 0LL) && (4294967296LL + (long long )M) + (long long )n2 >= 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) && (2147483647LL - (long long )C) + (long long )i >= 0LL) && (2147483647LL - (long long )C) + (long long )j >= 0LL) && (2147483647LL - (long long )N) + (long long )i >= 0LL) && (2147483647LL - (long long )N) + (long long )j >= 0LL) && (2147483647LL - (long long )M) + (long long )i >= 0LL) && (2147483647LL - (long long )M) + (long long )j >= 0LL) && (4294967295LL - (long long )C) + (long long )N >= 0LL) && (4294967295LL - (long long )C) + (long long )M >= 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 )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 )M) + (long long )N >= 0LL) && (4294967295LL - (long long )M) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )M) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )M) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )M) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )M) + (long long )n1 >= 0LL) && (4294967295LL - (long long )M) + (long long )n2 >= 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) && (long long )i + (long long )j >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )n1 >= 0LL) && (2147483647LL + (long long )j) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )N >= 0LL) && (4294967295LL + (long long )C) - (long long )M >= 0LL) && (4294967295LL + (long long )C) - (long long )n1 >= 0LL) && (4294967295LL + (long long )C) - (long long )n2 >= 0LL) && (4294967295LL + (long long )N) - (long long )n1 >= 0LL) && (4294967295LL + (long long )N) - (long long )n2 >= 0LL) && (4294967295LL + (long long )M) - (long long )N >= 0LL) && (4294967295LL + (long long )M) - (long long )n1 >= 0LL) && (4294967295LL + (long long )M) - (long long )n2 >= 0LL) && (4294967295LL + (long long )n1) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )N >= 0LL) && (4294967294LL - (long long )C) - (long long )M >= 0LL) && (4294967294LL - (long long )C) - (long long )n1 >= 0LL) && (4294967294LL - (long long )C) - (long long )n2 >= 0LL) && (4294967294LL - (long long )N) - (long long )n1 >= 0LL) && (4294967294LL - (long long )N) - (long long )n2 >= 0LL) && (4294967294LL - (long long )M) - (long long )N >= 0LL) && (4294967294LL - (long long )M) - (long long )n1 >= 0LL) && (4294967294LL - (long long )M) - (long long )n2 >= 0LL) && (4294967294LL - (long long )n1) - (long long )n2 >= 0LL)) && (! multithreaded || 0 <= i)) && (! multithreaded || (0 <= i && 0 <= j))) && (! multithreaded || 0 <= j) [2024-06-14 16:14:13,314 INFO L97 edCorrectnessWitness]: Location invariant before [L145-L145] (((! 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 )C) + (long long )i >= 0LL) && (2147483648LL + (long long )C) + (long long )j >= 0LL) && (2147483648LL + (long long )N) + (long long )i >= 0LL) && (2147483648LL + (long long )N) + (long long )j >= 0LL) && (2147483648LL + (long long )M) + (long long )i >= 0LL) && (2147483648LL + (long long )M) + (long long )j >= 0LL) && (4294967296LL + (long long )C) + (long long )N >= 0LL) && (4294967296LL + (long long )C) + (long long )M >= 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 )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 )M) + (long long )N >= 0LL) && (4294967296LL + (long long )M) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )M) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )M) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )M) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )M) + (long long )n1 >= 0LL) && (4294967296LL + (long long )M) + (long long )n2 >= 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) && (2147483647LL - (long long )C) + (long long )i >= 0LL) && (2147483647LL - (long long )C) + (long long )j >= 0LL) && (2147483647LL - (long long )N) + (long long )i >= 0LL) && (2147483647LL - (long long )N) + (long long )j >= 0LL) && (2147483647LL - (long long )M) + (long long )i >= 0LL) && (2147483647LL - (long long )M) + (long long )j >= 0LL) && (4294967295LL - (long long )C) + (long long )N >= 0LL) && (4294967295LL - (long long )C) + (long long )M >= 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 )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 )M) + (long long )N >= 0LL) && (4294967295LL - (long long )M) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )M) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )M) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )M) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )M) + (long long )n1 >= 0LL) && (4294967295LL - (long long )M) + (long long )n2 >= 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) && (long long )i + (long long )j >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )n1 >= 0LL) && (2147483647LL + (long long )j) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )N >= 0LL) && (4294967295LL + (long long )C) - (long long )M >= 0LL) && (4294967295LL + (long long )C) - (long long )n1 >= 0LL) && (4294967295LL + (long long )C) - (long long )n2 >= 0LL) && (4294967295LL + (long long )N) - (long long )n1 >= 0LL) && (4294967295LL + (long long )N) - (long long )n2 >= 0LL) && (4294967295LL + (long long )M) - (long long )N >= 0LL) && (4294967295LL + (long long )M) - (long long )n1 >= 0LL) && (4294967295LL + (long long )M) - (long long )n2 >= 0LL) && (4294967295LL + (long long )n1) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )N >= 0LL) && (4294967294LL - (long long )C) - (long long )M >= 0LL) && (4294967294LL - (long long )C) - (long long )n1 >= 0LL) && (4294967294LL - (long long )C) - (long long )n2 >= 0LL) && (4294967294LL - (long long )N) - (long long )n1 >= 0LL) && (4294967294LL - (long long )N) - (long long )n2 >= 0LL) && (4294967294LL - (long long )M) - (long long )N >= 0LL) && (4294967294LL - (long long )M) - (long long )n1 >= 0LL) && (4294967294LL - (long long )M) - (long long )n2 >= 0LL) && (4294967294LL - (long long )n1) - (long long )n2 >= 0LL)) && (! multithreaded || 0 <= i)) && (! multithreaded || (0 <= i && 0 <= j))) && (! multithreaded || 0 <= j) [2024-06-14 16:14:13,314 INFO L97 edCorrectnessWitness]: Location invariant before [L147-L147] (((! 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 )C) + (long long )i >= 0LL) && (2147483648LL + (long long )C) + (long long )j >= 0LL) && (2147483648LL + (long long )N) + (long long )i >= 0LL) && (2147483648LL + (long long )N) + (long long )j >= 0LL) && (2147483648LL + (long long )M) + (long long )i >= 0LL) && (2147483648LL + (long long )M) + (long long )j >= 0LL) && (4294967296LL + (long long )C) + (long long )N >= 0LL) && (4294967296LL + (long long )C) + (long long )M >= 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 )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 )M) + (long long )N >= 0LL) && (4294967296LL + (long long )M) + (long long )q1_front >= 0LL) && (4294967296LL + (long long )M) + (long long )q1_back >= 0LL) && (4294967296LL + (long long )M) + (long long )q2_front >= 0LL) && (4294967296LL + (long long )M) + (long long )q2_back >= 0LL) && (4294967296LL + (long long )M) + (long long )n1 >= 0LL) && (4294967296LL + (long long )M) + (long long )n2 >= 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) && (2147483647LL - (long long )C) + (long long )i >= 0LL) && (2147483647LL - (long long )C) + (long long )j >= 0LL) && (2147483647LL - (long long )N) + (long long )i >= 0LL) && (2147483647LL - (long long )N) + (long long )j >= 0LL) && (2147483647LL - (long long )M) + (long long )i >= 0LL) && (2147483647LL - (long long )M) + (long long )j >= 0LL) && (4294967295LL - (long long )C) + (long long )N >= 0LL) && (4294967295LL - (long long )C) + (long long )M >= 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 )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 )M) + (long long )N >= 0LL) && (4294967295LL - (long long )M) + (long long )q1_front >= 0LL) && (4294967295LL - (long long )M) + (long long )q1_back >= 0LL) && (4294967295LL - (long long )M) + (long long )q2_front >= 0LL) && (4294967295LL - (long long )M) + (long long )q2_back >= 0LL) && (4294967295LL - (long long )M) + (long long )n1 >= 0LL) && (4294967295LL - (long long )M) + (long long )n2 >= 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) && (long long )i + (long long )j >= 0LL) && (2147483647LL + (long long )i) - (long long )n1 >= 0LL) && (2147483647LL + (long long )i) - (long long )n2 >= 0LL) && (2147483647LL + (long long )j) - (long long )n1 >= 0LL) && (2147483647LL + (long long )j) - (long long )n2 >= 0LL) && (4294967295LL + (long long )C) - (long long )N >= 0LL) && (4294967295LL + (long long )C) - (long long )M >= 0LL) && (4294967295LL + (long long )C) - (long long )n1 >= 0LL) && (4294967295LL + (long long )C) - (long long )n2 >= 0LL) && (4294967295LL + (long long )N) - (long long )n1 >= 0LL) && (4294967295LL + (long long )N) - (long long )n2 >= 0LL) && (4294967295LL + (long long )M) - (long long )N >= 0LL) && (4294967295LL + (long long )M) - (long long )n1 >= 0LL) && (4294967295LL + (long long )M) - (long long )n2 >= 0LL) && (4294967295LL + (long long )n1) - (long long )n2 >= 0LL) && (4294967294LL - (long long )C) - (long long )N >= 0LL) && (4294967294LL - (long long )C) - (long long )M >= 0LL) && (4294967294LL - (long long )C) - (long long )n1 >= 0LL) && (4294967294LL - (long long )C) - (long long )n2 >= 0LL) && (4294967294LL - (long long )N) - (long long )n1 >= 0LL) && (4294967294LL - (long long )N) - (long long )n2 >= 0LL) && (4294967294LL - (long long )M) - (long long )N >= 0LL) && (4294967294LL - (long long )M) - (long long )n1 >= 0LL) && (4294967294LL - (long long )M) - (long long )n2 >= 0LL) && (4294967294LL - (long long )n1) - (long long )n2 >= 0LL)) && (! multithreaded || 0 <= i)) && (! multithreaded || (0 <= i && 0 <= j))) && (! multithreaded || 0 <= j) [2024-06-14 16:14:13,314 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 16:14:13,314 INFO L106 edCorrectnessWitness]: ghost_update [L144-L144] multithreaded = 1; [2024-06-14 16:14:13,333 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 16:14:13,505 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 16:14:13,519 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-14 16:14:13,731 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 16:14:13,773 INFO L206 MainTranslator]: Completed translation [2024-06-14 16:14:13,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13 WrapperNode [2024-06-14 16:14:13,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 16:14:13,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 16:14:13,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 16:14:13,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 16:14:13,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13" (1/1) ... [2024-06-14 16:14:13,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13" (1/1) ... [2024-06-14 16:14:13,872 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 320 [2024-06-14 16:14:13,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 16:14:13,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 16:14:13,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 16:14:13,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 16:14:13,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13" (1/1) ... [2024-06-14 16:14:13,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13" (1/1) ... [2024-06-14 16:14:13,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13" (1/1) ... [2024-06-14 16:14:13,908 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-14 16:14:13,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13" (1/1) ... [2024-06-14 16:14:13,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13" (1/1) ... [2024-06-14 16:14:13,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13" (1/1) ... [2024-06-14 16:14:13,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13" (1/1) ... [2024-06-14 16:14:13,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13" (1/1) ... [2024-06-14 16:14:13,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13" (1/1) ... [2024-06-14 16:14:13,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 16:14:13,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 16:14:13,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 16:14:13,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 16:14:13,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13" (1/1) ... [2024-06-14 16:14:13,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 16:14:13,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 16:14:13,980 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-14 16:14:13,987 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-14 16:14:14,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 16:14:14,013 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-14 16:14:14,013 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-14 16:14:14,013 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-14 16:14:14,013 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-14 16:14:14,013 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-14 16:14:14,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-14 16:14:14,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-14 16:14:14,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-14 16:14:14,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 16:14:14,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-14 16:14:14,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-14 16:14:14,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-14 16:14:14,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 16:14:14,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 16:14:14,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-14 16:14:14,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 16:14:14,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 16:14:14,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-14 16:14:14,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-14 16:14:14,018 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 16:14:14,136 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 16:14:14,137 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 16:14:14,667 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 16:14:14,668 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 16:14:14,934 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 16:14:14,934 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-14 16:14:14,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 04:14:14 BoogieIcfgContainer [2024-06-14 16:14:14,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 16:14:14,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 16:14:14,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 16:14:14,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 16:14:14,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:14:12" (1/4) ... [2024-06-14 16:14:14,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30226ad0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 04:14:14, skipping insertion in model container [2024-06-14 16:14:14,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 04:14:13" (2/4) ... [2024-06-14 16:14:14,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30226ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 04:14:14, skipping insertion in model container [2024-06-14 16:14:14,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:14:13" (3/4) ... [2024-06-14 16:14:14,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30226ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 04:14:14, skipping insertion in model container [2024-06-14 16:14:14,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 04:14:14" (4/4) ... [2024-06-14 16:14:14,957 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2024-06-14 16:14:14,976 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 16:14:14,976 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-14 16:14:14,976 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 16:14:15,049 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-14 16:14:15,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 58 transitions, 144 flow [2024-06-14 16:14:15,112 INFO L124 PetriNetUnfolderBase]: 6/54 cut-off events. [2024-06-14 16:14:15,113 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-14 16:14:15,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 54 events. 6/54 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-06-14 16:14:15,116 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 58 transitions, 144 flow [2024-06-14 16:14:15,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 52 transitions, 125 flow [2024-06-14 16:14:15,131 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 16:14:15,140 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;@6d1766e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 16:14:15,140 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-14 16:14:15,148 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 16:14:15,148 INFO L124 PetriNetUnfolderBase]: 2/10 cut-off events. [2024-06-14 16:14:15,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 16:14:15,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:14:15,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:14:15,150 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-14 16:14:15,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:14:15,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1610162082, now seen corresponding path program 1 times [2024-06-14 16:14:15,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:14:15,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661145629] [2024-06-14 16:14:15,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:14:15,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:14:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:14:17,533 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-14 16:14:17,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:14:17,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661145629] [2024-06-14 16:14:17,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661145629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:14:17,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:14:17,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 16:14:17,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204932820] [2024-06-14 16:14:17,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:14:17,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 16:14:17,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:14:17,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 16:14:17,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 16:14:17,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-06-14 16:14:17,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 125 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-14 16:14:17,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:14:17,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-06-14 16:14:17,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:14:18,402 INFO L124 PetriNetUnfolderBase]: 3046/4721 cut-off events. [2024-06-14 16:14:18,402 INFO L125 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2024-06-14 16:14:18,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9058 conditions, 4721 events. 3046/4721 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 31103 event pairs, 743 based on Foata normal form. 81/4389 useless extension candidates. Maximal degree in co-relation 8387. Up to 3090 conditions per place. [2024-06-14 16:14:18,432 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 52 selfloop transitions, 4 changer transitions 2/75 dead transitions. [2024-06-14 16:14:18,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 305 flow [2024-06-14 16:14:18,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 16:14:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 16:14:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-06-14 16:14:18,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6293103448275862 [2024-06-14 16:14:18,443 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 125 flow. Second operand 4 states and 146 transitions. [2024-06-14 16:14:18,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 305 flow [2024-06-14 16:14:18,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 75 transitions, 281 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-14 16:14:18,451 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 139 flow [2024-06-14 16:14:18,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2024-06-14 16:14:18,455 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2024-06-14 16:14:18,455 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 139 flow [2024-06-14 16:14:18,456 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-14 16:14:18,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:14:18,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:14:18,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 16:14:18,456 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-14 16:14:18,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:14:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1062420233, now seen corresponding path program 1 times [2024-06-14 16:14:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:14:18,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007614283] [2024-06-14 16:14:18,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:14:18,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:14:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:14:21,162 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-14 16:14:21,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:14:21,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007614283] [2024-06-14 16:14:21,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007614283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:14:21,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:14:21,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 16:14:21,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079108467] [2024-06-14 16:14:21,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:14:21,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 16:14:21,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:14:21,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 16:14:21,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-14 16:14:21,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-06-14 16:14:21,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-14 16:14:21,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:14:21,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-06-14 16:14:21,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:14:22,176 INFO L124 PetriNetUnfolderBase]: 4144/6226 cut-off events. [2024-06-14 16:14:22,176 INFO L125 PetriNetUnfolderBase]: For 562/562 co-relation queries the response was YES. [2024-06-14 16:14:22,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12942 conditions, 6226 events. 4144/6226 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 38921 event pairs, 432 based on Foata normal form. 120/6178 useless extension candidates. Maximal degree in co-relation 3151. Up to 2769 conditions per place. [2024-06-14 16:14:22,225 INFO L140 encePairwiseOnDemand]: 48/58 looper letters, 86 selfloop transitions, 8 changer transitions 5/116 dead transitions. [2024-06-14 16:14:22,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 116 transitions, 486 flow [2024-06-14 16:14:22,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:14:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:14:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 229 transitions. [2024-06-14 16:14:22,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6580459770114943 [2024-06-14 16:14:22,232 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 139 flow. Second operand 6 states and 229 transitions. [2024-06-14 16:14:22,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 116 transitions, 486 flow [2024-06-14 16:14:22,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 116 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 16:14:22,235 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 176 flow [2024-06-14 16:14:22,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2024-06-14 16:14:22,235 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2024-06-14 16:14:22,236 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 176 flow [2024-06-14 16:14:22,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-14 16:14:22,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:14:22,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:14:22,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 16:14:22,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 16:14:22,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:14:22,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1435995059, now seen corresponding path program 1 times [2024-06-14 16:14:22,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:14:22,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687665736] [2024-06-14 16:14:22,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:14:22,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:14:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:14:25,007 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-14 16:14:25,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:14:25,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687665736] [2024-06-14 16:14:25,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687665736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:14:25,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:14:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 16:14:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161351196] [2024-06-14 16:14:25,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:14:25,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 16:14:25,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:14:25,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 16:14:25,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-14 16:14:25,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-06-14 16:14:25,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-14 16:14:25,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:14:25,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-06-14 16:14:25,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:14:25,938 INFO L124 PetriNetUnfolderBase]: 4808/7341 cut-off events. [2024-06-14 16:14:25,938 INFO L125 PetriNetUnfolderBase]: For 3041/3041 co-relation queries the response was YES. [2024-06-14 16:14:25,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16937 conditions, 7341 events. 4808/7341 cut-off events. For 3041/3041 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 47355 event pairs, 985 based on Foata normal form. 117/7252 useless extension candidates. Maximal degree in co-relation 8023. Up to 3243 conditions per place. [2024-06-14 16:14:25,997 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 80 selfloop transitions, 9 changer transitions 13/119 dead transitions. [2024-06-14 16:14:25,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 119 transitions, 552 flow [2024-06-14 16:14:25,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:14:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:14:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2024-06-14 16:14:25,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.646551724137931 [2024-06-14 16:14:25,999 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 176 flow. Second operand 6 states and 225 transitions. [2024-06-14 16:14:26,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 119 transitions, 552 flow [2024-06-14 16:14:26,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 119 transitions, 541 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 16:14:26,007 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 214 flow [2024-06-14 16:14:26,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2024-06-14 16:14:26,008 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2024-06-14 16:14:26,009 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 214 flow [2024-06-14 16:14:26,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-14 16:14:26,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:14:26,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:14:26,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 16:14:26,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 16:14:26,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:14:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1585980722, now seen corresponding path program 1 times [2024-06-14 16:14:26,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:14:26,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994671525] [2024-06-14 16:14:26,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:14:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:14:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:14:26,166 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-14 16:14:26,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:14:26,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994671525] [2024-06-14 16:14:26,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994671525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:14:26,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:14:26,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 16:14:26,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994864097] [2024-06-14 16:14:26,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:14:26,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 16:14:26,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:14:26,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 16:14:26,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 16:14:26,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 58 [2024-06-14 16:14:26,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-14 16:14:26,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:14:26,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 58 [2024-06-14 16:14:26,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:14:27,370 INFO L124 PetriNetUnfolderBase]: 4923/8049 cut-off events. [2024-06-14 16:14:27,370 INFO L125 PetriNetUnfolderBase]: For 5505/5677 co-relation queries the response was YES. [2024-06-14 16:14:27,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20115 conditions, 8049 events. 4923/8049 cut-off events. For 5505/5677 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 59271 event pairs, 3591 based on Foata normal form. 225/7770 useless extension candidates. Maximal degree in co-relation 13820. Up to 5519 conditions per place. [2024-06-14 16:14:27,408 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 39 selfloop transitions, 2 changer transitions 26/87 dead transitions. [2024-06-14 16:14:27,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 436 flow [2024-06-14 16:14:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 16:14:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 16:14:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2024-06-14 16:14:27,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2024-06-14 16:14:27,409 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 214 flow. Second operand 4 states and 156 transitions. [2024-06-14 16:14:27,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 436 flow [2024-06-14 16:14:27,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 16:14:27,420 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 228 flow [2024-06-14 16:14:27,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2024-06-14 16:14:27,421 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 7 predicate places. [2024-06-14 16:14:27,421 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 228 flow [2024-06-14 16:14:27,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-14 16:14:27,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:14:27,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:14:27,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 16:14:27,422 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 16:14:27,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:14:27,423 INFO L85 PathProgramCache]: Analyzing trace with hash -788804509, now seen corresponding path program 1 times [2024-06-14 16:14:27,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:14:27,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382923524] [2024-06-14 16:14:27,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:14:27,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:14:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:14:32,848 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-14 16:14:32,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:14:32,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382923524] [2024-06-14 16:14:32,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382923524] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 16:14:32,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346104234] [2024-06-14 16:14:32,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:14:32,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 16:14:32,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 16:14:32,850 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-14 16:14:32,853 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-14 16:14:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:14:32,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjunts are in the unsatisfiable core [2024-06-14 16:14:32,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 16:14:34,321 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-14 16:14:34,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 16:14:51,121 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-14 16:14:51,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346104234] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 16:14:51,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-14 16:14:51,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 28 [2024-06-14 16:14:51,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013013561] [2024-06-14 16:14:51,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-14 16:14:51,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-06-14 16:14:51,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:14:51,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-06-14 16:14:51,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=612, Unknown=0, NotChecked=0, Total=870 [2024-06-14 16:14:52,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-06-14 16:14:52,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 228 flow. Second operand has 30 states, 30 states have (on average 21.6) internal successors, (648), 30 states have internal predecessors, (648), 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-14 16:14:52,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:14:52,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-06-14 16:14:52,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:14:57,391 INFO L124 PetriNetUnfolderBase]: 11654/17554 cut-off events. [2024-06-14 16:14:57,391 INFO L125 PetriNetUnfolderBase]: For 16685/16779 co-relation queries the response was YES. [2024-06-14 16:14:57,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45519 conditions, 17554 events. 11654/17554 cut-off events. For 16685/16779 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 121403 event pairs, 1870 based on Foata normal form. 378/17624 useless extension candidates. Maximal degree in co-relation 45498. Up to 6238 conditions per place. [2024-06-14 16:14:57,455 INFO L140 encePairwiseOnDemand]: 43/58 looper letters, 0 selfloop transitions, 0 changer transitions 276/276 dead transitions. [2024-06-14 16:14:57,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 276 transitions, 1432 flow [2024-06-14 16:14:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-06-14 16:14:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-06-14 16:14:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 661 transitions. [2024-06-14 16:14:57,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5698275862068966 [2024-06-14 16:14:57,458 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 228 flow. Second operand 20 states and 661 transitions. [2024-06-14 16:14:57,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 276 transitions, 1432 flow [2024-06-14 16:14:57,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 276 transitions, 1382 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-06-14 16:14:57,505 INFO L231 Difference]: Finished difference. Result has 79 places, 0 transitions, 0 flow [2024-06-14 16:14:57,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=0, PETRI_PLACES=79, PETRI_TRANSITIONS=0} [2024-06-14 16:14:57,505 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2024-06-14 16:14:57,505 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 0 transitions, 0 flow [2024-06-14 16:14:57,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 21.6) internal successors, (648), 30 states have internal predecessors, (648), 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-14 16:14:57,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 8 remaining) [2024-06-14 16:14:57,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 8 remaining) [2024-06-14 16:14:57,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-06-14 16:14:57,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 8 remaining) [2024-06-14 16:14:57,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-06-14 16:14:57,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-06-14 16:14:57,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-06-14 16:14:57,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-06-14 16:14:57,537 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-14 16:14:57,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 16:14:57,723 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-06-14 16:14:57,726 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-14 16:14:57,726 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-14 16:14:57,734 INFO L507 ceAbstractionStarter]: Automizer considered 4 witness invariants [2024-06-14 16:14:57,734 INFO L508 ceAbstractionStarter]: WitnessConsidered=4 [2024-06-14 16:14:57,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 04:14:57 BasicIcfg [2024-06-14 16:14:57,735 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-14 16:14:57,735 INFO L158 Benchmark]: Toolchain (without parser) took 44448.83ms. Allocated memory was 172.0MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 143.1MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-06-14 16:14:57,735 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 130.0MB. Free memory was 93.9MB in the beginning and 93.8MB in the end (delta: 86.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 16:14:57,736 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 98.4MB in the beginning and 98.3MB in the end (delta: 104.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 16:14:57,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.63ms. Allocated memory is still 172.0MB. Free memory was 142.4MB in the beginning and 115.9MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-06-14 16:14:57,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.70ms. Allocated memory is still 172.0MB. Free memory was 115.9MB in the beginning and 110.4MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-14 16:14:57,740 INFO L158 Benchmark]: Boogie Preprocessor took 62.44ms. Allocated memory is still 172.0MB. Free memory was 110.4MB in the beginning and 106.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-14 16:14:57,740 INFO L158 Benchmark]: RCFGBuilder took 998.29ms. Allocated memory was 172.0MB in the beginning and 234.9MB in the end (delta: 62.9MB). Free memory was 106.2MB in the beginning and 189.0MB in the end (delta: -82.8MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2024-06-14 16:14:57,740 INFO L158 Benchmark]: TraceAbstraction took 42798.62ms. Allocated memory was 234.9MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 189.0MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-06-14 16:14:57,743 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 130.0MB. Free memory was 93.9MB in the beginning and 93.8MB in the end (delta: 86.4kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 98.4MB in the beginning and 98.3MB in the end (delta: 104.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.63ms. Allocated memory is still 172.0MB. Free memory was 142.4MB in the beginning and 115.9MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.70ms. Allocated memory is still 172.0MB. Free memory was 115.9MB in the beginning and 110.4MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.44ms. Allocated memory is still 172.0MB. Free memory was 110.4MB in the beginning and 106.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 998.29ms. Allocated memory was 172.0MB in the beginning and 234.9MB in the end (delta: 62.9MB). Free memory was 106.2MB in the beginning and 189.0MB in the end (delta: -82.8MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42798.62ms. Allocated memory was 234.9MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 189.0MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 145]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 146]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 147]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 148]: 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, 83 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: 42.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1141 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1052 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3234 IncrementalHoareTripleChecker+Invalid, 3412 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 0 mSDtfsCounter, 3234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=4, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 31.3s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 12772 SizeOfPredicates, 1 NumberOfNonLiveVariables, 183 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 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-14 16:14:57,818 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