./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-inc-subseq.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 59af5db6 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-inc-subseq.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 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-59af5db-m [2024-02-02 09:21:27,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:21:27,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:21:27,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:21:27,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:21:27,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:21:27,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:21:27,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:21:27,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:21:27,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:21:27,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:21:27,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:21:27,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:21:27,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:21:27,124 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:21:27,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:21:27,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:21:27,125 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:21:27,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:21:27,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:21:27,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:21:27,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:21:27,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:21:27,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:21:27,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:21:27,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:21:27,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:21:27,134 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:21:27,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:21:27,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:21:27,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:21:27,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:21:27,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:21:27,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:21:27,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:21:27,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:21:27,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:21:27,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:21:27,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:21:27,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:21:27,138 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:21:27,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:21:27,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:21:27,140 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-02 09:21:27,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:21:27,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:21:27,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:21:27,429 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:21:27,429 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:21:27,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-02-02 09:21:28,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:21:28,867 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:21:28,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-02-02 09:21:28,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/584d8319c/e6c34d28e6bb4692a953100ab5a09a9b/FLAG5065d8316 [2024-02-02 09:21:28,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/584d8319c/e6c34d28e6bb4692a953100ab5a09a9b [2024-02-02 09:21:28,905 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:21:28,906 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:21:28,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-inc-subseq.wvr.yml/witness.yml [2024-02-02 09:21:29,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:21:29,079 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:21:29,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:21:29,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:21:29,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:21:29,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:21:28" (1/2) ... [2024-02-02 09:21:29,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299c9c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:21:29, skipping insertion in model container [2024-02-02 09:21:29,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:21:28" (1/2) ... [2024-02-02 09:21:29,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@29f401d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:21:29, skipping insertion in model container [2024-02-02 09:21:29,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:21:29" (2/2) ... [2024-02-02 09:21:29,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299c9c5c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29, skipping insertion in model container [2024-02-02 09:21:29,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:21:29" (2/2) ... [2024-02-02 09:21:29,091 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:21:29,150 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:21:29,155 INFO L101 nessWitnessExtractor]: Location invariant before [L53-L53] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:21:29,155 INFO L101 nessWitnessExtractor]: Location invariant before [L62-L62] (unsigned long )_argptr == 0UL [2024-02-02 09:21:29,155 INFO L101 nessWitnessExtractor]: Location invariant before [L73-L73] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:21:29,155 INFO L101 nessWitnessExtractor]: Location invariant before [L88-L88] (((((((((((((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL)) && (queue == 0)) && (A == 0)) && (i == 0)) && (N == 0)) && (n == 0)) && (last == 0)) && (start == 0)) && (end == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)0) [2024-02-02 09:21:29,155 INFO L101 nessWitnessExtractor]: Location invariant before [L91-L91] (((((((((((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL)) && (queue == 0)) && (A == 0)) && (i == 0)) && (last == 0)) && (start == 0)) && (end == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,156 INFO L101 nessWitnessExtractor]: Location invariant before [L51-L51] ((0 <= i) && (0 <= end)) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:21:29,156 INFO L101 nessWitnessExtractor]: Location invariant before [L78-L78] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:21:29,157 INFO L101 nessWitnessExtractor]: Location invariant before [L74-L74] ((-2147483647 <= start) && (0 <= i)) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:21:29,157 INFO L101 nessWitnessExtractor]: Location invariant before [L22-L25] (((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,157 INFO L101 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-02-02 09:21:29,157 INFO L101 nessWitnessExtractor]: Loop invariant at [L117-L119] ((((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1)) && ((((((((0LL - (long long )i) + (long long )size >= 0LL && size != 0) && (((((4 <= size && (-8LL + (long long )i) + (long long )size >= 0LL) && i == 4) || ((3 <= size && (-6LL + (long long )i) + (long long )size >= 0LL) && i == 3)) || ((2 <= size && (-4LL + (long long )i) + (long long )size >= 0LL) && i == 2)) || ((1 <= size && (-2LL + (long long )i) + (long long )size >= 0LL) && i == 1))) || (0 == i && i == 0)) || (((((8 <= size && 8 <= i) && (-16LL + (long long )i) + (long long )size >= 0LL) && (0LL - (long long )i) + (long long )size >= 0LL) && size != 0) && i != 1)) || ((((7 <= size && (-14LL + (long long )i) + (long long )size >= 0LL) && (0LL - (long long )i) + (long long )size >= 0LL) && i == 7) && size != 0)) || ((((6 <= size && (-12LL + (long long )i) + (long long )size >= 0LL) && (0LL - (long long )i) + (long long )size >= 0LL) && i == 6) && size != 0)) || ((((5 <= size && (-10LL + (long long )i) + (long long )size >= 0LL) && (0LL - (long long )i) + (long long )size >= 0LL) && i == 5) && size != 0)) [2024-02-02 09:21:29,157 INFO L101 nessWitnessExtractor]: Location invariant before [L54-L54] ((-2147483647 <= end) && (0 <= i)) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:21:29,157 INFO L101 nessWitnessExtractor]: Location invariant before [L79-L79] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:21:29,158 INFO L101 nessWitnessExtractor]: Location invariant before [L98-L98] (((i == 0) && (last == 0)) && (new == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,158 INFO L101 nessWitnessExtractor]: Location invariant before [L92-L92] (((((((queue == 0) && (A == 0)) && (i == 0)) && (last == 0)) && (end == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,158 INFO L101 nessWitnessExtractor]: Location invariant before [L118-L118] (((((((((-1LL - (long long )i) + (long long )size >= 0LL) && (A == 0)) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1)) && (size != 0)) && ((((((((((5 <= size && (-9LL + (long long )i) + (long long )size >= 0LL) && i == 4) || ((4 <= size && (-7LL + (long long )i) + (long long )size >= 0LL) && i == 3)) || ((3 <= size && (-5LL + (long long )i) + (long long )size >= 0LL) && i == 2)) || ((2 <= size && (-3LL + (long long )i) + (long long )size >= 0LL) && i == 1)) || (((1 <= size && (-1LL + (long long )i) + (long long )size >= 0LL) && 0 == i) && i == 0)) || (((((8 <= i && 9 <= size) && i <= 2147483646) && (-17LL + (long long )i) + (long long )size >= 0LL) && i != 0) && i != 1)) || ((8 <= size && (-15LL + (long long )i) + (long long )size >= 0LL) && i == 7)) || ((7 <= size && (-13LL + (long long )i) + (long long )size >= 0LL) && i == 6)) || ((6 <= size && (-11LL + (long long )i) + (long long )size >= 0LL) && i == 5)) [2024-02-02 09:21:29,158 INFO L101 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-02-02 09:21:29,158 INFO L101 nessWitnessExtractor]: Loop invariant at [L69-L80] (unsigned long )_argptr == 0UL [2024-02-02 09:21:29,158 INFO L101 nessWitnessExtractor]: Location invariant before [L94-L94] (((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,159 INFO L101 nessWitnessExtractor]: Location invariant before [L101-L101] ((i == 0) && (new == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,159 INFO L101 nessWitnessExtractor]: Location invariant before [L52-L52] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:21:29,159 INFO L101 nessWitnessExtractor]: Location invariant before [L49-L56] (unsigned long )_argptr == 0UL [2024-02-02 09:21:29,160 INFO L101 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-02-02 09:21:29,160 INFO L101 nessWitnessExtractor]: Location invariant before [L72-L72] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:21:29,160 INFO L101 nessWitnessExtractor]: Location invariant before [L77-L77] (unsigned long )_argptr == 0UL [2024-02-02 09:21:29,160 INFO L101 nessWitnessExtractor]: Location invariant before [L113-L113] (((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,160 INFO L101 nessWitnessExtractor]: Location invariant before [L89-L89] (((((((((((((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL)) && (queue == 0)) && (A == 0)) && (i == 0)) && (N == 0)) && (n == 0)) && (last == 0)) && (start == 0)) && (end == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,160 INFO L101 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-02-02 09:21:29,161 INFO L101 nessWitnessExtractor]: Loop invariant at [L48-L60] (unsigned long )_argptr == 0UL [2024-02-02 09:21:29,161 INFO L101 nessWitnessExtractor]: Location invariant before [L59-L59] (1 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:21:29,161 INFO L101 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-02-02 09:21:29,161 INFO L101 nessWitnessExtractor]: Location invariant before [L97-L97] ((((i == 0) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,161 INFO L101 nessWitnessExtractor]: Location invariant before [L90-L90] ((((((((((((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL)) && (queue == 0)) && (A == 0)) && (i == 0)) && (n == 0)) && (last == 0)) && (start == 0)) && (end == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,161 INFO L101 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-02-02 09:21:29,162 INFO L101 nessWitnessExtractor]: Location invariant before [L71-L71] (((-2147483647 <= end) && (0 <= i)) && (start <= 2147483646)) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:21:29,162 INFO L101 nessWitnessExtractor]: Location invariant before [L93-L93] ((((((queue == 0) && (A == 0)) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,162 INFO L101 nessWitnessExtractor]: Location invariant before [L114-L114] (((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,162 INFO L101 nessWitnessExtractor]: Location invariant before [L68-L68] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:21:29,164 INFO L101 nessWitnessExtractor]: Location invariant before [L58-L58] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:21:29,164 INFO L101 nessWitnessExtractor]: Location invariant before [L82-L82] (unsigned long )_argptr == 0UL [2024-02-02 09:21:29,164 INFO L101 nessWitnessExtractor]: Location invariant before [L116-L116] (((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,164 INFO L101 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-02-02 09:21:29,164 INFO L101 nessWitnessExtractor]: Location invariant before [L120-L120] (((((((0 <= i) && ((long long )i - (long long )size >= 0LL)) && (A == 0)) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,164 INFO L101 nessWitnessExtractor]: Location invariant before [L96-L96] ((((i == 0) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-02 09:21:29,165 INFO L101 nessWitnessExtractor]: Location invariant before [L67-L67] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:21:29,185 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:21:29,421 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-02-02 09:21:29,430 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:21:29,438 INFO L202 MainTranslator]: Completed pre-run [2024-02-02 09:21:29,450 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-02 09:21:29,515 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-02 09:21:29,538 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:21:29,551 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:21:29,552 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29 WrapperNode [2024-02-02 09:21:29,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:21:29,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:21:29,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:21:29,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:21:29,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29" (1/1) ... [2024-02-02 09:21:29,568 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29" (1/1) ... [2024-02-02 09:21:29,611 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 253 [2024-02-02 09:21:29,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:21:29,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:21:29,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:21:29,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:21:29,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29" (1/1) ... [2024-02-02 09:21:29,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29" (1/1) ... [2024-02-02 09:21:29,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29" (1/1) ... [2024-02-02 09:21:29,656 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 2, 2, 8]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 2]. [2024-02-02 09:21:29,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29" (1/1) ... [2024-02-02 09:21:29,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29" (1/1) ... [2024-02-02 09:21:29,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29" (1/1) ... [2024-02-02 09:21:29,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29" (1/1) ... [2024-02-02 09:21:29,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29" (1/1) ... [2024-02-02 09:21:29,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29" (1/1) ... [2024-02-02 09:21:29,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:21:29,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:21:29,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:21:29,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:21:29,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29" (1/1) ... [2024-02-02 09:21:29,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:21:29,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:21:29,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-02 09:21:29,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-02 09:21:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:21:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-02 09:21:29,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-02 09:21:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-02 09:21:29,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-02 09:21:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:21:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:21:29,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:21:29,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 09:21:29,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:21:29,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:21:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:21:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:21:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 09:21:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-02 09:21:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-02 09:21:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-02 09:21:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:21:29,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:21:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:21:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:21:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:21:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-02 09:21:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:21:29,775 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 09:21:29,918 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:21:29,920 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:21:30,535 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:21:30,536 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:21:30,874 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:21:30,874 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-02 09:21:30,876 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:21:30 BoogieIcfgContainer [2024-02-02 09:21:30,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:21:30,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:21:30,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:21:30,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:21:30,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:21:28" (1/4) ... [2024-02-02 09:21:30,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e303c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:21:30, skipping insertion in model container [2024-02-02 09:21:30,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:21:29" (2/4) ... [2024-02-02 09:21:30,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e303c29 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:21:30, skipping insertion in model container [2024-02-02 09:21:30,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:21:29" (3/4) ... [2024-02-02 09:21:30,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e303c29 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:21:30, skipping insertion in model container [2024-02-02 09:21:30,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:21:30" (4/4) ... [2024-02-02 09:21:30,887 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-02-02 09:21:30,907 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:21:30,907 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2024-02-02 09:21:30,907 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:21:31,007 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-02 09:21:31,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 124 transitions, 262 flow [2024-02-02 09:21:31,106 INFO L124 PetriNetUnfolderBase]: 5/122 cut-off events. [2024-02-02 09:21:31,107 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:21:31,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 122 events. 5/122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 267 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2024-02-02 09:21:31,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 124 transitions, 262 flow [2024-02-02 09:21:31,116 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 121 transitions, 254 flow [2024-02-02 09:21:31,132 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:21:31,142 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;@50382b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:21:31,142 INFO L358 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2024-02-02 09:21:31,145 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:21:31,145 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:21:31,145 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:21:31,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:21:31,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:21:31,147 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-02-02 09:21:31,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:21:31,156 INFO L85 PathProgramCache]: Analyzing trace with hash 22825, now seen corresponding path program 1 times [2024-02-02 09:21:31,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:21:31,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357139708] [2024-02-02 09:21:31,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:21:31,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:21:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:21:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:21:31,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:21:31,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357139708] [2024-02-02 09:21:31,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357139708] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:21:31,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:21:31,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:21:31,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106745998] [2024-02-02 09:21:31,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:21:31,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:21:31,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:21:31,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:21:31,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:21:31,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 124 [2024-02-02 09:21:31,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 121 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:31,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:21:31,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 124 [2024-02-02 09:21:31,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:21:32,173 INFO L124 PetriNetUnfolderBase]: 499/1152 cut-off events. [2024-02-02 09:21:32,174 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-02-02 09:21:32,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2001 conditions, 1152 events. 499/1152 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7098 event pairs, 360 based on Foata normal form. 0/791 useless extension candidates. Maximal degree in co-relation 1782. Up to 809 conditions per place. [2024-02-02 09:21:32,190 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 55 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-02-02 09:21:32,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 111 transitions, 348 flow [2024-02-02 09:21:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:21:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:21:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2024-02-02 09:21:32,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6317204301075269 [2024-02-02 09:21:32,207 INFO L175 Difference]: Start difference. First operand has 123 places, 121 transitions, 254 flow. Second operand 3 states and 235 transitions. [2024-02-02 09:21:32,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 111 transitions, 348 flow [2024-02-02 09:21:32,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 111 transitions, 340 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 09:21:32,218 INFO L231 Difference]: Finished difference. Result has 111 places, 111 transitions, 230 flow [2024-02-02 09:21:32,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=111, PETRI_TRANSITIONS=111} [2024-02-02 09:21:32,229 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -12 predicate places. [2024-02-02 09:21:32,230 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 111 transitions, 230 flow [2024-02-02 09:21:32,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:32,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:21:32,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-02 09:21:32,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:21:32,231 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-02-02 09:21:32,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:21:32,232 INFO L85 PathProgramCache]: Analyzing trace with hash 708321, now seen corresponding path program 1 times [2024-02-02 09:21:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:21:32,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125505386] [2024-02-02 09:21:32,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:21:32,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:21:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:21:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:21:32,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:21:32,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125505386] [2024-02-02 09:21:32,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125505386] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:21:32,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:21:32,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:21:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924392966] [2024-02-02 09:21:32,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:21:32,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:21:32,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:21:32,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:21:32,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:21:32,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 124 [2024-02-02 09:21:32,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 111 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:32,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:21:32,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 124 [2024-02-02 09:21:32,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:21:32,774 INFO L124 PetriNetUnfolderBase]: 499/1151 cut-off events. [2024-02-02 09:21:32,774 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-02-02 09:21:32,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1988 conditions, 1151 events. 499/1151 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7101 event pairs, 360 based on Foata normal form. 0/771 useless extension candidates. Maximal degree in co-relation 1979. Up to 819 conditions per place. [2024-02-02 09:21:32,782 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 65 selfloop transitions, 3 changer transitions 0/110 dead transitions. [2024-02-02 09:21:32,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 110 transitions, 364 flow [2024-02-02 09:21:32,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:21:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:21:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2024-02-02 09:21:32,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020161290322581 [2024-02-02 09:21:32,785 INFO L175 Difference]: Start difference. First operand has 111 places, 111 transitions, 230 flow. Second operand 4 states and 249 transitions. [2024-02-02 09:21:32,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 110 transitions, 364 flow [2024-02-02 09:21:32,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 110 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:21:32,789 INFO L231 Difference]: Finished difference. Result has 111 places, 110 transitions, 230 flow [2024-02-02 09:21:32,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=111, PETRI_TRANSITIONS=110} [2024-02-02 09:21:32,790 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -12 predicate places. [2024-02-02 09:21:32,790 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 110 transitions, 230 flow [2024-02-02 09:21:32,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:32,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:21:32,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-02 09:21:32,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:21:32,791 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-02-02 09:21:32,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:21:32,791 INFO L85 PathProgramCache]: Analyzing trace with hash 21958758, now seen corresponding path program 1 times [2024-02-02 09:21:32,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:21:32,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905058575] [2024-02-02 09:21:32,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:21:32,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:21:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:21:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:21:32,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:21:32,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905058575] [2024-02-02 09:21:32,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905058575] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:21:32,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:21:32,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:21:32,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521036126] [2024-02-02 09:21:32,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:21:32,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:21:32,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:21:32,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:21:32,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:21:33,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-02-02 09:21:33,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:33,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:21:33,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-02-02 09:21:33,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:21:33,290 INFO L124 PetriNetUnfolderBase]: 460/1098 cut-off events. [2024-02-02 09:21:33,290 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-02-02 09:21:33,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1875 conditions, 1098 events. 460/1098 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6864 event pairs, 327 based on Foata normal form. 0/772 useless extension candidates. Maximal degree in co-relation 1863. Up to 758 conditions per place. [2024-02-02 09:21:33,297 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 67 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-02-02 09:21:33,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 109 transitions, 368 flow [2024-02-02 09:21:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:21:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:21:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2024-02-02 09:21:33,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4899193548387097 [2024-02-02 09:21:33,299 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 230 flow. Second operand 4 states and 243 transitions. [2024-02-02 09:21:33,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 109 transitions, 368 flow [2024-02-02 09:21:33,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 109 transitions, 362 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-02 09:21:33,302 INFO L231 Difference]: Finished difference. Result has 110 places, 109 transitions, 228 flow [2024-02-02 09:21:33,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=110, PETRI_TRANSITIONS=109} [2024-02-02 09:21:33,303 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -13 predicate places. [2024-02-02 09:21:33,303 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 109 transitions, 228 flow [2024-02-02 09:21:33,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:33,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:21:33,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-02 09:21:33,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:21:33,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-02-02 09:21:33,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:21:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash 680722200, now seen corresponding path program 1 times [2024-02-02 09:21:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:21:33,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86874135] [2024-02-02 09:21:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:21:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:21:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:21:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:21:33,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:21:33,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86874135] [2024-02-02 09:21:33,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86874135] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:21:33,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:21:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:21:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305832628] [2024-02-02 09:21:33,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:21:33,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:21:33,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:21:33,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:21:33,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:21:33,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 124 [2024-02-02 09:21:33,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 109 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:33,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:21:33,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 124 [2024-02-02 09:21:33,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:21:33,782 INFO L124 PetriNetUnfolderBase]: 460/1097 cut-off events. [2024-02-02 09:21:33,783 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-02-02 09:21:33,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 1097 events. 460/1097 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6850 event pairs, 327 based on Foata normal form. 0/772 useless extension candidates. Maximal degree in co-relation 1859. Up to 756 conditions per place. [2024-02-02 09:21:33,792 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 66 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2024-02-02 09:21:33,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 108 transitions, 364 flow [2024-02-02 09:21:33,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:21:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:21:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2024-02-02 09:21:33,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959677419354839 [2024-02-02 09:21:33,796 INFO L175 Difference]: Start difference. First operand has 110 places, 109 transitions, 228 flow. Second operand 4 states and 246 transitions. [2024-02-02 09:21:33,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 108 transitions, 364 flow [2024-02-02 09:21:33,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 108 transitions, 358 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-02 09:21:33,799 INFO L231 Difference]: Finished difference. Result has 109 places, 108 transitions, 226 flow [2024-02-02 09:21:33,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=109, PETRI_TRANSITIONS=108} [2024-02-02 09:21:33,801 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -14 predicate places. [2024-02-02 09:21:33,801 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 108 transitions, 226 flow [2024-02-02 09:21:33,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:33,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:21:33,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-02 09:21:33,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:21:33,802 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-02-02 09:21:33,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:21:33,803 INFO L85 PathProgramCache]: Analyzing trace with hash -372447499, now seen corresponding path program 1 times [2024-02-02 09:21:33,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:21:33,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669507664] [2024-02-02 09:21:33,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:21:33,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:21:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:21:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:21:33,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:21:33,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669507664] [2024-02-02 09:21:33,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669507664] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:21:33,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:21:33,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:21:33,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718357678] [2024-02-02 09:21:33,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:21:33,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:21:33,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:21:33,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:21:33,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:21:33,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 124 [2024-02-02 09:21:33,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 108 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:33,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:21:33,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 124 [2024-02-02 09:21:33,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:21:34,150 INFO L124 PetriNetUnfolderBase]: 460/1096 cut-off events. [2024-02-02 09:21:34,151 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-02-02 09:21:34,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1871 conditions, 1096 events. 460/1096 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6878 event pairs, 327 based on Foata normal form. 0/772 useless extension candidates. Maximal degree in co-relation 1855. Up to 754 conditions per place. [2024-02-02 09:21:34,157 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 65 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2024-02-02 09:21:34,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 107 transitions, 360 flow [2024-02-02 09:21:34,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:21:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:21:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2024-02-02 09:21:34,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020161290322581 [2024-02-02 09:21:34,159 INFO L175 Difference]: Start difference. First operand has 109 places, 108 transitions, 226 flow. Second operand 4 states and 249 transitions. [2024-02-02 09:21:34,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 107 transitions, 360 flow [2024-02-02 09:21:34,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 107 transitions, 354 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-02 09:21:34,163 INFO L231 Difference]: Finished difference. Result has 108 places, 107 transitions, 224 flow [2024-02-02 09:21:34,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=108, PETRI_TRANSITIONS=107} [2024-02-02 09:21:34,186 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -15 predicate places. [2024-02-02 09:21:34,186 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 107 transitions, 224 flow [2024-02-02 09:21:34,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:34,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:21:34,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:21:34,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:21:34,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-02-02 09:21:34,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:21:34,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1339030133, now seen corresponding path program 1 times [2024-02-02 09:21:34,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:21:34,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147385614] [2024-02-02 09:21:34,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:21:34,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:21:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:21:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:21:34,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:21:34,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147385614] [2024-02-02 09:21:34,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147385614] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:21:34,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:21:34,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:21:34,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251625702] [2024-02-02 09:21:34,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:21:34,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:21:34,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:21:34,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:21:34,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:21:34,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 124 [2024-02-02 09:21:34,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 107 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:34,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:21:34,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 124 [2024-02-02 09:21:34,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:21:34,597 INFO L124 PetriNetUnfolderBase]: 460/1092 cut-off events. [2024-02-02 09:21:34,597 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-02-02 09:21:34,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1863 conditions, 1092 events. 460/1092 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6889 event pairs, 327 based on Foata normal form. 0/772 useless extension candidates. Maximal degree in co-relation 1845. Up to 741 conditions per place. [2024-02-02 09:21:34,604 INFO L140 encePairwiseOnDemand]: 117/124 looper letters, 61 selfloop transitions, 3 changer transitions 0/103 dead transitions. [2024-02-02 09:21:34,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 103 transitions, 344 flow [2024-02-02 09:21:34,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:21:34,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:21:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2024-02-02 09:21:34,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080645161290323 [2024-02-02 09:21:34,606 INFO L175 Difference]: Start difference. First operand has 108 places, 107 transitions, 224 flow. Second operand 4 states and 252 transitions. [2024-02-02 09:21:34,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 103 transitions, 344 flow [2024-02-02 09:21:34,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 103 transitions, 338 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-02 09:21:34,608 INFO L231 Difference]: Finished difference. Result has 104 places, 103 transitions, 216 flow [2024-02-02 09:21:34,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=104, PETRI_TRANSITIONS=103} [2024-02-02 09:21:34,611 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -19 predicate places. [2024-02-02 09:21:34,611 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 103 transitions, 216 flow [2024-02-02 09:21:34,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:34,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:21:34,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:21:34,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:21:34,612 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-02-02 09:21:34,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:21:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1692103552, now seen corresponding path program 1 times [2024-02-02 09:21:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:21:34,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347530188] [2024-02-02 09:21:34,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:21:34,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:21:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:21:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:21:34,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:21:34,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347530188] [2024-02-02 09:21:34,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347530188] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:21:34,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:21:34,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:21:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893608024] [2024-02-02 09:21:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:21:34,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:21:34,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:21:34,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:21:34,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:21:34,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 124 [2024-02-02 09:21:34,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 103 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:34,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:21:34,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 124 [2024-02-02 09:21:34,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:21:35,055 INFO L124 PetriNetUnfolderBase]: 460/1090 cut-off events. [2024-02-02 09:21:35,056 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-02-02 09:21:35,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1855 conditions, 1090 events. 460/1090 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6855 event pairs, 327 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 1814. Up to 724 conditions per place. [2024-02-02 09:21:35,061 INFO L140 encePairwiseOnDemand]: 111/124 looper letters, 47 selfloop transitions, 11 changer transitions 0/101 dead transitions. [2024-02-02 09:21:35,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 101 transitions, 328 flow [2024-02-02 09:21:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:21:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:21:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 330 transitions. [2024-02-02 09:21:35,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-02-02 09:21:35,063 INFO L175 Difference]: Start difference. First operand has 104 places, 103 transitions, 216 flow. Second operand 5 states and 330 transitions. [2024-02-02 09:21:35,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 101 transitions, 328 flow [2024-02-02 09:21:35,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 101 transitions, 322 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-02 09:21:35,066 INFO L231 Difference]: Finished difference. Result has 103 places, 101 transitions, 228 flow [2024-02-02 09:21:35,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=103, PETRI_TRANSITIONS=101} [2024-02-02 09:21:35,066 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -20 predicate places. [2024-02-02 09:21:35,067 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 101 transitions, 228 flow [2024-02-02 09:21:35,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.2) internal successors, (281), 5 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:35,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:21:35,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:21:35,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:21:35,068 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-02-02 09:21:35,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:21:35,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1681114833, now seen corresponding path program 1 times [2024-02-02 09:21:35,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:21:35,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872397439] [2024-02-02 09:21:35,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:21:35,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:21:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:21:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:21:35,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:21:35,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872397439] [2024-02-02 09:21:35,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872397439] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:21:35,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:21:35,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 09:21:35,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556617458] [2024-02-02 09:21:35,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:21:35,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 09:21:35,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:21:35,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 09:21:35,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-02 09:21:35,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 124 [2024-02-02 09:21:35,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 101 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 52.166666666666664) internal successors, (313), 6 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:35,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:21:35,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 124 [2024-02-02 09:21:35,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:21:35,575 INFO L124 PetriNetUnfolderBase]: 460/1088 cut-off events. [2024-02-02 09:21:35,576 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-02-02 09:21:35,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1863 conditions, 1088 events. 460/1088 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6852 event pairs, 327 based on Foata normal form. 2/778 useless extension candidates. Maximal degree in co-relation 1787. Up to 724 conditions per place. [2024-02-02 09:21:35,582 INFO L140 encePairwiseOnDemand]: 109/124 looper letters, 47 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2024-02-02 09:21:35,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 344 flow [2024-02-02 09:21:35,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 09:21:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 09:21:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 362 transitions. [2024-02-02 09:21:35,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48655913978494625 [2024-02-02 09:21:35,584 INFO L175 Difference]: Start difference. First operand has 103 places, 101 transitions, 228 flow. Second operand 6 states and 362 transitions. [2024-02-02 09:21:35,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 344 flow [2024-02-02 09:21:35,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 99 transitions, 322 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 09:21:35,586 INFO L231 Difference]: Finished difference. Result has 102 places, 99 transitions, 228 flow [2024-02-02 09:21:35,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=102, PETRI_TRANSITIONS=99} [2024-02-02 09:21:35,589 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -21 predicate places. [2024-02-02 09:21:35,589 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 99 transitions, 228 flow [2024-02-02 09:21:35,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.166666666666664) internal successors, (313), 6 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:35,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:21:35,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:21:35,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 09:21:35,590 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-02-02 09:21:35,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:21:35,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1681114821, now seen corresponding path program 1 times [2024-02-02 09:21:35,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:21:35,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866325036] [2024-02-02 09:21:35,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:21:35,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:21:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:21:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:21:35,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:21:35,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866325036] [2024-02-02 09:21:35,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866325036] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:21:35,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:21:35,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 09:21:35,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138823894] [2024-02-02 09:21:35,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:21:35,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 09:21:35,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:21:35,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 09:21:35,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-02-02 09:21:35,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 124 [2024-02-02 09:21:35,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 99 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:35,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:21:35,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 124 [2024-02-02 09:21:35,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:21:36,091 INFO L124 PetriNetUnfolderBase]: 460/1082 cut-off events. [2024-02-02 09:21:36,091 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-02-02 09:21:36,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 1082 events. 460/1082 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6816 event pairs, 327 based on Foata normal form. 2/768 useless extension candidates. Maximal degree in co-relation 1791. Up to 728 conditions per place. [2024-02-02 09:21:36,098 INFO L140 encePairwiseOnDemand]: 106/124 looper letters, 50 selfloop transitions, 12 changer transitions 0/93 dead transitions. [2024-02-02 09:21:36,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 93 transitions, 340 flow [2024-02-02 09:21:36,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 09:21:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 09:21:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 302 transitions. [2024-02-02 09:21:36,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40591397849462363 [2024-02-02 09:21:36,100 INFO L175 Difference]: Start difference. First operand has 102 places, 99 transitions, 228 flow. Second operand 6 states and 302 transitions. [2024-02-02 09:21:36,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 93 transitions, 340 flow [2024-02-02 09:21:36,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 93 transitions, 314 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-02-02 09:21:36,102 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 214 flow [2024-02-02 09:21:36,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2024-02-02 09:21:36,103 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -27 predicate places. [2024-02-02 09:21:36,103 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 214 flow [2024-02-02 09:21:36,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:21:36,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:21:36,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:21:36,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-02 09:21:36,104 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-02-02 09:21:36,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:21:36,105 INFO L85 PathProgramCache]: Analyzing trace with hash 574952980, now seen corresponding path program 1 times [2024-02-02 09:21:36,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:21:36,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906128975] [2024-02-02 09:21:36,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:21:36,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:21:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:21:36,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:21:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:21:36,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:21:36,154 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:21:36,155 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 86 remaining) [2024-02-02 09:21:36,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 86 remaining) [2024-02-02 09:21:36,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 86 remaining) [2024-02-02 09:21:36,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 86 remaining) [2024-02-02 09:21:36,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 86 remaining) [2024-02-02 09:21:36,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 86 remaining) [2024-02-02 09:21:36,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 86 remaining) [2024-02-02 09:21:36,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 86 remaining) [2024-02-02 09:21:36,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 86 remaining) [2024-02-02 09:21:36,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 86 remaining) [2024-02-02 09:21:36,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 86 remaining) [2024-02-02 09:21:36,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 86 remaining) [2024-02-02 09:21:36,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 86 remaining) [2024-02-02 09:21:36,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 86 remaining) [2024-02-02 09:21:36,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 86 remaining) [2024-02-02 09:21:36,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 86 remaining) [2024-02-02 09:21:36,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 86 remaining) [2024-02-02 09:21:36,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 86 remaining) [2024-02-02 09:21:36,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 86 remaining) [2024-02-02 09:21:36,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 86 remaining) [2024-02-02 09:21:36,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 86 remaining) [2024-02-02 09:21:36,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 86 remaining) [2024-02-02 09:21:36,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 86 remaining) [2024-02-02 09:21:36,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 86 remaining) [2024-02-02 09:21:36,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 86 remaining) [2024-02-02 09:21:36,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 86 remaining) [2024-02-02 09:21:36,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 86 remaining) [2024-02-02 09:21:36,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 86 remaining) [2024-02-02 09:21:36,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 86 remaining) [2024-02-02 09:21:36,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 86 remaining) [2024-02-02 09:21:36,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 86 remaining) [2024-02-02 09:21:36,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 86 remaining) [2024-02-02 09:21:36,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 86 remaining) [2024-02-02 09:21:36,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 86 remaining) [2024-02-02 09:21:36,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 86 remaining) [2024-02-02 09:21:36,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 86 remaining) [2024-02-02 09:21:36,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 86 remaining) [2024-02-02 09:21:36,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 86 remaining) [2024-02-02 09:21:36,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 86 remaining) [2024-02-02 09:21:36,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 86 remaining) [2024-02-02 09:21:36,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 86 remaining) [2024-02-02 09:21:36,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 86 remaining) [2024-02-02 09:21:36,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 86 remaining) [2024-02-02 09:21:36,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 86 remaining) [2024-02-02 09:21:36,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 86 remaining) [2024-02-02 09:21:36,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 86 remaining) [2024-02-02 09:21:36,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 86 remaining) [2024-02-02 09:21:36,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 86 remaining) [2024-02-02 09:21:36,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 86 remaining) [2024-02-02 09:21:36,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 86 remaining) [2024-02-02 09:21:36,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 86 remaining) [2024-02-02 09:21:36,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 86 remaining) [2024-02-02 09:21:36,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 86 remaining) [2024-02-02 09:21:36,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 86 remaining) [2024-02-02 09:21:36,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (31 of 86 remaining) [2024-02-02 09:21:36,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 86 remaining) [2024-02-02 09:21:36,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 86 remaining) [2024-02-02 09:21:36,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 86 remaining) [2024-02-02 09:21:36,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 86 remaining) [2024-02-02 09:21:36,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 86 remaining) [2024-02-02 09:21:36,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 86 remaining) [2024-02-02 09:21:36,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 86 remaining) [2024-02-02 09:21:36,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 86 remaining) [2024-02-02 09:21:36,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 86 remaining) [2024-02-02 09:21:36,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 86 remaining) [2024-02-02 09:21:36,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 86 remaining) [2024-02-02 09:21:36,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 86 remaining) [2024-02-02 09:21:36,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 86 remaining) [2024-02-02 09:21:36,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 86 remaining) [2024-02-02 09:21:36,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 86 remaining) [2024-02-02 09:21:36,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 86 remaining) [2024-02-02 09:21:36,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 86 remaining) [2024-02-02 09:21:36,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 86 remaining) [2024-02-02 09:21:36,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 86 remaining) [2024-02-02 09:21:36,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 86 remaining) [2024-02-02 09:21:36,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 86 remaining) [2024-02-02 09:21:36,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 86 remaining) [2024-02-02 09:21:36,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 86 remaining) [2024-02-02 09:21:36,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 86 remaining) [2024-02-02 09:21:36,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 86 remaining) [2024-02-02 09:21:36,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 86 remaining) [2024-02-02 09:21:36,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 86 remaining) [2024-02-02 09:21:36,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 86 remaining) [2024-02-02 09:21:36,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 86 remaining) [2024-02-02 09:21:36,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 86 remaining) [2024-02-02 09:21:36,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 86 remaining) [2024-02-02 09:21:36,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-02 09:21:36,171 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:21:36,178 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:21:36,178 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:21:36,205 INFO L503 ceAbstractionStarter]: Automizer considered 54 witness invariants [2024-02-02 09:21:36,205 INFO L504 ceAbstractionStarter]: WitnessConsidered=54 [2024-02-02 09:21:36,206 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:21:36 BasicIcfg [2024-02-02 09:21:36,206 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:21:36,207 INFO L158 Benchmark]: Toolchain (without parser) took 7128.13ms. Allocated memory was 176.2MB in the beginning and 310.4MB in the end (delta: 134.2MB). Free memory was 97.4MB in the beginning and 148.4MB in the end (delta: -50.9MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2024-02-02 09:21:36,207 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:21:36,207 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:21:36,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.21ms. Allocated memory is still 176.2MB. Free memory was 97.3MB in the beginning and 135.0MB in the end (delta: -37.7MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-02-02 09:21:36,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.16ms. Allocated memory is still 176.2MB. Free memory was 135.0MB in the beginning and 130.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-02 09:21:36,208 INFO L158 Benchmark]: Boogie Preprocessor took 75.32ms. Allocated memory is still 176.2MB. Free memory was 130.8MB in the beginning and 127.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:21:36,208 INFO L158 Benchmark]: RCFGBuilder took 1188.57ms. Allocated memory is still 176.2MB. Free memory was 127.4MB in the beginning and 104.3MB in the end (delta: 23.1MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2024-02-02 09:21:36,209 INFO L158 Benchmark]: TraceAbstraction took 5327.42ms. Allocated memory was 176.2MB in the beginning and 310.4MB in the end (delta: 134.2MB). Free memory was 103.3MB in the beginning and 148.4MB in the end (delta: -45.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2024-02-02 09:21:36,210 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.21ms. Allocated memory is still 176.2MB. Free memory was 97.3MB in the beginning and 135.0MB in the end (delta: -37.7MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.16ms. Allocated memory is still 176.2MB. Free memory was 135.0MB in the beginning and 130.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.32ms. Allocated memory is still 176.2MB. Free memory was 130.8MB in the beginning and 127.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1188.57ms. Allocated memory is still 176.2MB. Free memory was 127.4MB in the beginning and 104.3MB in the end (delta: 23.1MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5327.42ms. Allocated memory was 176.2MB in the beginning and 310.4MB in the end (delta: 134.2MB). Free memory was 103.3MB in the beginning and 148.4MB in the end (delta: -45.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 117]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L41] int *queue, *A; [L42] int i, N, n, last, start, end, new, v_old; [L43] _Bool ok; [L86] pthread_t t1, t2; VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={3:0}, t2={5:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] [L88] ok = 1 VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={3:0}, t2={5:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L89] N = __VERIFIER_nondet_int() [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L90] n = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L91] start = __VERIFIER_nondet_int() [L92] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L92] end = start VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=1, ok=1, queue={0:0}, start=0, t1={3:0}, t2={5:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L93] CALL create_fresh_int_array(n) [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L113] CALL assume_abort_if_not(size >= 0) [L38] COND FALSE !(!cond) [L113] RET assume_abort_if_not(size >= 0) [L114] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L114] CALL assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE !(!cond) [L114] RET assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L116] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L116] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L117] int i = 0; VAL [A={0:0}, N=0, \old(size)=1, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=1, ok=1, queue={0:0}, size=1, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[8LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[6LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[4LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[2LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[16LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[14LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[12LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[10LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]]]]] VAL [A={0:0}, N=0, \old(size)=1, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=1, ok=1, queue={0:0}, size=1, start=0, v_old=0] [L117] COND TRUE i < size VAL [A={0:0}, N=0, \old(size)=1, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=1, ok=1, queue={0:0}, size=1, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[9LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[7LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[5LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[3LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IntegerLiteral[9],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2147483646]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[17LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[15LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[13LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[11LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]]]]] [L118] arr[i] = __VERIFIER_nondet_int() [L117] i++ VAL [A={0:0}, N=0, \old(size)=1, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=1, ok=1, queue={0:0}, size=1, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[8LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[6LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[4LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[2LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[16LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[14LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[12LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[10LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]]]]] VAL [A={0:0}, N=0, \old(size)=1, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=1, ok=1, queue={0:0}, size=1, start=0, v_old=0] - UnprovableResult [Line: 48]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 102]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 178 locations, 86 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: 5.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 967 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2110 IncrementalHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 13 mSDtfsCounter, 2110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=0, 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.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 1579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-02 09:21:36,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE