./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 cb09d658 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-cb09d65-m [2024-01-27 23:10:06,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 23:10:06,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 23:10:06,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 23:10:06,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 23:10:06,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 23:10:06,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 23:10:06,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 23:10:06,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 23:10:06,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 23:10:06,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 23:10:06,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 23:10:06,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 23:10:06,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 23:10:06,514 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 23:10:06,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 23:10:06,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 23:10:06,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 23:10:06,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 23:10:06,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 23:10:06,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 23:10:06,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 23:10:06,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 23:10:06,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 23:10:06,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 23:10:06,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 23:10:06,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 23:10:06,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 23:10:06,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 23:10:06,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 23:10:06,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 23:10:06,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 23:10:06,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:10:06,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 23:10:06,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 23:10:06,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 23:10:06,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 23:10:06,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 23:10:06,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 23:10:06,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 23:10:06,520 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 23:10:06,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 23:10:06,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 23:10:06,520 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-27 23:10:06,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 23:10:06,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 23:10:06,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 23:10:06,784 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 23:10:06,784 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 23:10:06,785 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-27 23:10:06,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 23:10:06,908 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 23:10:06,908 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-27 23:10:08,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 23:10:08,213 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 23:10:08,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-01-27 23:10:08,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd94fb98f/030977afad184374b5b03ef6ff98aa97/FLAGd710f3785 [2024-01-27 23:10:08,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd94fb98f/030977afad184374b5b03ef6ff98aa97 [2024-01-27 23:10:08,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 23:10:08,237 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 23:10:08,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 23:10:08,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 23:10:08,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 23:10:08,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:10:06" (1/2) ... [2024-01-27 23:10:08,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c476dc4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08, skipping insertion in model container [2024-01-27 23:10:08,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:10:06" (1/2) ... [2024-01-27 23:10:08,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5c70fb2d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08, skipping insertion in model container [2024-01-27 23:10:08,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:10:08" (2/2) ... [2024-01-27 23:10:08,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c476dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08, skipping insertion in model container [2024-01-27 23:10:08,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:10:08" (2/2) ... [2024-01-27 23:10:08,247 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 23:10:08,290 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 23:10:08,291 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] new == 0 [2024-01-27 23:10:08,291 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] N == 0 [2024-01-27 23:10:08,291 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] v_old == 0 [2024-01-27 23:10:08,291 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (long long )end - (long long )start >= 0LL [2024-01-27 23:10:08,292 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] A == 0 [2024-01-27 23:10:08,292 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] queue == 0 [2024-01-27 23:10:08,292 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (long long )end + (long long )start >= 0LL [2024-01-27 23:10:08,292 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-27 23:10:08,292 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] i == 0 [2024-01-27 23:10:08,292 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-27 23:10:08,292 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] n == 0 [2024-01-27 23:10:08,293 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ok == (_Bool)1 [2024-01-27 23:10:08,293 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] start == 0 [2024-01-27 23:10:08,293 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] end == 0 [2024-01-27 23:10:08,293 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] last == 0 [2024-01-27 23:10:08,293 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] new == 0 [2024-01-27 23:10:08,293 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] v_old == 0 [2024-01-27 23:10:08,293 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] last == 0 [2024-01-27 23:10:08,294 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] i == 0 [2024-01-27 23:10:08,294 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ok == (_Bool)1 [2024-01-27 23:10:08,294 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] A == 0 [2024-01-27 23:10:08,294 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] 0 <= i [2024-01-27 23:10:08,294 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,295 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] i == 0 [2024-01-27 23:10:08,295 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] ok == (_Bool)1 [2024-01-27 23:10:08,295 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] v_old == 0 [2024-01-27 23:10:08,295 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] last == 0 [2024-01-27 23:10:08,295 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] new == 0 [2024-01-27 23:10:08,295 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,295 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] A == 0 [2024-01-27 23:10:08,296 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] new == 0 [2024-01-27 23:10:08,296 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] last == 0 [2024-01-27 23:10:08,296 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] ok == (_Bool)1 [2024-01-27 23:10:08,296 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] v_old == 0 [2024-01-27 23:10:08,296 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] i == 0 [2024-01-27 23:10:08,296 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] i == 0 [2024-01-27 23:10:08,297 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] new == 0 [2024-01-27 23:10:08,297 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] ok == (_Bool)1 [2024-01-27 23:10:08,298 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] queue == 0 [2024-01-27 23:10:08,298 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] i == 0 [2024-01-27 23:10:08,299 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] end == 0 [2024-01-27 23:10:08,299 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] v_old == 0 [2024-01-27 23:10:08,299 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] new == 0 [2024-01-27 23:10:08,299 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-27 23:10:08,299 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] A == 0 [2024-01-27 23:10:08,299 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] n == 0 [2024-01-27 23:10:08,300 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (long long )end + (long long )start >= 0LL [2024-01-27 23:10:08,300 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] start == 0 [2024-01-27 23:10:08,300 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] last == 0 [2024-01-27 23:10:08,300 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (long long )end - (long long )start >= 0LL [2024-01-27 23:10:08,300 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ok == (_Bool)1 [2024-01-27 23:10:08,300 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-27 23:10:08,301 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,301 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] 0 <= i [2024-01-27 23:10:08,301 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] i == 0 [2024-01-27 23:10:08,302 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] ok == (_Bool)1 [2024-01-27 23:10:08,302 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] v_old == 0 [2024-01-27 23:10:08,302 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] A == 0 [2024-01-27 23:10:08,303 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] new == 0 [2024-01-27 23:10:08,303 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] last == 0 [2024-01-27 23:10:08,303 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] (((((((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-27 23:10:08,303 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] 0 <= i [2024-01-27 23:10:08,303 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,304 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,304 INFO L98 nessWitnessExtractor]: Loop invariant at [L69-L80] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,304 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] -2147483647 <= start [2024-01-27 23:10:08,304 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,304 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] 0 <= i [2024-01-27 23:10:08,304 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,304 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] 0 <= i [2024-01-27 23:10:08,304 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ok == (_Bool)0 [2024-01-27 23:10:08,305 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (long long )end + (long long )start >= 0LL [2024-01-27 23:10:08,305 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-27 23:10:08,305 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] last == 0 [2024-01-27 23:10:08,305 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] v_old == 0 [2024-01-27 23:10:08,305 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-27 23:10:08,308 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] A == 0 [2024-01-27 23:10:08,309 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] i == 0 [2024-01-27 23:10:08,309 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] N == 0 [2024-01-27 23:10:08,309 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] start == 0 [2024-01-27 23:10:08,310 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] new == 0 [2024-01-27 23:10:08,310 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] queue == 0 [2024-01-27 23:10:08,310 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] n == 0 [2024-01-27 23:10:08,310 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] end == 0 [2024-01-27 23:10:08,310 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (long long )end - (long long )start >= 0LL [2024-01-27 23:10:08,310 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] 0 <= end [2024-01-27 23:10:08,310 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,310 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] 0 <= i [2024-01-27 23:10:08,311 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,311 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] 0 <= i [2024-01-27 23:10:08,311 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,311 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] start <= 2147483646 [2024-01-27 23:10:08,311 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] -2147483647 <= end [2024-01-27 23:10:08,311 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,311 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,311 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,311 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,312 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] i == 0 [2024-01-27 23:10:08,312 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] new == 0 [2024-01-27 23:10:08,312 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] v_old == 0 [2024-01-27 23:10:08,312 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] last == 0 [2024-01-27 23:10:08,312 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] ok == (_Bool)1 [2024-01-27 23:10:08,312 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,312 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,313 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] (-1LL - (long long )i) + (long long )size >= 0LL [2024-01-27 23:10:08,313 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] i == 0 [2024-01-27 23:10:08,314 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] new == 0 [2024-01-27 23:10:08,314 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] A == 0 [2024-01-27 23:10:08,314 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] ok == (_Bool)1 [2024-01-27 23:10:08,315 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] size != 0 [2024-01-27 23:10:08,315 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] v_old == 0 [2024-01-27 23:10:08,315 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] last == 0 [2024-01-27 23:10:08,315 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] (((((((((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-27 23:10:08,315 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] i == 0 [2024-01-27 23:10:08,316 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] end == 0 [2024-01-27 23:10:08,316 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] ok == (_Bool)1 [2024-01-27 23:10:08,316 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] v_old == 0 [2024-01-27 23:10:08,316 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] queue == 0 [2024-01-27 23:10:08,316 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] last == 0 [2024-01-27 23:10:08,317 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] A == 0 [2024-01-27 23:10:08,317 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] new == 0 [2024-01-27 23:10:08,317 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,317 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] 1 <= i [2024-01-27 23:10:08,317 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] 0 <= i [2024-01-27 23:10:08,317 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,317 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] new == 0 [2024-01-27 23:10:08,318 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] last == 0 [2024-01-27 23:10:08,318 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] ok == (_Bool)1 [2024-01-27 23:10:08,318 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] i == 0 [2024-01-27 23:10:08,318 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] A == 0 [2024-01-27 23:10:08,318 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] end == 0 [2024-01-27 23:10:08,318 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (long long )end - (long long )start >= 0LL [2024-01-27 23:10:08,318 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] queue == 0 [2024-01-27 23:10:08,318 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-27 23:10:08,319 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (long long )end + (long long )start >= 0LL [2024-01-27 23:10:08,319 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] v_old == 0 [2024-01-27 23:10:08,319 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] new == 0 [2024-01-27 23:10:08,319 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-27 23:10:08,319 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] i == 0 [2024-01-27 23:10:08,319 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] last == 0 [2024-01-27 23:10:08,320 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ok == (_Bool)1 [2024-01-27 23:10:08,320 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] start == 0 [2024-01-27 23:10:08,320 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,320 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] 0 <= i [2024-01-27 23:10:08,320 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,321 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] new == 0 [2024-01-27 23:10:08,321 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] ok == (_Bool)1 [2024-01-27 23:10:08,321 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] v_old == 0 [2024-01-27 23:10:08,321 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] last == 0 [2024-01-27 23:10:08,321 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] A == 0 [2024-01-27 23:10:08,322 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] i == 0 [2024-01-27 23:10:08,322 INFO L98 nessWitnessExtractor]: Loop invariant at [L48-L60] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,322 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,322 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] 0 <= i [2024-01-27 23:10:08,323 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] -2147483647 <= end [2024-01-27 23:10:08,323 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] 0 <= i [2024-01-27 23:10:08,323 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,323 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L56] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,323 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] 0 <= i [2024-01-27 23:10:08,323 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,323 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] last == 0 [2024-01-27 23:10:08,323 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] ok == (_Bool)1 [2024-01-27 23:10:08,324 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] i == 0 [2024-01-27 23:10:08,324 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] queue == 0 [2024-01-27 23:10:08,324 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] new == 0 [2024-01-27 23:10:08,325 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] v_old == 0 [2024-01-27 23:10:08,325 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] A == 0 [2024-01-27 23:10:08,325 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] i == 0 [2024-01-27 23:10:08,325 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] ok == (_Bool)1 [2024-01-27 23:10:08,325 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] 0 <= i [2024-01-27 23:10:08,325 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] last == 0 [2024-01-27 23:10:08,326 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] new == 0 [2024-01-27 23:10:08,326 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] v_old == 0 [2024-01-27 23:10:08,326 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] (long long )i - (long long )size >= 0LL [2024-01-27 23:10:08,327 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] A == 0 [2024-01-27 23:10:08,327 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ok == (_Bool)1 [2024-01-27 23:10:08,327 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] last == 0 [2024-01-27 23:10:08,327 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] v_old == 0 [2024-01-27 23:10:08,327 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] new == 0 [2024-01-27 23:10:08,328 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] A == 0 [2024-01-27 23:10:08,329 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] i == 0 [2024-01-27 23:10:08,331 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] 0 <= i [2024-01-27 23:10:08,331 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-27 23:10:08,332 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] i == 0 [2024-01-27 23:10:08,332 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] ok == (_Bool)1 [2024-01-27 23:10:08,337 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] A == 0 [2024-01-27 23:10:08,338 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] v_old == 0 [2024-01-27 23:10:08,338 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] last == 0 [2024-01-27 23:10:08,338 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] new == 0 [2024-01-27 23:10:08,359 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 23:10:08,498 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-27 23:10:08,511 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:10:08,528 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 23:10:08,538 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 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 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 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-27 23:10:08,625 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 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-27 23:10:08,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:10:08,654 INFO L206 MainTranslator]: Completed translation [2024-01-27 23:10:08,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08 WrapperNode [2024-01-27 23:10:08,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 23:10:08,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 23:10:08,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 23:10:08,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 23:10:08,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,699 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 440 [2024-01-27 23:10:08,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 23:10:08,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 23:10:08,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 23:10:08,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 23:10:08,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,754 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 2, 2, 8]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 2]. [2024-01-27 23:10:08,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 23:10:08,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 23:10:08,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 23:10:08,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 23:10:08,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:10:08,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 23:10:08,835 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-27 23:10:08,858 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-27 23:10:08,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 23:10:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 23:10:08,946 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 23:10:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 23:10:08,946 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 23:10:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 23:10:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 23:10:08,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 23:10:08,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 23:10:08,949 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 23:10:09,066 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 23:10:09,067 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 23:10:09,666 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 23:10:09,667 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 23:10:09,867 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 23:10:09,868 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-27 23:10:09,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:10:09 BoogieIcfgContainer [2024-01-27 23:10:09,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 23:10:09,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 23:10:09,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 23:10:09,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 23:10:09,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:10:06" (1/4) ... [2024-01-27 23:10:09,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f348576 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:10:09, skipping insertion in model container [2024-01-27 23:10:09,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:10:08" (2/4) ... [2024-01-27 23:10:09,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f348576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:10:09, skipping insertion in model container [2024-01-27 23:10:09,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:08" (3/4) ... [2024-01-27 23:10:09,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f348576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:10:09, skipping insertion in model container [2024-01-27 23:10:09,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:10:09" (4/4) ... [2024-01-27 23:10:09,874 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-01-27 23:10:09,889 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 23:10:09,889 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 242 error locations. [2024-01-27 23:10:09,889 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 23:10:09,967 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 23:10:10,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 481 places, 479 transitions, 972 flow [2024-01-27 23:10:10,133 INFO L124 PetriNetUnfolderBase]: 5/477 cut-off events. [2024-01-27 23:10:10,133 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 23:10:10,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 477 events. 5/477 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 792 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 430. Up to 2 conditions per place. [2024-01-27 23:10:10,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 481 places, 479 transitions, 972 flow [2024-01-27 23:10:10,146 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 478 places, 476 transitions, 964 flow [2024-01-27 23:10:10,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 23:10:10,166 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;@37d59185, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 23:10:10,166 INFO L358 AbstractCegarLoop]: Starting to check reachability of 292 error locations. [2024-01-27 23:10:10,167 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 23:10:10,168 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 23:10:10,168 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:10:10,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:10,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 23:10:10,169 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:10,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:10,175 INFO L85 PathProgramCache]: Analyzing trace with hash 41820, now seen corresponding path program 1 times [2024-01-27 23:10:10,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:10,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273839692] [2024-01-27 23:10:10,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:10,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:10,416 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-27 23:10:10,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:10,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273839692] [2024-01-27 23:10:10,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273839692] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:10,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:10,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:10,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676743732] [2024-01-27 23:10:10,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:10,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:10,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:10,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:10,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:10,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 479 [2024-01-27 23:10:10,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 476 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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-27 23:10:10,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:10,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 479 [2024-01-27 23:10:10,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:10,937 INFO L124 PetriNetUnfolderBase]: 877/2162 cut-off events. [2024-01-27 23:10:10,938 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-01-27 23:10:10,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3583 conditions, 2162 events. 877/2162 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13206 event pairs, 621 based on Foata normal form. 24/1318 useless extension candidates. Maximal degree in co-relation 2997. Up to 1369 conditions per place. [2024-01-27 23:10:10,950 INFO L140 encePairwiseOnDemand]: 433/479 looper letters, 59 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2024-01-27 23:10:10,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 432 transitions, 998 flow [2024-01-27 23:10:10,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2024-01-27 23:10:10,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8517745302713987 [2024-01-27 23:10:10,963 INFO L175 Difference]: Start difference. First operand has 478 places, 476 transitions, 964 flow. Second operand 3 states and 1224 transitions. [2024-01-27 23:10:10,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 432 transitions, 998 flow [2024-01-27 23:10:10,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 432 transitions, 990 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 23:10:10,975 INFO L231 Difference]: Finished difference. Result has 432 places, 432 transitions, 872 flow [2024-01-27 23:10:10,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=432, PETRI_TRANSITIONS=432} [2024-01-27 23:10:10,979 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -46 predicate places. [2024-01-27 23:10:10,979 INFO L495 AbstractCegarLoop]: Abstraction has has 432 places, 432 transitions, 872 flow [2024-01-27 23:10:10,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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-27 23:10:10,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:10,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 23:10:10,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 23:10:10,981 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:10,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash 40228762, now seen corresponding path program 1 times [2024-01-27 23:10:10,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:10,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604974141] [2024-01-27 23:10:10,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:10,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:11,003 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-27 23:10:11,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:11,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604974141] [2024-01-27 23:10:11,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604974141] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:11,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:11,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:11,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293325181] [2024-01-27 23:10:11,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:11,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:11,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:11,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:11,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 392 out of 479 [2024-01-27 23:10:11,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 432 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 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-27 23:10:11,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:11,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 392 of 479 [2024-01-27 23:10:11,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:11,436 INFO L124 PetriNetUnfolderBase]: 877/2159 cut-off events. [2024-01-27 23:10:11,436 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-27 23:10:11,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3552 conditions, 2159 events. 877/2159 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 13227 event pairs, 621 based on Foata normal form. 0/1293 useless extension candidates. Maximal degree in co-relation 3451. Up to 1369 conditions per place. [2024-01-27 23:10:11,444 INFO L140 encePairwiseOnDemand]: 474/479 looper letters, 61 selfloop transitions, 2 changer transitions 0/429 dead transitions. [2024-01-27 23:10:11,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 429 transitions, 992 flow [2024-01-27 23:10:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-01-27 23:10:11,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8643006263048016 [2024-01-27 23:10:11,446 INFO L175 Difference]: Start difference. First operand has 432 places, 432 transitions, 872 flow. Second operand 3 states and 1242 transitions. [2024-01-27 23:10:11,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 429 transitions, 992 flow [2024-01-27 23:10:11,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 429 transitions, 988 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:11,452 INFO L231 Difference]: Finished difference. Result has 429 places, 429 transitions, 866 flow [2024-01-27 23:10:11,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=429, PETRI_TRANSITIONS=429} [2024-01-27 23:10:11,453 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -49 predicate places. [2024-01-27 23:10:11,453 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 429 transitions, 866 flow [2024-01-27 23:10:11,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 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-27 23:10:11,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:11,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 23:10:11,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 23:10:11,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:11,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1247093008, now seen corresponding path program 1 times [2024-01-27 23:10:11,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:11,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092140277] [2024-01-27 23:10:11,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:11,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:11,481 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-27 23:10:11,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:11,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092140277] [2024-01-27 23:10:11,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092140277] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:11,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:11,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691378993] [2024-01-27 23:10:11,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:11,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:11,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:11,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:11,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:11,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 479 [2024-01-27 23:10:11,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 429 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 387.6666666666667) internal successors, (1163), 3 states have internal predecessors, (1163), 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-27 23:10:11,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:11,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 479 [2024-01-27 23:10:11,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:11,772 INFO L124 PetriNetUnfolderBase]: 877/2153 cut-off events. [2024-01-27 23:10:11,772 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-27 23:10:11,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3548 conditions, 2153 events. 877/2153 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 13166 event pairs, 621 based on Foata normal form. 1/1293 useless extension candidates. Maximal degree in co-relation 3472. Up to 1360 conditions per place. [2024-01-27 23:10:11,782 INFO L140 encePairwiseOnDemand]: 471/479 looper letters, 63 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2024-01-27 23:10:11,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 423 transitions, 984 flow [2024-01-27 23:10:11,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1232 transitions. [2024-01-27 23:10:11,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8573416840640222 [2024-01-27 23:10:11,784 INFO L175 Difference]: Start difference. First operand has 429 places, 429 transitions, 866 flow. Second operand 3 states and 1232 transitions. [2024-01-27 23:10:11,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 423 transitions, 984 flow [2024-01-27 23:10:11,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 423 transitions, 980 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:11,790 INFO L231 Difference]: Finished difference. Result has 423 places, 423 transitions, 854 flow [2024-01-27 23:10:11,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=423, PETRI_TRANSITIONS=423} [2024-01-27 23:10:11,791 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -55 predicate places. [2024-01-27 23:10:11,791 INFO L495 AbstractCegarLoop]: Abstraction has has 423 places, 423 transitions, 854 flow [2024-01-27 23:10:11,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.6666666666667) internal successors, (1163), 3 states have internal predecessors, (1163), 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-27 23:10:11,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:11,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 23:10:11,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 23:10:11,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:11,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:11,793 INFO L85 PathProgramCache]: Analyzing trace with hash 5179134, now seen corresponding path program 1 times [2024-01-27 23:10:11,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:11,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487223936] [2024-01-27 23:10:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:11,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:11,811 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-27 23:10:11,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:11,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487223936] [2024-01-27 23:10:11,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487223936] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:11,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:11,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:11,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765746769] [2024-01-27 23:10:11,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:11,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:11,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:11,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:11,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:11,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 479 [2024-01-27 23:10:11,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 423 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 352.6666666666667) internal successors, (1058), 3 states have internal predecessors, (1058), 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-27 23:10:11,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:11,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 479 [2024-01-27 23:10:11,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:12,230 INFO L124 PetriNetUnfolderBase]: 1022/2491 cut-off events. [2024-01-27 23:10:12,230 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-27 23:10:12,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4220 conditions, 2491 events. 1022/2491 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16447 event pairs, 387 based on Foata normal form. 0/1572 useless extension candidates. Maximal degree in co-relation 3992. Up to 907 conditions per place. [2024-01-27 23:10:12,240 INFO L140 encePairwiseOnDemand]: 452/479 looper letters, 104 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2024-01-27 23:10:12,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 423 transitions, 1068 flow [2024-01-27 23:10:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2024-01-27 23:10:12,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.826026443980515 [2024-01-27 23:10:12,243 INFO L175 Difference]: Start difference. First operand has 423 places, 423 transitions, 854 flow. Second operand 3 states and 1187 transitions. [2024-01-27 23:10:12,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 423 transitions, 1068 flow [2024-01-27 23:10:12,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 423 transitions, 1064 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:12,248 INFO L231 Difference]: Finished difference. Result has 399 places, 399 transitions, 810 flow [2024-01-27 23:10:12,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=399, PETRI_TRANSITIONS=399} [2024-01-27 23:10:12,249 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -79 predicate places. [2024-01-27 23:10:12,250 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 399 transitions, 810 flow [2024-01-27 23:10:12,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.6666666666667) internal successors, (1058), 3 states have internal predecessors, (1058), 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-27 23:10:12,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:12,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:12,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 23:10:12,251 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:12,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:12,251 INFO L85 PathProgramCache]: Analyzing trace with hash 682232509, now seen corresponding path program 1 times [2024-01-27 23:10:12,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:12,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209149456] [2024-01-27 23:10:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:12,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:12,268 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-27 23:10:12,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:12,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209149456] [2024-01-27 23:10:12,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209149456] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:12,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:12,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:12,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360707614] [2024-01-27 23:10:12,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:12,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:12,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:12,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:12,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:12,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 479 [2024-01-27 23:10:12,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 399 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 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-27 23:10:12,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:12,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 479 [2024-01-27 23:10:12,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:12,565 INFO L124 PetriNetUnfolderBase]: 1022/2482 cut-off events. [2024-01-27 23:10:12,565 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-01-27 23:10:12,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4276 conditions, 2482 events. 1022/2482 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 16480 event pairs, 855 based on Foata normal form. 0/1596 useless extension candidates. Maximal degree in co-relation 2099. Up to 1688 conditions per place. [2024-01-27 23:10:12,574 INFO L140 encePairwiseOnDemand]: 475/479 looper letters, 61 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2024-01-27 23:10:12,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 397 transitions, 932 flow [2024-01-27 23:10:12,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2024-01-27 23:10:12,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8670842032011135 [2024-01-27 23:10:12,577 INFO L175 Difference]: Start difference. First operand has 399 places, 399 transitions, 810 flow. Second operand 3 states and 1246 transitions. [2024-01-27 23:10:12,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 397 transitions, 932 flow [2024-01-27 23:10:12,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 397 transitions, 930 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:10:12,582 INFO L231 Difference]: Finished difference. Result has 398 places, 397 transitions, 808 flow [2024-01-27 23:10:12,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=808, PETRI_PLACES=398, PETRI_TRANSITIONS=397} [2024-01-27 23:10:12,583 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -80 predicate places. [2024-01-27 23:10:12,583 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 397 transitions, 808 flow [2024-01-27 23:10:12,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 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-27 23:10:12,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:12,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:12,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 23:10:12,584 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:12,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash -325627256, now seen corresponding path program 1 times [2024-01-27 23:10:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:12,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551638183] [2024-01-27 23:10:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:12,601 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-27 23:10:12,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:12,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551638183] [2024-01-27 23:10:12,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551638183] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:12,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:12,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:12,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954381490] [2024-01-27 23:10:12,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:12,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:12,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:12,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:12,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:12,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 479 [2024-01-27 23:10:12,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 397 transitions, 808 flow. Second operand has 3 states, 3 states have (on average 365.6666666666667) internal successors, (1097), 3 states have internal predecessors, (1097), 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-27 23:10:12,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:12,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 479 [2024-01-27 23:10:12,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:13,015 INFO L124 PetriNetUnfolderBase]: 1543/3591 cut-off events. [2024-01-27 23:10:13,016 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2024-01-27 23:10:13,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6314 conditions, 3591 events. 1543/3591 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 26869 event pairs, 633 based on Foata normal form. 2/2397 useless extension candidates. Maximal degree in co-relation 6263. Up to 1545 conditions per place. [2024-01-27 23:10:13,030 INFO L140 encePairwiseOnDemand]: 451/479 looper letters, 102 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2024-01-27 23:10:13,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 407 transitions, 1043 flow [2024-01-27 23:10:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1223 transitions. [2024-01-27 23:10:13,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8510786360473208 [2024-01-27 23:10:13,033 INFO L175 Difference]: Start difference. First operand has 398 places, 397 transitions, 808 flow. Second operand 3 states and 1223 transitions. [2024-01-27 23:10:13,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 407 transitions, 1043 flow [2024-01-27 23:10:13,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 407 transitions, 1039 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:13,038 INFO L231 Difference]: Finished difference. Result has 378 places, 377 transitions, 782 flow [2024-01-27 23:10:13,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=378, PETRI_TRANSITIONS=377} [2024-01-27 23:10:13,039 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -100 predicate places. [2024-01-27 23:10:13,039 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 377 transitions, 782 flow [2024-01-27 23:10:13,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.6666666666667) internal successors, (1097), 3 states have internal predecessors, (1097), 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-27 23:10:13,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:13,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:13,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 23:10:13,040 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:13,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:13,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1504508897, now seen corresponding path program 1 times [2024-01-27 23:10:13,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:13,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92824922] [2024-01-27 23:10:13,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:13,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:13,061 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-27 23:10:13,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:13,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92824922] [2024-01-27 23:10:13,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92824922] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:13,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:13,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:13,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090322595] [2024-01-27 23:10:13,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:13,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:13,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:13,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:13,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:13,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 479 [2024-01-27 23:10:13,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 377 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 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-27 23:10:13,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:13,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 479 [2024-01-27 23:10:13,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:13,581 INFO L124 PetriNetUnfolderBase]: 1543/3592 cut-off events. [2024-01-27 23:10:13,582 INFO L125 PetriNetUnfolderBase]: For 327/337 co-relation queries the response was YES. [2024-01-27 23:10:13,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6639 conditions, 3592 events. 1543/3592 cut-off events. For 327/337 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 26662 event pairs, 1363 based on Foata normal form. 0/2628 useless extension candidates. Maximal degree in co-relation 3095. Up to 2567 conditions per place. [2024-01-27 23:10:13,598 INFO L140 encePairwiseOnDemand]: 456/479 looper letters, 78 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2024-01-27 23:10:13,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 356 transitions, 900 flow [2024-01-27 23:10:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2024-01-27 23:10:13,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8183716075156576 [2024-01-27 23:10:13,601 INFO L175 Difference]: Start difference. First operand has 378 places, 377 transitions, 782 flow. Second operand 3 states and 1176 transitions. [2024-01-27 23:10:13,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 356 transitions, 900 flow [2024-01-27 23:10:13,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 356 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:10:13,606 INFO L231 Difference]: Finished difference. Result has 358 places, 356 transitions, 742 flow [2024-01-27 23:10:13,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=358, PETRI_TRANSITIONS=356} [2024-01-27 23:10:13,607 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -120 predicate places. [2024-01-27 23:10:13,607 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 356 transitions, 742 flow [2024-01-27 23:10:13,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 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-27 23:10:13,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:13,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:13,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 23:10:13,608 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:13,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:13,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1570968431, now seen corresponding path program 1 times [2024-01-27 23:10:13,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:13,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225444838] [2024-01-27 23:10:13,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:13,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:13,626 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-27 23:10:13,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:13,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225444838] [2024-01-27 23:10:13,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225444838] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:13,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:13,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:13,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308575603] [2024-01-27 23:10:13,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:13,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:13,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:13,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:13,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 479 [2024-01-27 23:10:13,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 356 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 352.6666666666667) internal successors, (1058), 3 states have internal predecessors, (1058), 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-27 23:10:13,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:13,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 479 [2024-01-27 23:10:13,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:14,008 INFO L124 PetriNetUnfolderBase]: 1543/3569 cut-off events. [2024-01-27 23:10:14,009 INFO L125 PetriNetUnfolderBase]: For 328/338 co-relation queries the response was YES. [2024-01-27 23:10:14,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6585 conditions, 3569 events. 1543/3569 cut-off events. For 328/338 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 26605 event pairs, 1363 based on Foata normal form. 0/2628 useless extension candidates. Maximal degree in co-relation 6293. Up to 2565 conditions per place. [2024-01-27 23:10:14,024 INFO L140 encePairwiseOnDemand]: 454/479 looper letters, 83 selfloop transitions, 2 changer transitions 0/333 dead transitions. [2024-01-27 23:10:14,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 333 transitions, 866 flow [2024-01-27 23:10:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1162 transitions. [2024-01-27 23:10:14,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8086290883785665 [2024-01-27 23:10:14,027 INFO L175 Difference]: Start difference. First operand has 358 places, 356 transitions, 742 flow. Second operand 3 states and 1162 transitions. [2024-01-27 23:10:14,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 333 transitions, 866 flow [2024-01-27 23:10:14,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 333 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:14,031 INFO L231 Difference]: Finished difference. Result has 335 places, 333 transitions, 696 flow [2024-01-27 23:10:14,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=335, PETRI_TRANSITIONS=333} [2024-01-27 23:10:14,034 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -143 predicate places. [2024-01-27 23:10:14,034 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 333 transitions, 696 flow [2024-01-27 23:10:14,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.6666666666667) internal successors, (1058), 3 states have internal predecessors, (1058), 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-27 23:10:14,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:14,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:14,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 23:10:14,035 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:14,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:14,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1455382410, now seen corresponding path program 1 times [2024-01-27 23:10:14,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:14,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458138560] [2024-01-27 23:10:14,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:14,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:14,067 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-27 23:10:14,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:14,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458138560] [2024-01-27 23:10:14,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458138560] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:14,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:14,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446556361] [2024-01-27 23:10:14,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:14,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:14,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:14,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:14,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 479 [2024-01-27 23:10:14,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 333 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 351.6666666666667) internal successors, (1055), 3 states have internal predecessors, (1055), 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-27 23:10:14,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:14,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 479 [2024-01-27 23:10:14,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:14,502 INFO L124 PetriNetUnfolderBase]: 1543/3545 cut-off events. [2024-01-27 23:10:14,502 INFO L125 PetriNetUnfolderBase]: For 328/338 co-relation queries the response was YES. [2024-01-27 23:10:14,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6561 conditions, 3545 events. 1543/3545 cut-off events. For 328/338 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 26569 event pairs, 1363 based on Foata normal form. 0/2627 useless extension candidates. Maximal degree in co-relation 6275. Up to 2564 conditions per place. [2024-01-27 23:10:14,516 INFO L140 encePairwiseOnDemand]: 453/479 looper letters, 83 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2024-01-27 23:10:14,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 309 transitions, 818 flow [2024-01-27 23:10:14,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2024-01-27 23:10:14,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8072372999304106 [2024-01-27 23:10:14,519 INFO L175 Difference]: Start difference. First operand has 335 places, 333 transitions, 696 flow. Second operand 3 states and 1160 transitions. [2024-01-27 23:10:14,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 309 transitions, 818 flow [2024-01-27 23:10:14,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 309 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:14,524 INFO L231 Difference]: Finished difference. Result has 311 places, 309 transitions, 648 flow [2024-01-27 23:10:14,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=311, PETRI_TRANSITIONS=309} [2024-01-27 23:10:14,525 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -167 predicate places. [2024-01-27 23:10:14,525 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 309 transitions, 648 flow [2024-01-27 23:10:14,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 351.6666666666667) internal successors, (1055), 3 states have internal predecessors, (1055), 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-27 23:10:14,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:14,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:14,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 23:10:14,526 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:14,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:14,526 INFO L85 PathProgramCache]: Analyzing trace with hash -396015443, now seen corresponding path program 1 times [2024-01-27 23:10:14,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:14,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277195750] [2024-01-27 23:10:14,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:14,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:14,578 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-27 23:10:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277195750] [2024-01-27 23:10:14,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277195750] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:14,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:14,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:14,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542313855] [2024-01-27 23:10:14,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:14,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:14,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:14,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:14,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:14,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 479 [2024-01-27 23:10:14,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 309 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 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-27 23:10:14,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:14,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 479 [2024-01-27 23:10:14,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:14,961 INFO L124 PetriNetUnfolderBase]: 1543/3544 cut-off events. [2024-01-27 23:10:14,961 INFO L125 PetriNetUnfolderBase]: For 328/338 co-relation queries the response was YES. [2024-01-27 23:10:14,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6559 conditions, 3544 events. 1543/3544 cut-off events. For 328/338 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 26496 event pairs, 1363 based on Foata normal form. 0/2648 useless extension candidates. Maximal degree in co-relation 6269. Up to 2607 conditions per place. [2024-01-27 23:10:14,972 INFO L140 encePairwiseOnDemand]: 476/479 looper letters, 82 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2024-01-27 23:10:14,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 308 transitions, 814 flow [2024-01-27 23:10:14,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2024-01-27 23:10:14,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8406402226861517 [2024-01-27 23:10:14,975 INFO L175 Difference]: Start difference. First operand has 311 places, 309 transitions, 648 flow. Second operand 3 states and 1208 transitions. [2024-01-27 23:10:14,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 308 transitions, 814 flow [2024-01-27 23:10:14,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 308 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:14,982 INFO L231 Difference]: Finished difference. Result has 310 places, 308 transitions, 646 flow [2024-01-27 23:10:14,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=310, PETRI_TRANSITIONS=308} [2024-01-27 23:10:14,984 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -168 predicate places. [2024-01-27 23:10:14,984 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 308 transitions, 646 flow [2024-01-27 23:10:14,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 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-27 23:10:14,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:14,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:14,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 23:10:14,985 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:14,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:14,986 INFO L85 PathProgramCache]: Analyzing trace with hash 812995856, now seen corresponding path program 1 times [2024-01-27 23:10:14,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:14,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229292556] [2024-01-27 23:10:14,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:14,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:15,040 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-27 23:10:15,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:15,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229292556] [2024-01-27 23:10:15,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229292556] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:15,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:15,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 23:10:15,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231368844] [2024-01-27 23:10:15,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:15,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:15,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:15,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:15,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:15,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 479 [2024-01-27 23:10:15,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 308 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-27 23:10:15,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:15,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 479 [2024-01-27 23:10:15,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:15,420 INFO L124 PetriNetUnfolderBase]: 1617/3686 cut-off events. [2024-01-27 23:10:15,420 INFO L125 PetriNetUnfolderBase]: For 336/346 co-relation queries the response was YES. [2024-01-27 23:10:15,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6807 conditions, 3686 events. 1617/3686 cut-off events. For 336/346 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 28076 event pairs, 679 based on Foata normal form. 24/2802 useless extension candidates. Maximal degree in co-relation 6780. Up to 1406 conditions per place. [2024-01-27 23:10:15,433 INFO L140 encePairwiseOnDemand]: 452/479 looper letters, 84 selfloop transitions, 2 changer transitions 1/309 dead transitions. [2024-01-27 23:10:15,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 309 transitions, 834 flow [2024-01-27 23:10:15,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1232 transitions. [2024-01-27 23:10:15,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8573416840640222 [2024-01-27 23:10:15,436 INFO L175 Difference]: Start difference. First operand has 310 places, 308 transitions, 646 flow. Second operand 3 states and 1232 transitions. [2024-01-27 23:10:15,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 309 transitions, 834 flow [2024-01-27 23:10:15,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 309 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:15,440 INFO L231 Difference]: Finished difference. Result has 287 places, 285 transitions, 606 flow [2024-01-27 23:10:15,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=287, PETRI_TRANSITIONS=285} [2024-01-27 23:10:15,440 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -191 predicate places. [2024-01-27 23:10:15,441 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 285 transitions, 606 flow [2024-01-27 23:10:15,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-27 23:10:15,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:15,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:15,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 23:10:15,442 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:15,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:15,442 INFO L85 PathProgramCache]: Analyzing trace with hash -937016489, now seen corresponding path program 1 times [2024-01-27 23:10:15,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:15,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548637037] [2024-01-27 23:10:15,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:15,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:15,473 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-27 23:10:15,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:15,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548637037] [2024-01-27 23:10:15,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548637037] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:15,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:15,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973071284] [2024-01-27 23:10:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:15,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:15,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:15,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:15,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:15,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 479 [2024-01-27 23:10:15,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 285 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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-27 23:10:15,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:15,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 479 [2024-01-27 23:10:15,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:15,855 INFO L124 PetriNetUnfolderBase]: 1617/3685 cut-off events. [2024-01-27 23:10:15,855 INFO L125 PetriNetUnfolderBase]: For 383/393 co-relation queries the response was YES. [2024-01-27 23:10:15,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6957 conditions, 3685 events. 1617/3685 cut-off events. For 383/393 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 28046 event pairs, 1431 based on Foata normal form. 0/2776 useless extension candidates. Maximal degree in co-relation 3301. Up to 2701 conditions per place. [2024-01-27 23:10:15,866 INFO L140 encePairwiseOnDemand]: 476/479 looper letters, 66 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2024-01-27 23:10:15,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 284 transitions, 740 flow [2024-01-27 23:10:15,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions. [2024-01-27 23:10:15,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8559498956158664 [2024-01-27 23:10:15,868 INFO L175 Difference]: Start difference. First operand has 287 places, 285 transitions, 606 flow. Second operand 3 states and 1230 transitions. [2024-01-27 23:10:15,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 284 transitions, 740 flow [2024-01-27 23:10:15,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 738 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:10:15,872 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 606 flow [2024-01-27 23:10:15,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=287, PETRI_TRANSITIONS=284} [2024-01-27 23:10:15,873 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -191 predicate places. [2024-01-27 23:10:15,873 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 606 flow [2024-01-27 23:10:15,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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-27 23:10:15,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:15,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:15,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 23:10:15,874 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:15,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:15,874 INFO L85 PathProgramCache]: Analyzing trace with hash -644775469, now seen corresponding path program 1 times [2024-01-27 23:10:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:15,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176855467] [2024-01-27 23:10:15,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:15,906 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-27 23:10:15,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:15,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176855467] [2024-01-27 23:10:15,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176855467] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:15,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:15,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 23:10:15,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713562966] [2024-01-27 23:10:15,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:15,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:15,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:15,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:15,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:15,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 479 [2024-01-27 23:10:15,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 284 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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-27 23:10:15,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:15,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 479 [2024-01-27 23:10:15,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:16,267 INFO L124 PetriNetUnfolderBase]: 1617/3677 cut-off events. [2024-01-27 23:10:16,267 INFO L125 PetriNetUnfolderBase]: For 382/392 co-relation queries the response was YES. [2024-01-27 23:10:16,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6906 conditions, 3677 events. 1617/3677 cut-off events. For 382/392 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 28021 event pairs, 1431 based on Foata normal form. 4/2780 useless extension candidates. Maximal degree in co-relation 6823. Up to 2706 conditions per place. [2024-01-27 23:10:16,279 INFO L140 encePairwiseOnDemand]: 463/479 looper letters, 63 selfloop transitions, 8 changer transitions 0/276 dead transitions. [2024-01-27 23:10:16,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 276 transitions, 732 flow [2024-01-27 23:10:16,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2024-01-27 23:10:16,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8503827418232429 [2024-01-27 23:10:16,281 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 606 flow. Second operand 3 states and 1222 transitions. [2024-01-27 23:10:16,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 276 transitions, 732 flow [2024-01-27 23:10:16,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 276 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:16,285 INFO L231 Difference]: Finished difference. Result has 279 places, 276 transitions, 602 flow [2024-01-27 23:10:16,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=279, PETRI_TRANSITIONS=276} [2024-01-27 23:10:16,286 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -199 predicate places. [2024-01-27 23:10:16,286 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 276 transitions, 602 flow [2024-01-27 23:10:16,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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-27 23:10:16,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:16,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:16,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 23:10:16,287 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:16,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:16,287 INFO L85 PathProgramCache]: Analyzing trace with hash 677458412, now seen corresponding path program 1 times [2024-01-27 23:10:16,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:16,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47890120] [2024-01-27 23:10:16,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:16,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:16,371 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-27 23:10:16,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:16,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47890120] [2024-01-27 23:10:16,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47890120] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:16,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:16,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:10:16,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320518806] [2024-01-27 23:10:16,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:16,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:10:16,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:16,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:10:16,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:10:16,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 479 [2024-01-27 23:10:16,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 276 transitions, 602 flow. Second operand has 4 states, 4 states have (on average 375.25) internal successors, (1501), 4 states have internal predecessors, (1501), 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-27 23:10:16,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:16,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 479 [2024-01-27 23:10:16,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:16,827 INFO L124 PetriNetUnfolderBase]: 1617/3671 cut-off events. [2024-01-27 23:10:16,828 INFO L125 PetriNetUnfolderBase]: For 385/395 co-relation queries the response was YES. [2024-01-27 23:10:16,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6910 conditions, 3671 events. 1617/3671 cut-off events. For 385/395 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 28058 event pairs, 1431 based on Foata normal form. 4/2780 useless extension candidates. Maximal degree in co-relation 6686. Up to 2706 conditions per place. [2024-01-27 23:10:16,841 INFO L140 encePairwiseOnDemand]: 463/479 looper letters, 65 selfloop transitions, 10 changer transitions 0/270 dead transitions. [2024-01-27 23:10:16,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 270 transitions, 740 flow [2024-01-27 23:10:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:10:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:10:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1566 transitions. [2024-01-27 23:10:16,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8173277661795407 [2024-01-27 23:10:16,844 INFO L175 Difference]: Start difference. First operand has 279 places, 276 transitions, 602 flow. Second operand 4 states and 1566 transitions. [2024-01-27 23:10:16,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 270 transitions, 740 flow [2024-01-27 23:10:16,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 270 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:16,848 INFO L231 Difference]: Finished difference. Result has 274 places, 270 transitions, 594 flow [2024-01-27 23:10:16,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=594, PETRI_PLACES=274, PETRI_TRANSITIONS=270} [2024-01-27 23:10:16,848 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -204 predicate places. [2024-01-27 23:10:16,849 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 270 transitions, 594 flow [2024-01-27 23:10:16,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 375.25) internal successors, (1501), 4 states have internal predecessors, (1501), 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-27 23:10:16,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:16,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:16,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 23:10:16,850 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:16,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:16,850 INFO L85 PathProgramCache]: Analyzing trace with hash -473617349, now seen corresponding path program 1 times [2024-01-27 23:10:16,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:16,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395588973] [2024-01-27 23:10:16,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:16,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:16,929 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-27 23:10:16,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:16,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395588973] [2024-01-27 23:10:16,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395588973] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:16,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:16,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:10:16,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727798793] [2024-01-27 23:10:16,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:16,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 23:10:16,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:16,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 23:10:16,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-27 23:10:17,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 479 [2024-01-27 23:10:17,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 270 transitions, 594 flow. Second operand has 5 states, 5 states have (on average 337.4) internal successors, (1687), 5 states have internal predecessors, (1687), 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-27 23:10:17,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:17,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 479 [2024-01-27 23:10:17,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:17,441 INFO L124 PetriNetUnfolderBase]: 1617/3641 cut-off events. [2024-01-27 23:10:17,441 INFO L125 PetriNetUnfolderBase]: For 390/402 co-relation queries the response was YES. [2024-01-27 23:10:17,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6898 conditions, 3641 events. 1617/3641 cut-off events. For 390/402 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 28114 event pairs, 663 based on Foata normal form. 3/2765 useless extension candidates. Maximal degree in co-relation 6659. Up to 1612 conditions per place. [2024-01-27 23:10:17,456 INFO L140 encePairwiseOnDemand]: 465/479 looper letters, 110 selfloop transitions, 12 changer transitions 0/299 dead transitions. [2024-01-27 23:10:17,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 299 transitions, 909 flow [2024-01-27 23:10:17,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 23:10:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 23:10:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1785 transitions. [2024-01-27 23:10:17,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7453027139874739 [2024-01-27 23:10:17,460 INFO L175 Difference]: Start difference. First operand has 274 places, 270 transitions, 594 flow. Second operand 5 states and 1785 transitions. [2024-01-27 23:10:17,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 299 transitions, 909 flow [2024-01-27 23:10:17,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 299 transitions, 889 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 23:10:17,464 INFO L231 Difference]: Finished difference. Result has 273 places, 268 transitions, 594 flow [2024-01-27 23:10:17,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=594, PETRI_PLACES=273, PETRI_TRANSITIONS=268} [2024-01-27 23:10:17,465 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -205 predicate places. [2024-01-27 23:10:17,466 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 268 transitions, 594 flow [2024-01-27 23:10:17,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 337.4) internal successors, (1687), 5 states have internal predecessors, (1687), 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-27 23:10:17,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:17,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:17,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-27 23:10:17,467 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:17,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2036092288, now seen corresponding path program 1 times [2024-01-27 23:10:17,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:17,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824986327] [2024-01-27 23:10:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:17,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:10:17,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 23:10:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:10:17,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 23:10:17,541 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 23:10:17,543 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT (291 of 292 remaining) [2024-01-27 23:10:17,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (290 of 292 remaining) [2024-01-27 23:10:17,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (289 of 292 remaining) [2024-01-27 23:10:17,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (288 of 292 remaining) [2024-01-27 23:10:17,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (287 of 292 remaining) [2024-01-27 23:10:17,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (286 of 292 remaining) [2024-01-27 23:10:17,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (285 of 292 remaining) [2024-01-27 23:10:17,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (284 of 292 remaining) [2024-01-27 23:10:17,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (283 of 292 remaining) [2024-01-27 23:10:17,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (282 of 292 remaining) [2024-01-27 23:10:17,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (281 of 292 remaining) [2024-01-27 23:10:17,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (280 of 292 remaining) [2024-01-27 23:10:17,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (279 of 292 remaining) [2024-01-27 23:10:17,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (278 of 292 remaining) [2024-01-27 23:10:17,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (277 of 292 remaining) [2024-01-27 23:10:17,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (276 of 292 remaining) [2024-01-27 23:10:17,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (275 of 292 remaining) [2024-01-27 23:10:17,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (274 of 292 remaining) [2024-01-27 23:10:17,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (273 of 292 remaining) [2024-01-27 23:10:17,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (272 of 292 remaining) [2024-01-27 23:10:17,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (271 of 292 remaining) [2024-01-27 23:10:17,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (270 of 292 remaining) [2024-01-27 23:10:17,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (269 of 292 remaining) [2024-01-27 23:10:17,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (268 of 292 remaining) [2024-01-27 23:10:17,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (267 of 292 remaining) [2024-01-27 23:10:17,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (266 of 292 remaining) [2024-01-27 23:10:17,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (265 of 292 remaining) [2024-01-27 23:10:17,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (264 of 292 remaining) [2024-01-27 23:10:17,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (263 of 292 remaining) [2024-01-27 23:10:17,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (262 of 292 remaining) [2024-01-27 23:10:17,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (261 of 292 remaining) [2024-01-27 23:10:17,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (260 of 292 remaining) [2024-01-27 23:10:17,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (259 of 292 remaining) [2024-01-27 23:10:17,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (258 of 292 remaining) [2024-01-27 23:10:17,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (257 of 292 remaining) [2024-01-27 23:10:17,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (256 of 292 remaining) [2024-01-27 23:10:17,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (255 of 292 remaining) [2024-01-27 23:10:17,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (254 of 292 remaining) [2024-01-27 23:10:17,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (253 of 292 remaining) [2024-01-27 23:10:17,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (252 of 292 remaining) [2024-01-27 23:10:17,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (251 of 292 remaining) [2024-01-27 23:10:17,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (250 of 292 remaining) [2024-01-27 23:10:17,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (249 of 292 remaining) [2024-01-27 23:10:17,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (248 of 292 remaining) [2024-01-27 23:10:17,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (247 of 292 remaining) [2024-01-27 23:10:17,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (246 of 292 remaining) [2024-01-27 23:10:17,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (245 of 292 remaining) [2024-01-27 23:10:17,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (244 of 292 remaining) [2024-01-27 23:10:17,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (243 of 292 remaining) [2024-01-27 23:10:17,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (242 of 292 remaining) [2024-01-27 23:10:17,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (241 of 292 remaining) [2024-01-27 23:10:17,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (240 of 292 remaining) [2024-01-27 23:10:17,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (239 of 292 remaining) [2024-01-27 23:10:17,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (238 of 292 remaining) [2024-01-27 23:10:17,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (237 of 292 remaining) [2024-01-27 23:10:17,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (236 of 292 remaining) [2024-01-27 23:10:17,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (235 of 292 remaining) [2024-01-27 23:10:17,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (234 of 292 remaining) [2024-01-27 23:10:17,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (233 of 292 remaining) [2024-01-27 23:10:17,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (232 of 292 remaining) [2024-01-27 23:10:17,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (231 of 292 remaining) [2024-01-27 23:10:17,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (230 of 292 remaining) [2024-01-27 23:10:17,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (229 of 292 remaining) [2024-01-27 23:10:17,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (228 of 292 remaining) [2024-01-27 23:10:17,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (227 of 292 remaining) [2024-01-27 23:10:17,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (226 of 292 remaining) [2024-01-27 23:10:17,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (225 of 292 remaining) [2024-01-27 23:10:17,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (224 of 292 remaining) [2024-01-27 23:10:17,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (223 of 292 remaining) [2024-01-27 23:10:17,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (222 of 292 remaining) [2024-01-27 23:10:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (221 of 292 remaining) [2024-01-27 23:10:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (220 of 292 remaining) [2024-01-27 23:10:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (219 of 292 remaining) [2024-01-27 23:10:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (218 of 292 remaining) [2024-01-27 23:10:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (217 of 292 remaining) [2024-01-27 23:10:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (216 of 292 remaining) [2024-01-27 23:10:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (215 of 292 remaining) [2024-01-27 23:10:17,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (214 of 292 remaining) [2024-01-27 23:10:17,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (213 of 292 remaining) [2024-01-27 23:10:17,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (212 of 292 remaining) [2024-01-27 23:10:17,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (211 of 292 remaining) [2024-01-27 23:10:17,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (210 of 292 remaining) [2024-01-27 23:10:17,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (209 of 292 remaining) [2024-01-27 23:10:17,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (208 of 292 remaining) [2024-01-27 23:10:17,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (207 of 292 remaining) [2024-01-27 23:10:17,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (206 of 292 remaining) [2024-01-27 23:10:17,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (205 of 292 remaining) [2024-01-27 23:10:17,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (204 of 292 remaining) [2024-01-27 23:10:17,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (203 of 292 remaining) [2024-01-27 23:10:17,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (202 of 292 remaining) [2024-01-27 23:10:17,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (201 of 292 remaining) [2024-01-27 23:10:17,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (200 of 292 remaining) [2024-01-27 23:10:17,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 292 remaining) [2024-01-27 23:10:17,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 292 remaining) [2024-01-27 23:10:17,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 292 remaining) [2024-01-27 23:10:17,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 292 remaining) [2024-01-27 23:10:17,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 292 remaining) [2024-01-27 23:10:17,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 292 remaining) [2024-01-27 23:10:17,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 292 remaining) [2024-01-27 23:10:17,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 292 remaining) [2024-01-27 23:10:17,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 292 remaining) [2024-01-27 23:10:17,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 292 remaining) [2024-01-27 23:10:17,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 292 remaining) [2024-01-27 23:10:17,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 292 remaining) [2024-01-27 23:10:17,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 292 remaining) [2024-01-27 23:10:17,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 292 remaining) [2024-01-27 23:10:17,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 292 remaining) [2024-01-27 23:10:17,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 292 remaining) [2024-01-27 23:10:17,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 292 remaining) [2024-01-27 23:10:17,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 292 remaining) [2024-01-27 23:10:17,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 292 remaining) [2024-01-27 23:10:17,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 292 remaining) [2024-01-27 23:10:17,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 292 remaining) [2024-01-27 23:10:17,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 292 remaining) [2024-01-27 23:10:17,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 292 remaining) [2024-01-27 23:10:17,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 292 remaining) [2024-01-27 23:10:17,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 292 remaining) [2024-01-27 23:10:17,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 292 remaining) [2024-01-27 23:10:17,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 292 remaining) [2024-01-27 23:10:17,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 292 remaining) [2024-01-27 23:10:17,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 292 remaining) [2024-01-27 23:10:17,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 292 remaining) [2024-01-27 23:10:17,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 292 remaining) [2024-01-27 23:10:17,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 292 remaining) [2024-01-27 23:10:17,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 292 remaining) [2024-01-27 23:10:17,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 292 remaining) [2024-01-27 23:10:17,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 292 remaining) [2024-01-27 23:10:17,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 292 remaining) [2024-01-27 23:10:17,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 292 remaining) [2024-01-27 23:10:17,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 292 remaining) [2024-01-27 23:10:17,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 292 remaining) [2024-01-27 23:10:17,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 292 remaining) [2024-01-27 23:10:17,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 292 remaining) [2024-01-27 23:10:17,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 292 remaining) [2024-01-27 23:10:17,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 292 remaining) [2024-01-27 23:10:17,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 292 remaining) [2024-01-27 23:10:17,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 292 remaining) [2024-01-27 23:10:17,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 292 remaining) [2024-01-27 23:10:17,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 292 remaining) [2024-01-27 23:10:17,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 292 remaining) [2024-01-27 23:10:17,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 292 remaining) [2024-01-27 23:10:17,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 292 remaining) [2024-01-27 23:10:17,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 292 remaining) [2024-01-27 23:10:17,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 292 remaining) [2024-01-27 23:10:17,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 292 remaining) [2024-01-27 23:10:17,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 292 remaining) [2024-01-27 23:10:17,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 292 remaining) [2024-01-27 23:10:17,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 292 remaining) [2024-01-27 23:10:17,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 292 remaining) [2024-01-27 23:10:17,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 292 remaining) [2024-01-27 23:10:17,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 292 remaining) [2024-01-27 23:10:17,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 292 remaining) [2024-01-27 23:10:17,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 292 remaining) [2024-01-27 23:10:17,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 292 remaining) [2024-01-27 23:10:17,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 292 remaining) [2024-01-27 23:10:17,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 292 remaining) [2024-01-27 23:10:17,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 292 remaining) [2024-01-27 23:10:17,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 292 remaining) [2024-01-27 23:10:17,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 292 remaining) [2024-01-27 23:10:17,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 292 remaining) [2024-01-27 23:10:17,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 292 remaining) [2024-01-27 23:10:17,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 292 remaining) [2024-01-27 23:10:17,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 292 remaining) [2024-01-27 23:10:17,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 292 remaining) [2024-01-27 23:10:17,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 292 remaining) [2024-01-27 23:10:17,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 292 remaining) [2024-01-27 23:10:17,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 292 remaining) [2024-01-27 23:10:17,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 292 remaining) [2024-01-27 23:10:17,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 292 remaining) [2024-01-27 23:10:17,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 292 remaining) [2024-01-27 23:10:17,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 292 remaining) [2024-01-27 23:10:17,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 292 remaining) [2024-01-27 23:10:17,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 292 remaining) [2024-01-27 23:10:17,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 292 remaining) [2024-01-27 23:10:17,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 292 remaining) [2024-01-27 23:10:17,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 292 remaining) [2024-01-27 23:10:17,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 292 remaining) [2024-01-27 23:10:17,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 292 remaining) [2024-01-27 23:10:17,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 292 remaining) [2024-01-27 23:10:17,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 292 remaining) [2024-01-27 23:10:17,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 292 remaining) [2024-01-27 23:10:17,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 292 remaining) [2024-01-27 23:10:17,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 292 remaining) [2024-01-27 23:10:17,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 292 remaining) [2024-01-27 23:10:17,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 292 remaining) [2024-01-27 23:10:17,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 292 remaining) [2024-01-27 23:10:17,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 292 remaining) [2024-01-27 23:10:17,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 292 remaining) [2024-01-27 23:10:17,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 292 remaining) [2024-01-27 23:10:17,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 292 remaining) [2024-01-27 23:10:17,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 292 remaining) [2024-01-27 23:10:17,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 292 remaining) [2024-01-27 23:10:17,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 292 remaining) [2024-01-27 23:10:17,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 292 remaining) [2024-01-27 23:10:17,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 292 remaining) [2024-01-27 23:10:17,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 292 remaining) [2024-01-27 23:10:17,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 292 remaining) [2024-01-27 23:10:17,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 292 remaining) [2024-01-27 23:10:17,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 292 remaining) [2024-01-27 23:10:17,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 292 remaining) [2024-01-27 23:10:17,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 292 remaining) [2024-01-27 23:10:17,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 292 remaining) [2024-01-27 23:10:17,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 292 remaining) [2024-01-27 23:10:17,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 292 remaining) [2024-01-27 23:10:17,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 292 remaining) [2024-01-27 23:10:17,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 292 remaining) [2024-01-27 23:10:17,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 292 remaining) [2024-01-27 23:10:17,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 292 remaining) [2024-01-27 23:10:17,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 292 remaining) [2024-01-27 23:10:17,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 292 remaining) [2024-01-27 23:10:17,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 292 remaining) [2024-01-27 23:10:17,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 292 remaining) [2024-01-27 23:10:17,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 292 remaining) [2024-01-27 23:10:17,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 292 remaining) [2024-01-27 23:10:17,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 292 remaining) [2024-01-27 23:10:17,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 292 remaining) [2024-01-27 23:10:17,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 292 remaining) [2024-01-27 23:10:17,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 292 remaining) [2024-01-27 23:10:17,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 292 remaining) [2024-01-27 23:10:17,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 292 remaining) [2024-01-27 23:10:17,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 292 remaining) [2024-01-27 23:10:17,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 292 remaining) [2024-01-27 23:10:17,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 292 remaining) [2024-01-27 23:10:17,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 292 remaining) [2024-01-27 23:10:17,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 292 remaining) [2024-01-27 23:10:17,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 292 remaining) [2024-01-27 23:10:17,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 292 remaining) [2024-01-27 23:10:17,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 292 remaining) [2024-01-27 23:10:17,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 292 remaining) [2024-01-27 23:10:17,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 292 remaining) [2024-01-27 23:10:17,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 292 remaining) [2024-01-27 23:10:17,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 292 remaining) [2024-01-27 23:10:17,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 292 remaining) [2024-01-27 23:10:17,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 292 remaining) [2024-01-27 23:10:17,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 292 remaining) [2024-01-27 23:10:17,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 292 remaining) [2024-01-27 23:10:17,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 292 remaining) [2024-01-27 23:10:17,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 292 remaining) [2024-01-27 23:10:17,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 292 remaining) [2024-01-27 23:10:17,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 292 remaining) [2024-01-27 23:10:17,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 292 remaining) [2024-01-27 23:10:17,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193ASSERT_VIOLATIONERROR_FUNCTION (50 of 292 remaining) [2024-01-27 23:10:17,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 292 remaining) [2024-01-27 23:10:17,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 292 remaining) [2024-01-27 23:10:17,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 292 remaining) [2024-01-27 23:10:17,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 292 remaining) [2024-01-27 23:10:17,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 292 remaining) [2024-01-27 23:10:17,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 292 remaining) [2024-01-27 23:10:17,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 292 remaining) [2024-01-27 23:10:17,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 292 remaining) [2024-01-27 23:10:17,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 292 remaining) [2024-01-27 23:10:17,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 292 remaining) [2024-01-27 23:10:17,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 292 remaining) [2024-01-27 23:10:17,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 292 remaining) [2024-01-27 23:10:17,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 292 remaining) [2024-01-27 23:10:17,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 292 remaining) [2024-01-27 23:10:17,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 292 remaining) [2024-01-27 23:10:17,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 292 remaining) [2024-01-27 23:10:17,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 292 remaining) [2024-01-27 23:10:17,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 292 remaining) [2024-01-27 23:10:17,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 292 remaining) [2024-01-27 23:10:17,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 292 remaining) [2024-01-27 23:10:17,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 292 remaining) [2024-01-27 23:10:17,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 292 remaining) [2024-01-27 23:10:17,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 292 remaining) [2024-01-27 23:10:17,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 292 remaining) [2024-01-27 23:10:17,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 292 remaining) [2024-01-27 23:10:17,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 292 remaining) [2024-01-27 23:10:17,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 292 remaining) [2024-01-27 23:10:17,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 292 remaining) [2024-01-27 23:10:17,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 292 remaining) [2024-01-27 23:10:17,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 292 remaining) [2024-01-27 23:10:17,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 292 remaining) [2024-01-27 23:10:17,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 292 remaining) [2024-01-27 23:10:17,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 292 remaining) [2024-01-27 23:10:17,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 292 remaining) [2024-01-27 23:10:17,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 292 remaining) [2024-01-27 23:10:17,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 292 remaining) [2024-01-27 23:10:17,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 292 remaining) [2024-01-27 23:10:17,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 292 remaining) [2024-01-27 23:10:17,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 292 remaining) [2024-01-27 23:10:17,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 292 remaining) [2024-01-27 23:10:17,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 292 remaining) [2024-01-27 23:10:17,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 292 remaining) [2024-01-27 23:10:17,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 292 remaining) [2024-01-27 23:10:17,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 292 remaining) [2024-01-27 23:10:17,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 292 remaining) [2024-01-27 23:10:17,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 292 remaining) [2024-01-27 23:10:17,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 292 remaining) [2024-01-27 23:10:17,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 292 remaining) [2024-01-27 23:10:17,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 292 remaining) [2024-01-27 23:10:17,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 292 remaining) [2024-01-27 23:10:17,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-27 23:10:17,590 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:17,601 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 23:10:17,601 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 23:10:17,703 INFO L503 ceAbstractionStarter]: Automizer considered 241 witness invariants [2024-01-27 23:10:17,704 INFO L504 ceAbstractionStarter]: WitnessConsidered=241 [2024-01-27 23:10:17,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:10:17 BasicIcfg [2024-01-27 23:10:17,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 23:10:17,706 INFO L158 Benchmark]: Toolchain (without parser) took 9469.06ms. Allocated memory was 163.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 119.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 630.5MB. Max. memory is 16.1GB. [2024-01-27 23:10:17,706 INFO L158 Benchmark]: Witness Parser took 0.09ms. Allocated memory is still 113.2MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:10:17,707 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:10:17,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.05ms. Allocated memory is still 163.6MB. Free memory was 119.6MB in the beginning and 88.8MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-01-27 23:10:17,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.86ms. Allocated memory is still 163.6MB. Free memory was 88.2MB in the beginning and 84.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 23:10:17,708 INFO L158 Benchmark]: Boogie Preprocessor took 99.83ms. Allocated memory is still 163.6MB. Free memory was 84.6MB in the beginning and 81.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 23:10:17,708 INFO L158 Benchmark]: RCFGBuilder took 1068.08ms. Allocated memory is still 163.6MB. Free memory was 81.2MB in the beginning and 103.6MB in the end (delta: -22.4MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2024-01-27 23:10:17,708 INFO L158 Benchmark]: TraceAbstraction took 7835.67ms. Allocated memory was 163.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 103.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 615.3MB. Max. memory is 16.1GB. [2024-01-27 23:10:17,709 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.09ms. Allocated memory is still 113.2MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.05ms. Allocated memory is still 163.6MB. Free memory was 119.6MB in the beginning and 88.8MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.86ms. Allocated memory is still 163.6MB. Free memory was 88.2MB in the beginning and 84.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.83ms. Allocated memory is still 163.6MB. Free memory was 84.6MB in the beginning and 81.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1068.08ms. Allocated memory is still 163.6MB. Free memory was 81.2MB in the beginning and 103.6MB in the end (delta: -22.4MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7835.67ms. Allocated memory was 163.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 103.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 615.3MB. 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={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[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={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[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={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] [L89] N = __VERIFIER_nondet_int() [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[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={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]] [L90] n = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L91] start = __VERIFIER_nondet_int() [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] [L92] end = start VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] [L93] CALL create_fresh_int_array(n) [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L113] CALL assume_abort_if_not(size >= 0) [L38] COND FALSE !(!cond) [L113] RET assume_abort_if_not(size >= 0) [L114] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[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[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] [L116] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L117] int i = 0; VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[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)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] COND TRUE i < size VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[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]]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]]] [L118] arr[i] = __VERIFIER_nondet_int() [L117] i++ VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, 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: 51]: 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: 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: 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: 54]: 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: 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: 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: 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: 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: 71]: 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: 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: 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: 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: 74]: 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: 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: 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: 88]: 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: 88]: 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: 88]: 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: 88]: 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: 88]: 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: 88]: 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: 88]: 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: 89]: 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: 89]: 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: 89]: 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: 89]: 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: 89]: 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: 89]: 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: 89]: 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: 90]: 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: 90]: 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: 90]: 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: 90]: 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: 90]: 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: 90]: 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: 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: 91]: 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: 91]: 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: 91]: 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: 91]: 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: 91]: 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: 91]: 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: 92]: 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: 92]: 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: 92]: 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: 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: 93]: 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: 93]: 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: 93]: 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: 113]: 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: 113]: 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: 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: 114]: 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: 114]: 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: 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: 116]: 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: 116]: 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: 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: 117]: 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: 117]: 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: 117]: 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: 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: 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: 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: 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: 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: 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: 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: 118]: 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: 94]: 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: 94]: 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: 94]: 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: 94]: 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: 94]: 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: 113]: 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: 113]: 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: 113]: 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: 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: 114]: 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: 114]: 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: 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: 116]: 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: 116]: 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: 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: 117]: 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: 117]: 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: 117]: 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: 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: 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: 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: 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: 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: 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: 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: 118]: 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: 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: 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: 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: 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: 117]: 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: 117]: 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: 117]: 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: 97]: 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: 98]: 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: 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: 101]: 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, 552 locations, 292 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: 7.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1458 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 755 mSDsluCounter, 119 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 429 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2482 IncrementalHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 429 mSolverCounterUnsat, 103 mSDtfsCounter, 2482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=964occurred in iteration=0, InterpolantAutomatonStates: 48, 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, 0.5s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 448 ConstructedInterpolants, 0 QuantifiedInterpolants, 1174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-27 23:10:17,771 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