./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-dec-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-dec-subseq.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3d25acf6 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-dec-subseq.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-dec-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-3d25acf-m [2024-01-30 14:25:13,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:25:13,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:25:13,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:25:13,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:25:13,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:25:13,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:25:13,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:25:13,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:25:13,580 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:25:13,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:25:13,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:25:13,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:25:13,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:25:13,582 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:25:13,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:25:13,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:25:13,583 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:25:13,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:25:13,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:25:13,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:25:13,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:25:13,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:25:13,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:25:13,584 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:25:13,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:25:13,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:25:13,585 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:25:13,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:25:13,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:25:13,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:25:13,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:25:13,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:25:13,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:25:13,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:25:13,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:25:13,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:25:13,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:25:13,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:25:13,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:25:13,588 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:25:13,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:25:13,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:25:13,589 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-01-30 14:25:13,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:25:13,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:25:13,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:25:13,816 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:25:13,816 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:25:13,818 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-dec-subseq.wvr.yml/witness.yml [2024-01-30 14:25:13,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:25:13,970 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:25:13,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-01-30 14:25:15,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:25:15,266 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:25:15,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-01-30 14:25:15,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d22eb3a9/1ea65ba4825641bd9ed81d78095e9d32/FLAG972df690a [2024-01-30 14:25:15,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d22eb3a9/1ea65ba4825641bd9ed81d78095e9d32 [2024-01-30 14:25:15,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:25:15,321 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:25:15,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:25:15,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:25:15,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:25:15,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:25:13" (1/2) ... [2024-01-30 14:25:15,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1732510c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:25:15, skipping insertion in model container [2024-01-30 14:25:15,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:25:13" (1/2) ... [2024-01-30 14:25:15,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2f997d97 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:25:15, skipping insertion in model container [2024-01-30 14:25:15,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:25:15" (2/2) ... [2024-01-30 14:25:15,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1732510c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15, skipping insertion in model container [2024-01-30 14:25:15,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:25:15" (2/2) ... [2024-01-30 14:25:15,336 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:25:15,399 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:25:15,400 INFO L98 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-01-30 14:25:15,400 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] (((i == 0) && (last == 0)) && (new == 0)) && (ok == (_Bool)1) [2024-01-30 14:25:15,400 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] (((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-01-30 14:25:15,400 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:25:15,400 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] ((i == 0) && (new == 0)) && (ok == (_Bool)1) [2024-01-30 14:25:15,401 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] (((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-01-30 14:25:15,401 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-30 14:25:15,401 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] ((-2147483647 <= end) && (0 <= i)) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:25:15,401 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:25:15,401 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-30 14:25:15,401 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:25:15,401 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] ((((((queue == 0) && (A == 0)) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-01-30 14:25:15,401 INFO L98 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-01-30 14:25:15,402 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-01-30 14:25:15,402 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-30 14:25:15,402 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] ((-2147483647 <= start) && (0 <= i)) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:25:15,402 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] ((((i == 0) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-01-30 14:25:15,402 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:25:15,402 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:25:15,403 INFO L98 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-01-30 14:25:15,403 INFO L98 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-01-30 14:25:15,403 INFO L98 nessWitnessExtractor]: Loop invariant at [L69-L80] (unsigned long )_argptr == 0UL [2024-01-30 14:25:15,403 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (unsigned long )_argptr == 0UL [2024-01-30 14:25:15,403 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-30 14:25:15,404 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (unsigned long )_argptr == 0UL [2024-01-30 14:25:15,404 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-30 14:25:15,404 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L56] (unsigned long )_argptr == 0UL [2024-01-30 14:25:15,404 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] (((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-01-30 14:25:15,404 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-30 14:25:15,404 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-30 14:25:15,404 INFO L98 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-01-30 14:25:15,405 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:25:15,405 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] ((((i == 0) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-01-30 14:25:15,405 INFO L98 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-01-30 14:25:15,405 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (unsigned long )_argptr == 0UL [2024-01-30 14:25:15,405 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-01-30 14:25:15,406 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (1 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:25:15,406 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:25:15,407 INFO L98 nessWitnessExtractor]: Loop invariant at [L48-L60] (unsigned long )_argptr == 0UL [2024-01-30 14:25:15,407 INFO L98 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-01-30 14:25:15,407 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (((-2147483647 <= end) && (0 <= i)) && (start <= 2147483646)) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:25:15,407 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:25:15,408 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] ((0 <= i) && (0 <= end)) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:25:15,408 INFO L98 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-01-30 14:25:15,408 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:25:15,427 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:25:15,601 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-dec-subseq.wvr.c[2950,2963] [2024-01-30 14:25:15,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:25:15,623 INFO L202 MainTranslator]: Completed pre-run [2024-01-30 14:25:15,633 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-01-30 14:25:15,705 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-dec-subseq.wvr.c[2950,2963] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-30 14:25:15,728 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:25:15,740 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:25:15,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15 WrapperNode [2024-01-30 14:25:15,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:25:15,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:25:15,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:25:15,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:25:15,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15" (1/1) ... [2024-01-30 14:25:15,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15" (1/1) ... [2024-01-30 14:25:15,803 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 253 [2024-01-30 14:25:15,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:25:15,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:25:15,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:25:15,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:25:15,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15" (1/1) ... [2024-01-30 14:25:15,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15" (1/1) ... [2024-01-30 14:25:15,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15" (1/1) ... [2024-01-30 14:25:15,840 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 8, 2, 2]. 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, 2, 1, 1]. [2024-01-30 14:25:15,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15" (1/1) ... [2024-01-30 14:25:15,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15" (1/1) ... [2024-01-30 14:25:15,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15" (1/1) ... [2024-01-30 14:25:15,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15" (1/1) ... [2024-01-30 14:25:15,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15" (1/1) ... [2024-01-30 14:25:15,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15" (1/1) ... [2024-01-30 14:25:15,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:25:15,903 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:25:15,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:25:15,904 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:25:15,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15" (1/1) ... [2024-01-30 14:25:15,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:25:15,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:25:15,927 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-01-30 14:25:15,947 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-01-30 14:25:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:25:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-30 14:25:15,963 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-30 14:25:15,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-30 14:25:15,964 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-30 14:25:15,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:25:15,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:25:15,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:25:15,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-30 14:25:15,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:25:15,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:25:15,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:25:15,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:25:15,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-30 14:25:15,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-30 14:25:15,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-30 14:25:15,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-30 14:25:15,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:25:15,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:25:15,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:25:15,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:25:15,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:25:15,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-30 14:25:15,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:25:15,969 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-30 14:25:16,056 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:25:16,057 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:25:16,532 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:25:16,532 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:25:16,797 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:25:16,797 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-30 14:25:16,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:25:16 BoogieIcfgContainer [2024-01-30 14:25:16,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:25:16,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:25:16,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:25:16,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:25:16,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:25:13" (1/4) ... [2024-01-30 14:25:16,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295bdbbc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:25:16, skipping insertion in model container [2024-01-30 14:25:16,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:25:15" (2/4) ... [2024-01-30 14:25:16,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295bdbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:25:16, skipping insertion in model container [2024-01-30 14:25:16,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:25:15" (3/4) ... [2024-01-30 14:25:16,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295bdbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:25:16, skipping insertion in model container [2024-01-30 14:25:16,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:25:16" (4/4) ... [2024-01-30 14:25:16,808 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-01-30 14:25:16,822 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:25:16,823 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2024-01-30 14:25:16,823 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:25:16,900 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-30 14:25:16,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 124 transitions, 262 flow [2024-01-30 14:25:16,993 INFO L124 PetriNetUnfolderBase]: 5/122 cut-off events. [2024-01-30 14:25:16,993 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-30 14:25:16,996 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-01-30 14:25:16,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 124 transitions, 262 flow [2024-01-30 14:25:17,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 121 transitions, 254 flow [2024-01-30 14:25:17,011 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:25:17,016 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;@120d52a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:25:17,017 INFO L358 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2024-01-30 14:25:17,019 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:25:17,019 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:25:17,019 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:25:17,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:25:17,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:25:17,027 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-01-30 14:25:17,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:25:17,032 INFO L85 PathProgramCache]: Analyzing trace with hash 22825, now seen corresponding path program 1 times [2024-01-30 14:25:17,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:25:17,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16333284] [2024-01-30 14:25:17,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:25:17,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:25:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:25:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:17,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:25:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16333284] [2024-01-30 14:25:17,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16333284] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:25:17,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:25:17,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:25:17,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533394182] [2024-01-30 14:25:17,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:25:17,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:25:17,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:25:17,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:25:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:25:17,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 124 [2024-01-30 14:25:17,509 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-01-30 14:25:17,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:25:17,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 124 [2024-01-30 14:25:17,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:25:17,791 INFO L124 PetriNetUnfolderBase]: 499/1152 cut-off events. [2024-01-30 14:25:17,791 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-01-30 14:25:17,796 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-01-30 14:25:17,803 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 55 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-01-30 14:25:17,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 111 transitions, 348 flow [2024-01-30 14:25:17,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:25:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:25:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2024-01-30 14:25:17,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6317204301075269 [2024-01-30 14:25:17,817 INFO L175 Difference]: Start difference. First operand has 123 places, 121 transitions, 254 flow. Second operand 3 states and 235 transitions. [2024-01-30 14:25:17,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 111 transitions, 348 flow [2024-01-30 14:25:17,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 111 transitions, 340 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-30 14:25:17,826 INFO L231 Difference]: Finished difference. Result has 111 places, 111 transitions, 230 flow [2024-01-30 14:25:17,828 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-01-30 14:25:17,836 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -12 predicate places. [2024-01-30 14:25:17,836 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 111 transitions, 230 flow [2024-01-30 14:25:17,837 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-01-30 14:25:17,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:25:17,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-30 14:25:17,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:25:17,837 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-01-30 14:25:17,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:25:17,838 INFO L85 PathProgramCache]: Analyzing trace with hash 708321, now seen corresponding path program 1 times [2024-01-30 14:25:17,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:25:17,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343982249] [2024-01-30 14:25:17,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:25:17,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:25:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:25:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:18,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:25:18,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343982249] [2024-01-30 14:25:18,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343982249] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:25:18,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:25:18,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:25:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723242690] [2024-01-30 14:25:18,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:25:18,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:25:18,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:25:18,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:25:18,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:25:18,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 124 [2024-01-30 14:25:18,138 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-01-30 14:25:18,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:25:18,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 124 [2024-01-30 14:25:18,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:25:18,325 INFO L124 PetriNetUnfolderBase]: 499/1151 cut-off events. [2024-01-30 14:25:18,325 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-01-30 14:25:18,327 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-01-30 14:25:18,330 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 65 selfloop transitions, 3 changer transitions 0/110 dead transitions. [2024-01-30 14:25:18,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 110 transitions, 364 flow [2024-01-30 14:25:18,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:25:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:25:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2024-01-30 14:25:18,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020161290322581 [2024-01-30 14:25:18,334 INFO L175 Difference]: Start difference. First operand has 111 places, 111 transitions, 230 flow. Second operand 4 states and 249 transitions. [2024-01-30 14:25:18,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 110 transitions, 364 flow [2024-01-30 14:25:18,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 110 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:25:18,337 INFO L231 Difference]: Finished difference. Result has 111 places, 110 transitions, 230 flow [2024-01-30 14:25:18,338 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-01-30 14:25:18,338 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -12 predicate places. [2024-01-30 14:25:18,338 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 110 transitions, 230 flow [2024-01-30 14:25:18,339 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-01-30 14:25:18,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:25:18,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-30 14:25:18,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:25:18,339 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-01-30 14:25:18,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:25:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash 21958758, now seen corresponding path program 1 times [2024-01-30 14:25:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:25:18,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108843000] [2024-01-30 14:25:18,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:25:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:25:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:25:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:18,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:25:18,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108843000] [2024-01-30 14:25:18,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108843000] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:25:18,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:25:18,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:25:18,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322052018] [2024-01-30 14:25:18,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:25:18,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:25:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:25:18,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:25:18,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:25:18,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-01-30 14:25:18,596 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-01-30 14:25:18,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:25:18,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-01-30 14:25:18,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:25:18,748 INFO L124 PetriNetUnfolderBase]: 460/1098 cut-off events. [2024-01-30 14:25:18,749 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-01-30 14:25:18,750 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-01-30 14:25:18,753 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 67 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-01-30 14:25:18,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 109 transitions, 368 flow [2024-01-30 14:25:18,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:25:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:25:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2024-01-30 14:25:18,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4899193548387097 [2024-01-30 14:25:18,755 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 230 flow. Second operand 4 states and 243 transitions. [2024-01-30 14:25:18,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 109 transitions, 368 flow [2024-01-30 14:25:18,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 109 transitions, 362 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-30 14:25:18,757 INFO L231 Difference]: Finished difference. Result has 110 places, 109 transitions, 228 flow [2024-01-30 14:25:18,757 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-01-30 14:25:18,758 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -13 predicate places. [2024-01-30 14:25:18,758 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 109 transitions, 228 flow [2024-01-30 14:25:18,758 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-01-30 14:25:18,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:25:18,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-30 14:25:18,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:25:18,759 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-01-30 14:25:18,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:25:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash 680722200, now seen corresponding path program 1 times [2024-01-30 14:25:18,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:25:18,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812606271] [2024-01-30 14:25:18,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:25:18,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:25:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:25:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:18,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:25:18,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812606271] [2024-01-30 14:25:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812606271] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:25:18,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:25:18,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:25:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269602195] [2024-01-30 14:25:18,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:25:18,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:25:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:25:18,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:25:18,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:25:18,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 124 [2024-01-30 14:25:18,970 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-01-30 14:25:18,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:25:18,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 124 [2024-01-30 14:25:18,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:25:19,114 INFO L124 PetriNetUnfolderBase]: 460/1097 cut-off events. [2024-01-30 14:25:19,115 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-01-30 14:25:19,116 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-01-30 14:25:19,120 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 66 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2024-01-30 14:25:19,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 108 transitions, 364 flow [2024-01-30 14:25:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:25:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:25:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2024-01-30 14:25:19,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959677419354839 [2024-01-30 14:25:19,121 INFO L175 Difference]: Start difference. First operand has 110 places, 109 transitions, 228 flow. Second operand 4 states and 246 transitions. [2024-01-30 14:25:19,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 108 transitions, 364 flow [2024-01-30 14:25:19,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 108 transitions, 358 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-30 14:25:19,123 INFO L231 Difference]: Finished difference. Result has 109 places, 108 transitions, 226 flow [2024-01-30 14:25:19,124 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-01-30 14:25:19,124 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -14 predicate places. [2024-01-30 14:25:19,124 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 108 transitions, 226 flow [2024-01-30 14:25:19,125 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-01-30 14:25:19,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:25:19,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-30 14:25:19,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:25:19,125 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-01-30 14:25:19,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:25:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash -372447499, now seen corresponding path program 1 times [2024-01-30 14:25:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:25:19,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606395642] [2024-01-30 14:25:19,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:25:19,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:25:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:25:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:19,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:25:19,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606395642] [2024-01-30 14:25:19,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606395642] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:25:19,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:25:19,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:25:19,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868109567] [2024-01-30 14:25:19,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:25:19,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:25:19,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:25:19,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:25:19,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:25:19,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 124 [2024-01-30 14:25:19,291 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-01-30 14:25:19,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:25:19,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 124 [2024-01-30 14:25:19,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:25:19,426 INFO L124 PetriNetUnfolderBase]: 460/1096 cut-off events. [2024-01-30 14:25:19,426 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-01-30 14:25:19,428 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-01-30 14:25:19,432 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 65 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2024-01-30 14:25:19,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 107 transitions, 360 flow [2024-01-30 14:25:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:25:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:25:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2024-01-30 14:25:19,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020161290322581 [2024-01-30 14:25:19,433 INFO L175 Difference]: Start difference. First operand has 109 places, 108 transitions, 226 flow. Second operand 4 states and 249 transitions. [2024-01-30 14:25:19,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 107 transitions, 360 flow [2024-01-30 14:25:19,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 107 transitions, 354 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-30 14:25:19,436 INFO L231 Difference]: Finished difference. Result has 108 places, 107 transitions, 224 flow [2024-01-30 14:25:19,436 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-01-30 14:25:19,438 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -15 predicate places. [2024-01-30 14:25:19,438 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 107 transitions, 224 flow [2024-01-30 14:25:19,439 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-01-30 14:25:19,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:25:19,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:25:19,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:25:19,439 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-01-30 14:25:19,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:25:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1339030133, now seen corresponding path program 1 times [2024-01-30 14:25:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:25:19,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506642369] [2024-01-30 14:25:19,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:25:19,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:25:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:25:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:19,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:25:19,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506642369] [2024-01-30 14:25:19,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506642369] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:25:19,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:25:19,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:25:19,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348103919] [2024-01-30 14:25:19,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:25:19,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:25:19,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:25:19,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:25:19,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:25:19,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 124 [2024-01-30 14:25:19,632 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-01-30 14:25:19,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:25:19,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 124 [2024-01-30 14:25:19,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:25:19,766 INFO L124 PetriNetUnfolderBase]: 460/1092 cut-off events. [2024-01-30 14:25:19,766 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-01-30 14:25:19,767 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-01-30 14:25:19,771 INFO L140 encePairwiseOnDemand]: 117/124 looper letters, 61 selfloop transitions, 3 changer transitions 0/103 dead transitions. [2024-01-30 14:25:19,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 103 transitions, 344 flow [2024-01-30 14:25:19,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:25:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:25:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2024-01-30 14:25:19,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080645161290323 [2024-01-30 14:25:19,773 INFO L175 Difference]: Start difference. First operand has 108 places, 107 transitions, 224 flow. Second operand 4 states and 252 transitions. [2024-01-30 14:25:19,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 103 transitions, 344 flow [2024-01-30 14:25:19,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 103 transitions, 338 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-30 14:25:19,775 INFO L231 Difference]: Finished difference. Result has 104 places, 103 transitions, 216 flow [2024-01-30 14:25:19,775 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-01-30 14:25:19,778 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -19 predicate places. [2024-01-30 14:25:19,778 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 103 transitions, 216 flow [2024-01-30 14:25:19,778 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-01-30 14:25:19,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:25:19,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:25:19,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:25:19,779 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-01-30 14:25:19,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:25:19,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1692103552, now seen corresponding path program 1 times [2024-01-30 14:25:19,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:25:19,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434116231] [2024-01-30 14:25:19,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:25:19,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:25:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:25:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:19,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:25:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434116231] [2024-01-30 14:25:19,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434116231] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:25:19,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:25:19,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:25:19,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750662379] [2024-01-30 14:25:19,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:25:19,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-30 14:25:19,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:25:19,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-30 14:25:19,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-30 14:25:20,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 124 [2024-01-30 14:25:20,006 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-01-30 14:25:20,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:25:20,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 124 [2024-01-30 14:25:20,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:25:20,151 INFO L124 PetriNetUnfolderBase]: 460/1090 cut-off events. [2024-01-30 14:25:20,151 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-01-30 14:25:20,152 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-01-30 14:25:20,155 INFO L140 encePairwiseOnDemand]: 111/124 looper letters, 47 selfloop transitions, 11 changer transitions 0/101 dead transitions. [2024-01-30 14:25:20,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 101 transitions, 328 flow [2024-01-30 14:25:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:25:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:25:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 330 transitions. [2024-01-30 14:25:20,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-01-30 14:25:20,157 INFO L175 Difference]: Start difference. First operand has 104 places, 103 transitions, 216 flow. Second operand 5 states and 330 transitions. [2024-01-30 14:25:20,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 101 transitions, 328 flow [2024-01-30 14:25:20,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 101 transitions, 322 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-30 14:25:20,158 INFO L231 Difference]: Finished difference. Result has 103 places, 101 transitions, 228 flow [2024-01-30 14:25:20,159 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-01-30 14:25:20,159 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -20 predicate places. [2024-01-30 14:25:20,159 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 101 transitions, 228 flow [2024-01-30 14:25:20,160 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-01-30 14:25:20,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:25:20,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:25:20,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:25:20,160 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-01-30 14:25:20,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:25:20,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1681114833, now seen corresponding path program 1 times [2024-01-30 14:25:20,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:25:20,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188381675] [2024-01-30 14:25:20,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:25:20,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:25:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:25:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:20,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:25:20,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188381675] [2024-01-30 14:25:20,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188381675] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:25:20,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:25:20,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:25:20,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086977621] [2024-01-30 14:25:20,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:25:20,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-30 14:25:20,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:25:20,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-30 14:25:20,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-30 14:25:20,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 124 [2024-01-30 14:25:20,404 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-01-30 14:25:20,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:25:20,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 124 [2024-01-30 14:25:20,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:25:20,557 INFO L124 PetriNetUnfolderBase]: 460/1088 cut-off events. [2024-01-30 14:25:20,557 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-01-30 14:25:20,559 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-01-30 14:25:20,562 INFO L140 encePairwiseOnDemand]: 109/124 looper letters, 47 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2024-01-30 14:25:20,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 344 flow [2024-01-30 14:25:20,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-30 14:25:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-30 14:25:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 362 transitions. [2024-01-30 14:25:20,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48655913978494625 [2024-01-30 14:25:20,564 INFO L175 Difference]: Start difference. First operand has 103 places, 101 transitions, 228 flow. Second operand 6 states and 362 transitions. [2024-01-30 14:25:20,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 344 flow [2024-01-30 14:25:20,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 99 transitions, 322 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-30 14:25:20,566 INFO L231 Difference]: Finished difference. Result has 102 places, 99 transitions, 228 flow [2024-01-30 14:25:20,566 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-01-30 14:25:20,567 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -21 predicate places. [2024-01-30 14:25:20,567 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 99 transitions, 228 flow [2024-01-30 14:25:20,567 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-01-30 14:25:20,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:25:20,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:25:20,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-30 14:25:20,568 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-01-30 14:25:20,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:25:20,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1681114821, now seen corresponding path program 1 times [2024-01-30 14:25:20,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:25:20,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126423118] [2024-01-30 14:25:20,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:25:20,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:25:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:25:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:20,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:25:20,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126423118] [2024-01-30 14:25:20,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126423118] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:25:20,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:25:20,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:25:20,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519388266] [2024-01-30 14:25:20,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:25:20,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-30 14:25:20,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:25:20,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-30 14:25:20,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-01-30 14:25:20,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 124 [2024-01-30 14:25:20,839 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-01-30 14:25:20,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:25:20,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 124 [2024-01-30 14:25:20,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:25:20,977 INFO L124 PetriNetUnfolderBase]: 460/1082 cut-off events. [2024-01-30 14:25:20,977 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-01-30 14:25:20,978 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-01-30 14:25:20,982 INFO L140 encePairwiseOnDemand]: 106/124 looper letters, 50 selfloop transitions, 12 changer transitions 0/93 dead transitions. [2024-01-30 14:25:20,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 93 transitions, 340 flow [2024-01-30 14:25:20,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-30 14:25:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-30 14:25:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 302 transitions. [2024-01-30 14:25:20,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40591397849462363 [2024-01-30 14:25:20,984 INFO L175 Difference]: Start difference. First operand has 102 places, 99 transitions, 228 flow. Second operand 6 states and 302 transitions. [2024-01-30 14:25:20,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 93 transitions, 340 flow [2024-01-30 14:25:20,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 93 transitions, 314 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-01-30 14:25:20,986 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 214 flow [2024-01-30 14:25:20,986 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-01-30 14:25:20,986 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -27 predicate places. [2024-01-30 14:25:20,986 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 214 flow [2024-01-30 14:25:20,987 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-01-30 14:25:20,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:25:20,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:25:20,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-30 14:25:20,987 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (and 83 more)] === [2024-01-30 14:25:20,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:25:20,988 INFO L85 PathProgramCache]: Analyzing trace with hash 574952980, now seen corresponding path program 1 times [2024-01-30 14:25:20,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:25:20,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497120739] [2024-01-30 14:25:20,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:25:20,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:25:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:25:21,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:25:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:25:21,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:25:21,024 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:25:21,024 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 86 remaining) [2024-01-30 14:25:21,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 86 remaining) [2024-01-30 14:25:21,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 86 remaining) [2024-01-30 14:25:21,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 86 remaining) [2024-01-30 14:25:21,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 86 remaining) [2024-01-30 14:25:21,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 86 remaining) [2024-01-30 14:25:21,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 86 remaining) [2024-01-30 14:25:21,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 86 remaining) [2024-01-30 14:25:21,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 86 remaining) [2024-01-30 14:25:21,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 86 remaining) [2024-01-30 14:25:21,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 86 remaining) [2024-01-30 14:25:21,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 86 remaining) [2024-01-30 14:25:21,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 86 remaining) [2024-01-30 14:25:21,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 86 remaining) [2024-01-30 14:25:21,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 86 remaining) [2024-01-30 14:25:21,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 86 remaining) [2024-01-30 14:25:21,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 86 remaining) [2024-01-30 14:25:21,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 86 remaining) [2024-01-30 14:25:21,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 86 remaining) [2024-01-30 14:25:21,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 86 remaining) [2024-01-30 14:25:21,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 86 remaining) [2024-01-30 14:25:21,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 86 remaining) [2024-01-30 14:25:21,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 86 remaining) [2024-01-30 14:25:21,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 86 remaining) [2024-01-30 14:25:21,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 86 remaining) [2024-01-30 14:25:21,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 86 remaining) [2024-01-30 14:25:21,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 86 remaining) [2024-01-30 14:25:21,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 86 remaining) [2024-01-30 14:25:21,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 86 remaining) [2024-01-30 14:25:21,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 86 remaining) [2024-01-30 14:25:21,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 86 remaining) [2024-01-30 14:25:21,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 86 remaining) [2024-01-30 14:25:21,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 86 remaining) [2024-01-30 14:25:21,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 86 remaining) [2024-01-30 14:25:21,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 86 remaining) [2024-01-30 14:25:21,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 86 remaining) [2024-01-30 14:25:21,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 86 remaining) [2024-01-30 14:25:21,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 86 remaining) [2024-01-30 14:25:21,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 86 remaining) [2024-01-30 14:25:21,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 86 remaining) [2024-01-30 14:25:21,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 86 remaining) [2024-01-30 14:25:21,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 86 remaining) [2024-01-30 14:25:21,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 86 remaining) [2024-01-30 14:25:21,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 86 remaining) [2024-01-30 14:25:21,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 86 remaining) [2024-01-30 14:25:21,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 86 remaining) [2024-01-30 14:25:21,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 86 remaining) [2024-01-30 14:25:21,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 86 remaining) [2024-01-30 14:25:21,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 86 remaining) [2024-01-30 14:25:21,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 86 remaining) [2024-01-30 14:25:21,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 86 remaining) [2024-01-30 14:25:21,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 86 remaining) [2024-01-30 14:25:21,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 86 remaining) [2024-01-30 14:25:21,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 86 remaining) [2024-01-30 14:25:21,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (31 of 86 remaining) [2024-01-30 14:25:21,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 86 remaining) [2024-01-30 14:25:21,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 86 remaining) [2024-01-30 14:25:21,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 86 remaining) [2024-01-30 14:25:21,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 86 remaining) [2024-01-30 14:25:21,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 86 remaining) [2024-01-30 14:25:21,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 86 remaining) [2024-01-30 14:25:21,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 86 remaining) [2024-01-30 14:25:21,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 86 remaining) [2024-01-30 14:25:21,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 86 remaining) [2024-01-30 14:25:21,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 86 remaining) [2024-01-30 14:25:21,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 86 remaining) [2024-01-30 14:25:21,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 86 remaining) [2024-01-30 14:25:21,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 86 remaining) [2024-01-30 14:25:21,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 86 remaining) [2024-01-30 14:25:21,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 86 remaining) [2024-01-30 14:25:21,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 86 remaining) [2024-01-30 14:25:21,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 86 remaining) [2024-01-30 14:25:21,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 86 remaining) [2024-01-30 14:25:21,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 86 remaining) [2024-01-30 14:25:21,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 86 remaining) [2024-01-30 14:25:21,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 86 remaining) [2024-01-30 14:25:21,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 86 remaining) [2024-01-30 14:25:21,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 86 remaining) [2024-01-30 14:25:21,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 86 remaining) [2024-01-30 14:25:21,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 86 remaining) [2024-01-30 14:25:21,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 86 remaining) [2024-01-30 14:25:21,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 86 remaining) [2024-01-30 14:25:21,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 86 remaining) [2024-01-30 14:25:21,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 86 remaining) [2024-01-30 14:25:21,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 86 remaining) [2024-01-30 14:25:21,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 86 remaining) [2024-01-30 14:25:21,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-30 14:25:21,039 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:25:21,043 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:25:21,044 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:25:21,063 INFO L503 ceAbstractionStarter]: Automizer considered 54 witness invariants [2024-01-30 14:25:21,064 INFO L504 ceAbstractionStarter]: WitnessConsidered=54 [2024-01-30 14:25:21,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:25:21 BasicIcfg [2024-01-30 14:25:21,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:25:21,065 INFO L158 Benchmark]: Toolchain (without parser) took 5744.40ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 163.8MB in the beginning and 110.5MB in the end (delta: 53.2MB). Peak memory consumption was 141.0MB. Max. memory is 16.1GB. [2024-01-30 14:25:21,065 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 148.9MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:25:21,065 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 148.9MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:25:21,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.05ms. Allocated memory is still 192.9MB. Free memory was 163.6MB in the beginning and 144.7MB in the end (delta: 18.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-30 14:25:21,066 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.83ms. Allocated memory is still 192.9MB. Free memory was 144.7MB in the beginning and 140.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-30 14:25:21,066 INFO L158 Benchmark]: Boogie Preprocessor took 97.35ms. Allocated memory is still 192.9MB. Free memory was 140.4MB in the beginning and 137.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:25:21,066 INFO L158 Benchmark]: RCFGBuilder took 895.72ms. Allocated memory is still 192.9MB. Free memory was 137.4MB in the beginning and 89.6MB in the end (delta: 47.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-01-30 14:25:21,066 INFO L158 Benchmark]: TraceAbstraction took 4262.70ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 88.5MB in the beginning and 110.5MB in the end (delta: -22.0MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2024-01-30 14:25:21,067 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 148.9MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 148.9MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.05ms. Allocated memory is still 192.9MB. Free memory was 163.6MB in the beginning and 144.7MB in the end (delta: 18.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.83ms. Allocated memory is still 192.9MB. Free memory was 144.7MB in the beginning and 140.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.35ms. Allocated memory is still 192.9MB. Free memory was 140.4MB in the beginning and 137.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 895.72ms. Allocated memory is still 192.9MB. Free memory was 137.4MB in the beginning and 89.6MB in the end (delta: 47.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4262.70ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 88.5MB in the beginning and 110.5MB in the end (delta: -22.0MB). Peak memory consumption was 68.2MB. 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: 4.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 967 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 1.2s 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.3s 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.4s 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-01-30 14:25:21,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE