./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-inc-subseq.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ab2e0ac4 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-inc-subseq.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-ab2e0ac-m [2024-01-29 14:19:46,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 14:19:46,477 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 14:19:46,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 14:19:46,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 14:19:46,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 14:19:46,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 14:19:46,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 14:19:46,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 14:19:46,509 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 14:19:46,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 14:19:46,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 14:19:46,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 14:19:46,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 14:19:46,510 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 14:19:46,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 14:19:46,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 14:19:46,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 14:19:46,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 14:19:46,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 14:19:46,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 14:19:46,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 14:19:46,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 14:19:46,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 14:19:46,513 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 14:19:46,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 14:19:46,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 14:19:46,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 14:19:46,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 14:19:46,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 14:19:46,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 14:19:46,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 14:19:46,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:19:46,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 14:19:46,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 14:19:46,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 14:19:46,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 14:19:46,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 14:19:46,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 14:19:46,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 14:19:46,517 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 14:19:46,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 14:19:46,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 14:19:46,518 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-29 14:19:46,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 14:19:46,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 14:19:46,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 14:19:46,728 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 14:19:46,728 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 14:19:46,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-01-29 14:19:47,988 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 14:19:48,133 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 14:19:48,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-01-29 14:19:48,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e505a889f/4925f679b98c432dba41288cbf576816/FLAG8795a3fd4 [2024-01-29 14:19:48,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e505a889f/4925f679b98c432dba41288cbf576816 [2024-01-29 14:19:48,154 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 14:19:48,155 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 14:19:48,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-inc-subseq.wvr.yml/witness.yml [2024-01-29 14:19:48,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 14:19:48,322 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 14:19:48,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 14:19:48,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 14:19:48,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 14:19:48,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:19:48" (1/2) ... [2024-01-29 14:19:48,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245e8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48, skipping insertion in model container [2024-01-29 14:19:48,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:19:48" (1/2) ... [2024-01-29 14:19:48,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@399885c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48, skipping insertion in model container [2024-01-29 14:19:48,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:19:48" (2/2) ... [2024-01-29 14:19:48,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245e8b9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48, skipping insertion in model container [2024-01-29 14:19:48,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:19:48" (2/2) ... [2024-01-29 14:19:48,333 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 14:19:48,379 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 14:19:48,381 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] 0 <= i [2024-01-29 14:19:48,381 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] 0 <= end [2024-01-29 14:19:48,381 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,381 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] 0 <= i [2024-01-29 14:19:48,381 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,382 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] 0 <= i [2024-01-29 14:19:48,382 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] -2147483647 <= end [2024-01-29 14:19:48,382 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,382 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] last == 0 [2024-01-29 14:19:48,382 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] i == 0 [2024-01-29 14:19:48,383 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] v_old == 0 [2024-01-29 14:19:48,383 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] (long long )i - (long long )size >= 0LL [2024-01-29 14:19:48,383 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] ok == (_Bool)1 [2024-01-29 14:19:48,383 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] A == 0 [2024-01-29 14:19:48,383 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] new == 0 [2024-01-29 14:19:48,383 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] 0 <= i [2024-01-29 14:19:48,383 INFO L98 nessWitnessExtractor]: Loop invariant at [L48-L60] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,384 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,384 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,384 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] 1 <= i [2024-01-29 14:19:48,384 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] 0 <= i [2024-01-29 14:19:48,385 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,385 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] new == 0 [2024-01-29 14:19:48,385 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] A == 0 [2024-01-29 14:19:48,385 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (long long )end - (long long )start >= 0LL [2024-01-29 14:19:48,385 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (long long )end + (long long )start >= 0LL [2024-01-29 14:19:48,385 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ok == (_Bool)1 [2024-01-29 14:19:48,386 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] v_old == 0 [2024-01-29 14:19:48,386 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-29 14:19:48,386 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-29 14:19:48,386 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] queue == 0 [2024-01-29 14:19:48,386 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] end == 0 [2024-01-29 14:19:48,386 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] n == 0 [2024-01-29 14:19:48,386 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] i == 0 [2024-01-29 14:19:48,386 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] start == 0 [2024-01-29 14:19:48,387 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] last == 0 [2024-01-29 14:19:48,387 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,387 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] A == 0 [2024-01-29 14:19:48,388 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (long long )end + (long long )start >= 0LL [2024-01-29 14:19:48,388 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-29 14:19:48,389 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ok == (_Bool)1 [2024-01-29 14:19:48,389 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] v_old == 0 [2024-01-29 14:19:48,389 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] end == 0 [2024-01-29 14:19:48,389 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (long long )end - (long long )start >= 0LL [2024-01-29 14:19:48,389 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] start == 0 [2024-01-29 14:19:48,389 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] queue == 0 [2024-01-29 14:19:48,390 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-29 14:19:48,390 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] last == 0 [2024-01-29 14:19:48,390 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] i == 0 [2024-01-29 14:19:48,390 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] new == 0 [2024-01-29 14:19:48,390 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] last == 0 [2024-01-29 14:19:48,390 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] i == 0 [2024-01-29 14:19:48,391 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] new == 0 [2024-01-29 14:19:48,391 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] ok == (_Bool)1 [2024-01-29 14:19:48,391 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] last == 0 [2024-01-29 14:19:48,392 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] A == 0 [2024-01-29 14:19:48,392 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] i == 0 [2024-01-29 14:19:48,392 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] v_old == 0 [2024-01-29 14:19:48,392 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] new == 0 [2024-01-29 14:19:48,393 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] ok == (_Bool)1 [2024-01-29 14:19:48,393 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,393 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] 0 <= i [2024-01-29 14:19:48,393 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,393 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] A == 0 [2024-01-29 14:19:48,393 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] i == 0 [2024-01-29 14:19:48,393 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] new == 0 [2024-01-29 14:19:48,393 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ok == (_Bool)1 [2024-01-29 14:19:48,394 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] last == 0 [2024-01-29 14:19:48,394 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] v_old == 0 [2024-01-29 14:19:48,394 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] i == 0 [2024-01-29 14:19:48,394 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] A == 0 [2024-01-29 14:19:48,395 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] N == 0 [2024-01-29 14:19:48,395 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] last == 0 [2024-01-29 14:19:48,395 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-29 14:19:48,395 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] end == 0 [2024-01-29 14:19:48,395 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] n == 0 [2024-01-29 14:19:48,395 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (long long )end + (long long )start >= 0LL [2024-01-29 14:19:48,396 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-29 14:19:48,396 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (long long )end - (long long )start >= 0LL [2024-01-29 14:19:48,396 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ok == (_Bool)1 [2024-01-29 14:19:48,397 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] queue == 0 [2024-01-29 14:19:48,397 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] start == 0 [2024-01-29 14:19:48,397 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] new == 0 [2024-01-29 14:19:48,397 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] v_old == 0 [2024-01-29 14:19:48,397 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] ok == (_Bool)1 [2024-01-29 14:19:48,397 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] new == 0 [2024-01-29 14:19:48,397 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] last == 0 [2024-01-29 14:19:48,397 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] A == 0 [2024-01-29 14:19:48,398 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] v_old == 0 [2024-01-29 14:19:48,398 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] i == 0 [2024-01-29 14:19:48,398 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,398 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] i == 0 [2024-01-29 14:19:48,398 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] new == 0 [2024-01-29 14:19:48,398 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] v_old == 0 [2024-01-29 14:19:48,398 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] last == 0 [2024-01-29 14:19:48,399 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] ok == (_Bool)1 [2024-01-29 14:19:48,399 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] 0 <= i [2024-01-29 14:19:48,399 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,399 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] i == 0 [2024-01-29 14:19:48,399 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] new == 0 [2024-01-29 14:19:48,399 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] ok == (_Bool)1 [2024-01-29 14:19:48,399 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,399 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] 0 <= i [2024-01-29 14:19:48,400 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] start <= 2147483646 [2024-01-29 14:19:48,400 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] -2147483647 <= end [2024-01-29 14:19:48,400 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,401 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] 0 <= i [2024-01-29 14:19:48,404 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] i == 0 [2024-01-29 14:19:48,421 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] ok == (_Bool)1 [2024-01-29 14:19:48,422 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] v_old == 0 [2024-01-29 14:19:48,422 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] A == 0 [2024-01-29 14:19:48,422 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] new == 0 [2024-01-29 14:19:48,422 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] last == 0 [2024-01-29 14:19:48,422 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] 0 <= i [2024-01-29 14:19:48,423 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,423 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L56] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,423 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,423 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] (-1LL - (long long )i) + (long long )size >= 0LL [2024-01-29 14:19:48,423 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] i == 0 [2024-01-29 14:19:48,424 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] last == 0 [2024-01-29 14:19:48,424 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] new == 0 [2024-01-29 14:19:48,424 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] A == 0 [2024-01-29 14:19:48,424 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] size != 0 [2024-01-29 14:19:48,424 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] ok == (_Bool)1 [2024-01-29 14:19:48,424 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] v_old == 0 [2024-01-29 14:19:48,424 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-29 14:19:48,424 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] 0 <= i [2024-01-29 14:19:48,425 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,425 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,425 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] A == 0 [2024-01-29 14:19:48,425 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] i == 0 [2024-01-29 14:19:48,425 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] v_old == 0 [2024-01-29 14:19:48,425 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] queue == 0 [2024-01-29 14:19:48,425 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] new == 0 [2024-01-29 14:19:48,425 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] ok == (_Bool)1 [2024-01-29 14:19:48,426 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] last == 0 [2024-01-29 14:19:48,426 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] ok == (_Bool)1 [2024-01-29 14:19:48,426 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] last == 0 [2024-01-29 14:19:48,426 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] i == 0 [2024-01-29 14:19:48,426 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] v_old == 0 [2024-01-29 14:19:48,426 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] new == 0 [2024-01-29 14:19:48,427 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ok == (_Bool)1 [2024-01-29 14:19:48,427 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] new == 0 [2024-01-29 14:19:48,427 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] v_old == 0 [2024-01-29 14:19:48,427 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] i == 0 [2024-01-29 14:19:48,428 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] A == 0 [2024-01-29 14:19:48,428 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] last == 0 [2024-01-29 14:19:48,428 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,428 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (long long )end - (long long )start >= 0LL [2024-01-29 14:19:48,428 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] A == 0 [2024-01-29 14:19:48,428 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] end == 0 [2024-01-29 14:19:48,428 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] new == 0 [2024-01-29 14:19:48,428 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] n == 0 [2024-01-29 14:19:48,429 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] last == 0 [2024-01-29 14:19:48,429 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-29 14:19:48,429 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] N == 0 [2024-01-29 14:19:48,429 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ok == (_Bool)0 [2024-01-29 14:19:48,429 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] v_old == 0 [2024-01-29 14:19:48,429 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] i == 0 [2024-01-29 14:19:48,429 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-29 14:19:48,429 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] start == 0 [2024-01-29 14:19:48,430 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] queue == 0 [2024-01-29 14:19:48,430 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (long long )end + (long long )start >= 0LL [2024-01-29 14:19:48,430 INFO L98 nessWitnessExtractor]: Loop invariant at [L69-L80] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,430 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,430 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,431 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] -2147483647 <= start [2024-01-29 14:19:48,431 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] 0 <= i [2024-01-29 14:19:48,431 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,437 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] 0 <= i [2024-01-29 14:19:48,437 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,437 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] queue == 0 [2024-01-29 14:19:48,438 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] i == 0 [2024-01-29 14:19:48,438 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] end == 0 [2024-01-29 14:19:48,438 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] new == 0 [2024-01-29 14:19:48,438 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] last == 0 [2024-01-29 14:19:48,439 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] v_old == 0 [2024-01-29 14:19:48,439 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] A == 0 [2024-01-29 14:19:48,439 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] ok == (_Bool)1 [2024-01-29 14:19:48,440 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,440 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-29 14:19:48,442 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] 0 <= i [2024-01-29 14:19:48,443 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] ok == (_Bool)1 [2024-01-29 14:19:48,443 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] last == 0 [2024-01-29 14:19:48,443 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-29 14:19:48,448 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] i == 0 [2024-01-29 14:19:48,448 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] new == 0 [2024-01-29 14:19:48,448 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] A == 0 [2024-01-29 14:19:48,448 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] v_old == 0 [2024-01-29 14:19:48,470 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 14:19:48,584 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-01-29 14:19:48,590 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:19:48,596 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 14:19:48,604 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-29 14:19:48,676 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local 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-29 14:19:48,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:19:48,704 INFO L206 MainTranslator]: Completed translation [2024-01-29 14:19:48,705 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48 WrapperNode [2024-01-29 14:19:48,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 14:19:48,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 14:19:48,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 14:19:48,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 14:19:48,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,752 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 440 [2024-01-29 14:19:48,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 14:19:48,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 14:19:48,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 14:19:48,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 14:19:48,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,789 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-29 14:19:48,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 14:19:48,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 14:19:48,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 14:19:48,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 14:19:48,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:19:48,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:19:49,100 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-29 14:19:49,109 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-29 14:19:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 14:19:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 14:19:49,146 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 14:19:49,146 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 14:19:49,146 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 14:19:49,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 14:19:49,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 14:19:49,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 14:19:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 14:19:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 14:19:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 14:19:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 14:19:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 14:19:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 14:19:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-29 14:19:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-29 14:19:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-29 14:19:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 14:19:49,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 14:19:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 14:19:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 14:19:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 14:19:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 14:19:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 14:19:49,164 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 14:19:49,249 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 14:19:49,251 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 14:19:49,786 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 14:19:49,786 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 14:19:49,969 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 14:19:49,969 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-29 14:19:49,969 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:19:49 BoogieIcfgContainer [2024-01-29 14:19:49,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 14:19:49,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 14:19:49,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 14:19:49,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 14:19:49,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 02:19:48" (1/4) ... [2024-01-29 14:19:49,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b5b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:19:49, skipping insertion in model container [2024-01-29 14:19:49,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:19:48" (2/4) ... [2024-01-29 14:19:49,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b5b36 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:19:49, skipping insertion in model container [2024-01-29 14:19:49,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:48" (3/4) ... [2024-01-29 14:19:49,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b5b36 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:19:49, skipping insertion in model container [2024-01-29 14:19:49,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:19:49" (4/4) ... [2024-01-29 14:19:49,976 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-01-29 14:19:49,988 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 14:19:49,989 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 242 error locations. [2024-01-29 14:19:49,989 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 14:19:50,063 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 14:19:50,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 481 places, 479 transitions, 972 flow [2024-01-29 14:19:50,216 INFO L124 PetriNetUnfolderBase]: 5/477 cut-off events. [2024-01-29 14:19:50,217 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 14:19:50,223 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-29 14:19:50,223 INFO L82 GeneralOperation]: Start removeDead. Operand has 481 places, 479 transitions, 972 flow [2024-01-29 14:19:50,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 478 places, 476 transitions, 964 flow [2024-01-29 14:19:50,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 14:19:50,248 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;@8e733a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 14:19:50,249 INFO L358 AbstractCegarLoop]: Starting to check reachability of 292 error locations. [2024-01-29 14:19:50,251 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 14:19:50,251 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 14:19:50,251 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:19:50,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:50,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 14:19:50,252 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:50,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:50,258 INFO L85 PathProgramCache]: Analyzing trace with hash 41820, now seen corresponding path program 1 times [2024-01-29 14:19:50,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:50,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619836706] [2024-01-29 14:19:50,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:50,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:50,530 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-29 14:19:50,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:50,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619836706] [2024-01-29 14:19:50,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619836706] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:50,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:50,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:50,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740228777] [2024-01-29 14:19:50,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:50,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:50,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:50,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:50,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:50,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 479 [2024-01-29 14:19:50,615 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-29 14:19:50,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:50,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 479 [2024-01-29 14:19:50,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:51,086 INFO L124 PetriNetUnfolderBase]: 877/2162 cut-off events. [2024-01-29 14:19:51,086 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-01-29 14:19:51,117 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. 23/1316 useless extension candidates. Maximal degree in co-relation 2997. Up to 1369 conditions per place. [2024-01-29 14:19:51,126 INFO L140 encePairwiseOnDemand]: 433/479 looper letters, 59 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2024-01-29 14:19:51,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 432 transitions, 998 flow [2024-01-29 14:19:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2024-01-29 14:19:51,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8517745302713987 [2024-01-29 14:19:51,154 INFO L175 Difference]: Start difference. First operand has 478 places, 476 transitions, 964 flow. Second operand 3 states and 1224 transitions. [2024-01-29 14:19:51,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 432 transitions, 998 flow [2024-01-29 14:19:51,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 432 transitions, 990 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 14:19:51,170 INFO L231 Difference]: Finished difference. Result has 432 places, 432 transitions, 872 flow [2024-01-29 14:19:51,172 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-29 14:19:51,176 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -46 predicate places. [2024-01-29 14:19:51,176 INFO L495 AbstractCegarLoop]: Abstraction has has 432 places, 432 transitions, 872 flow [2024-01-29 14:19:51,177 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-29 14:19:51,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:51,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 14:19:51,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 14:19:51,178 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:51,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1297661, now seen corresponding path program 1 times [2024-01-29 14:19:51,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:51,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738281555] [2024-01-29 14:19:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:51,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:51,247 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-29 14:19:51,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:51,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738281555] [2024-01-29 14:19:51,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738281555] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:51,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:51,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:51,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644658883] [2024-01-29 14:19:51,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:51,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:51,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:51,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:51,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:51,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 479 [2024-01-29 14:19:51,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 432 transitions, 872 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-29 14:19:51,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:51,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 479 [2024-01-29 14:19:51,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:51,648 INFO L124 PetriNetUnfolderBase]: 877/2156 cut-off events. [2024-01-29 14:19:51,649 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-29 14:19:51,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3551 conditions, 2156 events. 877/2156 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 13218 event pairs, 621 based on Foata normal form. 0/1291 useless extension candidates. Maximal degree in co-relation 3450. Up to 1360 conditions per place. [2024-01-29 14:19:51,658 INFO L140 encePairwiseOnDemand]: 471/479 looper letters, 63 selfloop transitions, 2 changer transitions 0/426 dead transitions. [2024-01-29 14:19:51,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 426 transitions, 990 flow [2024-01-29 14:19:51,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1232 transitions. [2024-01-29 14:19:51,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8573416840640222 [2024-01-29 14:19:51,661 INFO L175 Difference]: Start difference. First operand has 432 places, 432 transitions, 872 flow. Second operand 3 states and 1232 transitions. [2024-01-29 14:19:51,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 426 transitions, 990 flow [2024-01-29 14:19:51,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 426 transitions, 986 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:51,666 INFO L231 Difference]: Finished difference. Result has 426 places, 426 transitions, 860 flow [2024-01-29 14:19:51,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=426, PETRI_TRANSITIONS=426} [2024-01-29 14:19:51,668 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -52 predicate places. [2024-01-29 14:19:51,668 INFO L495 AbstractCegarLoop]: Abstraction has has 426 places, 426 transitions, 860 flow [2024-01-29 14:19:51,668 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-29 14:19:51,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:51,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 14:19:51,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 14:19:51,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:51,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:51,670 INFO L85 PathProgramCache]: Analyzing trace with hash 5179134, now seen corresponding path program 1 times [2024-01-29 14:19:51,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:51,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170802776] [2024-01-29 14:19:51,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:51,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:51,698 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-29 14:19:51,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:51,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170802776] [2024-01-29 14:19:51,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170802776] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:51,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:51,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024836138] [2024-01-29 14:19:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:51,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:51,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:51,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 479 [2024-01-29 14:19:51,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 426 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 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-29 14:19:51,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:51,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 479 [2024-01-29 14:19:51,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:52,062 INFO L124 PetriNetUnfolderBase]: 1339/3009 cut-off events. [2024-01-29 14:19:52,062 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-29 14:19:52,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5159 conditions, 3009 events. 1339/3009 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 20362 event pairs, 459 based on Foata normal form. 2/1862 useless extension candidates. Maximal degree in co-relation 4929. Up to 1267 conditions per place. [2024-01-29 14:19:52,074 INFO L140 encePairwiseOnDemand]: 451/479 looper letters, 102 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2024-01-29 14:19:52,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 435 transitions, 1089 flow [2024-01-29 14:19:52,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1219 transitions. [2024-01-29 14:19:52,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.848295059151009 [2024-01-29 14:19:52,077 INFO L175 Difference]: Start difference. First operand has 426 places, 426 transitions, 860 flow. Second operand 3 states and 1219 transitions. [2024-01-29 14:19:52,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 435 transitions, 1089 flow [2024-01-29 14:19:52,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 435 transitions, 1085 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:52,082 INFO L231 Difference]: Finished difference. Result has 406 places, 406 transitions, 834 flow [2024-01-29 14:19:52,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=406, PETRI_TRANSITIONS=406} [2024-01-29 14:19:52,083 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -72 predicate places. [2024-01-29 14:19:52,083 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 406 transitions, 834 flow [2024-01-29 14:19:52,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 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-29 14:19:52,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:52,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:52,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 14:19:52,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:52,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:52,085 INFO L85 PathProgramCache]: Analyzing trace with hash 160554789, now seen corresponding path program 1 times [2024-01-29 14:19:52,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:52,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790784822] [2024-01-29 14:19:52,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:52,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:52,107 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-29 14:19:52,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:52,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790784822] [2024-01-29 14:19:52,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790784822] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:52,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:52,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:52,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941775291] [2024-01-29 14:19:52,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:52,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:52,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:52,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:52,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:52,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 479 [2024-01-29 14:19:52,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 406 transitions, 834 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-29 14:19:52,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:52,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 479 [2024-01-29 14:19:52,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:52,443 INFO L124 PetriNetUnfolderBase]: 1339/3084 cut-off events. [2024-01-29 14:19:52,444 INFO L125 PetriNetUnfolderBase]: For 190/200 co-relation queries the response was YES. [2024-01-29 14:19:52,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5505 conditions, 3084 events. 1339/3084 cut-off events. For 190/200 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 21257 event pairs, 987 based on Foata normal form. 0/2109 useless extension candidates. Maximal degree in co-relation 2303. Up to 2088 conditions per place. [2024-01-29 14:19:52,506 INFO L140 encePairwiseOnDemand]: 454/479 looper letters, 82 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2024-01-29 14:19:52,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 383 transitions, 956 flow [2024-01-29 14:19:52,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1162 transitions. [2024-01-29 14:19:52,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8086290883785665 [2024-01-29 14:19:52,509 INFO L175 Difference]: Start difference. First operand has 406 places, 406 transitions, 834 flow. Second operand 3 states and 1162 transitions. [2024-01-29 14:19:52,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 383 transitions, 956 flow [2024-01-29 14:19:52,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 383 transitions, 954 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:19:52,514 INFO L231 Difference]: Finished difference. Result has 384 places, 383 transitions, 790 flow [2024-01-29 14:19:52,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=384, PETRI_TRANSITIONS=383} [2024-01-29 14:19:52,518 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -94 predicate places. [2024-01-29 14:19:52,518 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 383 transitions, 790 flow [2024-01-29 14:19:52,519 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-29 14:19:52,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:52,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:52,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 14:19:52,519 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:52,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:52,520 INFO L85 PathProgramCache]: Analyzing trace with hash 682232509, now seen corresponding path program 1 times [2024-01-29 14:19:52,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:52,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088862126] [2024-01-29 14:19:52,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:52,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:52,591 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-29 14:19:52,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:52,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088862126] [2024-01-29 14:19:52,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088862126] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:52,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:52,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:52,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358733923] [2024-01-29 14:19:52,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:52,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:52,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:52,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:52,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:52,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 479 [2024-01-29 14:19:52,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 383 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 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-29 14:19:52,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:52,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 479 [2024-01-29 14:19:52,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:53,015 INFO L124 PetriNetUnfolderBase]: 1339/3083 cut-off events. [2024-01-29 14:19:53,016 INFO L125 PetriNetUnfolderBase]: For 191/201 co-relation queries the response was YES. [2024-01-29 14:19:53,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5476 conditions, 3083 events. 1339/3083 cut-off events. For 191/201 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21219 event pairs, 987 based on Foata normal form. 1/2131 useless extension candidates. Maximal degree in co-relation 5124. Up to 2129 conditions per place. [2024-01-29 14:19:53,031 INFO L140 encePairwiseOnDemand]: 476/479 looper letters, 80 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2024-01-29 14:19:53,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 382 transitions, 952 flow [2024-01-29 14:19:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1210 transitions. [2024-01-29 14:19:53,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8420320111343076 [2024-01-29 14:19:53,034 INFO L175 Difference]: Start difference. First operand has 384 places, 383 transitions, 790 flow. Second operand 3 states and 1210 transitions. [2024-01-29 14:19:53,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 382 transitions, 952 flow [2024-01-29 14:19:53,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 382 transitions, 948 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:53,040 INFO L231 Difference]: Finished difference. Result has 383 places, 382 transitions, 788 flow [2024-01-29 14:19:53,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=383, PETRI_TRANSITIONS=382} [2024-01-29 14:19:53,043 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -95 predicate places. [2024-01-29 14:19:53,043 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 382 transitions, 788 flow [2024-01-29 14:19:53,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 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-29 14:19:53,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:53,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:53,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 14:19:53,044 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:53,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:53,044 INFO L85 PathProgramCache]: Analyzing trace with hash -325627256, now seen corresponding path program 1 times [2024-01-29 14:19:53,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:53,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211649100] [2024-01-29 14:19:53,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:53,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:53,078 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-29 14:19:53,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:53,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211649100] [2024-01-29 14:19:53,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211649100] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:53,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:53,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:53,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457569440] [2024-01-29 14:19:53,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:53,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:53,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:53,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:53,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:53,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 479 [2024-01-29 14:19:53,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 382 transitions, 788 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-29 14:19:53,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:53,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 479 [2024-01-29 14:19:53,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:53,600 INFO L124 PetriNetUnfolderBase]: 1339/3081 cut-off events. [2024-01-29 14:19:53,601 INFO L125 PetriNetUnfolderBase]: For 191/201 co-relation queries the response was YES. [2024-01-29 14:19:53,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5455 conditions, 3081 events. 1339/3081 cut-off events. For 191/201 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21195 event pairs, 987 based on Foata normal form. 0/2109 useless extension candidates. Maximal degree in co-relation 5425. Up to 2107 conditions per place. [2024-01-29 14:19:53,613 INFO L140 encePairwiseOnDemand]: 475/479 looper letters, 61 selfloop transitions, 2 changer transitions 0/380 dead transitions. [2024-01-29 14:19:53,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 380 transitions, 910 flow [2024-01-29 14:19:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2024-01-29 14:19:53,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8670842032011135 [2024-01-29 14:19:53,616 INFO L175 Difference]: Start difference. First operand has 383 places, 382 transitions, 788 flow. Second operand 3 states and 1246 transitions. [2024-01-29 14:19:53,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 380 transitions, 910 flow [2024-01-29 14:19:53,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 380 transitions, 906 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:53,621 INFO L231 Difference]: Finished difference. Result has 381 places, 380 transitions, 784 flow [2024-01-29 14:19:53,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=381, PETRI_TRANSITIONS=380} [2024-01-29 14:19:53,622 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -97 predicate places. [2024-01-29 14:19:53,622 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 380 transitions, 784 flow [2024-01-29 14:19:53,623 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-29 14:19:53,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:53,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:53,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 14:19:53,623 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:53,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash 604865678, now seen corresponding path program 1 times [2024-01-29 14:19:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:53,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204100690] [2024-01-29 14:19:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:53,638 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-29 14:19:53,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:53,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204100690] [2024-01-29 14:19:53,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204100690] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:53,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:53,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:53,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093874192] [2024-01-29 14:19:53,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:53,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:53,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:53,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:53,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:53,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2024-01-29 14:19:53,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 380 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 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-29 14:19:53,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:53,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2024-01-29 14:19:53,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:54,043 INFO L124 PetriNetUnfolderBase]: 1339/3057 cut-off events. [2024-01-29 14:19:54,043 INFO L125 PetriNetUnfolderBase]: For 191/201 co-relation queries the response was YES. [2024-01-29 14:19:54,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5449 conditions, 3057 events. 1339/3057 cut-off events. For 191/201 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21176 event pairs, 987 based on Foata normal form. 0/2105 useless extension candidates. Maximal degree in co-relation 5399. Up to 2087 conditions per place. [2024-01-29 14:19:54,055 INFO L140 encePairwiseOnDemand]: 453/479 looper letters, 79 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2024-01-29 14:19:54,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 356 transitions, 898 flow [2024-01-29 14:19:54,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2024-01-29 14:19:54,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8114126652748782 [2024-01-29 14:19:54,058 INFO L175 Difference]: Start difference. First operand has 381 places, 380 transitions, 784 flow. Second operand 3 states and 1166 transitions. [2024-01-29 14:19:54,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 356 transitions, 898 flow [2024-01-29 14:19:54,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 356 transitions, 894 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:54,063 INFO L231 Difference]: Finished difference. Result has 357 places, 356 transitions, 736 flow [2024-01-29 14:19:54,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=355, 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=736, PETRI_PLACES=357, PETRI_TRANSITIONS=356} [2024-01-29 14:19:54,064 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -121 predicate places. [2024-01-29 14:19:54,064 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 356 transitions, 736 flow [2024-01-29 14:19:54,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 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-29 14:19:54,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:54,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:54,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 14:19:54,065 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:54,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1570968431, now seen corresponding path program 1 times [2024-01-29 14:19:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:54,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329861576] [2024-01-29 14:19:54,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:54,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:54,084 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-29 14:19:54,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:54,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329861576] [2024-01-29 14:19:54,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329861576] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:54,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:54,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:54,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088729647] [2024-01-29 14:19:54,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:54,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:54,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:54,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:54,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:54,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 392 out of 479 [2024-01-29 14:19:54,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 356 transitions, 736 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-29 14:19:54,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:54,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 392 of 479 [2024-01-29 14:19:54,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:54,475 INFO L124 PetriNetUnfolderBase]: 1339/3054 cut-off events. [2024-01-29 14:19:54,475 INFO L125 PetriNetUnfolderBase]: For 191/201 co-relation queries the response was YES. [2024-01-29 14:19:54,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5429 conditions, 3054 events. 1339/3054 cut-off events. For 191/201 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21228 event pairs, 987 based on Foata normal form. 0/2105 useless extension candidates. Maximal degree in co-relation 5114. Up to 2106 conditions per place. [2024-01-29 14:19:54,485 INFO L140 encePairwiseOnDemand]: 474/479 looper letters, 62 selfloop transitions, 2 changer transitions 0/353 dead transitions. [2024-01-29 14:19:54,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 353 transitions, 858 flow [2024-01-29 14:19:54,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:54,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-01-29 14:19:54,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8643006263048016 [2024-01-29 14:19:54,488 INFO L175 Difference]: Start difference. First operand has 357 places, 356 transitions, 736 flow. Second operand 3 states and 1242 transitions. [2024-01-29 14:19:54,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 353 transitions, 858 flow [2024-01-29 14:19:54,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 353 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:54,492 INFO L231 Difference]: Finished difference. Result has 354 places, 353 transitions, 730 flow [2024-01-29 14:19:54,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=354, PETRI_TRANSITIONS=353} [2024-01-29 14:19:54,493 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -124 predicate places. [2024-01-29 14:19:54,493 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 353 transitions, 730 flow [2024-01-29 14:19:54,493 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-29 14:19:54,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:54,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:54,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 14:19:54,494 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:54,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:54,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1455382410, now seen corresponding path program 1 times [2024-01-29 14:19:54,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:54,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210904378] [2024-01-29 14:19:54,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:54,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:54,508 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-29 14:19:54,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:54,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210904378] [2024-01-29 14:19:54,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210904378] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:54,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:54,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:54,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723283108] [2024-01-29 14:19:54,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:54,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:54,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:54,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:54,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:54,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 479 [2024-01-29 14:19:54,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 353 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 349.6666666666667) internal successors, (1049), 3 states have internal predecessors, (1049), 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-29 14:19:54,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:54,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 479 [2024-01-29 14:19:54,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:54,942 INFO L124 PetriNetUnfolderBase]: 1543/3580 cut-off events. [2024-01-29 14:19:54,942 INFO L125 PetriNetUnfolderBase]: For 234/244 co-relation queries the response was YES. [2024-01-29 14:19:54,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6499 conditions, 3580 events. 1543/3580 cut-off events. For 234/244 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 26636 event pairs, 611 based on Foata normal form. 1/2578 useless extension candidates. Maximal degree in co-relation 6436. Up to 1405 conditions per place. [2024-01-29 14:19:54,953 INFO L140 encePairwiseOnDemand]: 452/479 looper letters, 109 selfloop transitions, 2 changer transitions 0/354 dead transitions. [2024-01-29 14:19:54,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 354 transitions, 966 flow [2024-01-29 14:19:54,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1181 transitions. [2024-01-29 14:19:54,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8218510786360473 [2024-01-29 14:19:54,955 INFO L175 Difference]: Start difference. First operand has 354 places, 353 transitions, 730 flow. Second operand 3 states and 1181 transitions. [2024-01-29 14:19:54,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 354 transitions, 966 flow [2024-01-29 14:19:54,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 354 transitions, 962 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:54,959 INFO L231 Difference]: Finished difference. Result has 330 places, 329 transitions, 686 flow [2024-01-29 14:19:54,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=330, PETRI_TRANSITIONS=329} [2024-01-29 14:19:54,960 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -148 predicate places. [2024-01-29 14:19:54,960 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 329 transitions, 686 flow [2024-01-29 14:19:54,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.6666666666667) internal successors, (1049), 3 states have internal predecessors, (1049), 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-29 14:19:54,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:54,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:54,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 14:19:54,961 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:54,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:54,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1536795396, now seen corresponding path program 1 times [2024-01-29 14:19:54,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:54,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567791035] [2024-01-29 14:19:54,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:54,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:54,980 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-29 14:19:54,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:54,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567791035] [2024-01-29 14:19:54,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567791035] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:54,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:54,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:54,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986362469] [2024-01-29 14:19:54,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:54,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:54,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:54,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:54,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:55,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 479 [2024-01-29 14:19:55,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 329 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 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-29 14:19:55,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:55,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 479 [2024-01-29 14:19:55,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:55,498 INFO L124 PetriNetUnfolderBase]: 1543/3544 cut-off events. [2024-01-29 14:19:55,498 INFO L125 PetriNetUnfolderBase]: For 327/337 co-relation queries the response was YES. [2024-01-29 14:19:55,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6600 conditions, 3544 events. 1543/3544 cut-off events. For 327/337 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 26493 event pairs, 1363 based on Foata normal form. 0/2627 useless extension candidates. Maximal degree in co-relation 3028. Up to 2567 conditions per place. [2024-01-29 14:19:55,511 INFO L140 encePairwiseOnDemand]: 456/479 looper letters, 77 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2024-01-29 14:19:55,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 308 transitions, 802 flow [2024-01-29 14:19:55,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2024-01-29 14:19:55,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8197633959638135 [2024-01-29 14:19:55,514 INFO L175 Difference]: Start difference. First operand has 330 places, 329 transitions, 686 flow. Second operand 3 states and 1178 transitions. [2024-01-29 14:19:55,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 308 transitions, 802 flow [2024-01-29 14:19:55,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 308 transitions, 800 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:19:55,520 INFO L231 Difference]: Finished difference. Result has 310 places, 308 transitions, 646 flow [2024-01-29 14:19:55,520 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-29 14:19:55,521 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -168 predicate places. [2024-01-29 14:19:55,522 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 308 transitions, 646 flow [2024-01-29 14:19:55,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 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-29 14:19:55,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:55,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:55,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 14:19:55,523 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:55,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:55,524 INFO L85 PathProgramCache]: Analyzing trace with hash -566930888, now seen corresponding path program 1 times [2024-01-29 14:19:55,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:55,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012475493] [2024-01-29 14:19:55,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:55,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:55,573 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-29 14:19:55,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:55,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012475493] [2024-01-29 14:19:55,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012475493] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:55,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:55,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 14:19:55,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344056156] [2024-01-29 14:19:55,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:55,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:55,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:55,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:55,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:55,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 479 [2024-01-29 14:19:55,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 308 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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-29 14:19:55,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:55,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 479 [2024-01-29 14:19:55,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:56,120 INFO L124 PetriNetUnfolderBase]: 1617/3686 cut-off events. [2024-01-29 14:19:56,120 INFO L125 PetriNetUnfolderBase]: For 336/346 co-relation queries the response was YES. [2024-01-29 14:19:56,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6808 conditions, 3686 events. 1617/3686 cut-off events. For 336/346 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 28022 event pairs, 679 based on Foata normal form. 23/2801 useless extension candidates. Maximal degree in co-relation 6578. Up to 1407 conditions per place. [2024-01-29 14:19:56,130 INFO L140 encePairwiseOnDemand]: 452/479 looper letters, 85 selfloop transitions, 2 changer transitions 1/309 dead transitions. [2024-01-29 14:19:56,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 309 transitions, 836 flow [2024-01-29 14:19:56,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions. [2024-01-29 14:19:56,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8559498956158664 [2024-01-29 14:19:56,133 INFO L175 Difference]: Start difference. First operand has 310 places, 308 transitions, 646 flow. Second operand 3 states and 1230 transitions. [2024-01-29 14:19:56,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 309 transitions, 836 flow [2024-01-29 14:19:56,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 309 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:56,137 INFO L231 Difference]: Finished difference. Result has 287 places, 285 transitions, 606 flow [2024-01-29 14:19:56,137 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-29 14:19:56,138 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -191 predicate places. [2024-01-29 14:19:56,138 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 285 transitions, 606 flow [2024-01-29 14:19:56,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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-29 14:19:56,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:56,139 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] [2024-01-29 14:19:56,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 14:19:56,139 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:56,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:56,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2047983596, now seen corresponding path program 1 times [2024-01-29 14:19:56,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:56,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30295858] [2024-01-29 14:19:56,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:56,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:56,183 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-29 14:19:56,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:56,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30295858] [2024-01-29 14:19:56,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30295858] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:56,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:56,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:56,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949099533] [2024-01-29 14:19:56,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:56,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:56,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:56,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:56,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:56,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 479 [2024-01-29 14:19:56,228 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-29 14:19:56,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:56,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 479 [2024-01-29 14:19:56,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:56,635 INFO L124 PetriNetUnfolderBase]: 1617/3685 cut-off events. [2024-01-29 14:19:56,635 INFO L125 PetriNetUnfolderBase]: For 383/393 co-relation queries the response was YES. [2024-01-29 14:19:56,639 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 243. Compared 27980 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-29 14:19:56,649 INFO L140 encePairwiseOnDemand]: 476/479 looper letters, 66 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2024-01-29 14:19:56,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 284 transitions, 740 flow [2024-01-29 14:19:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions. [2024-01-29 14:19:56,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8559498956158664 [2024-01-29 14:19:56,653 INFO L175 Difference]: Start difference. First operand has 287 places, 285 transitions, 606 flow. Second operand 3 states and 1230 transitions. [2024-01-29 14:19:56,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 284 transitions, 740 flow [2024-01-29 14:19:56,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 738 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:19:56,657 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 606 flow [2024-01-29 14:19:56,658 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-29 14:19:56,658 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -191 predicate places. [2024-01-29 14:19:56,658 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 606 flow [2024-01-29 14:19:56,659 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-29 14:19:56,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:56,659 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] [2024-01-29 14:19:56,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 14:19:56,660 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:56,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1153890617, now seen corresponding path program 1 times [2024-01-29 14:19:56,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:56,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377942274] [2024-01-29 14:19:56,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:56,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:56,716 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-29 14:19:56,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:56,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377942274] [2024-01-29 14:19:56,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377942274] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:56,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:56,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 14:19:56,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650001396] [2024-01-29 14:19:56,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:56,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:56,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:56,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:56,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 479 [2024-01-29 14:19:56,753 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-29 14:19:56,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:56,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 479 [2024-01-29 14:19:56,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:57,198 INFO L124 PetriNetUnfolderBase]: 1617/3679 cut-off events. [2024-01-29 14:19:57,199 INFO L125 PetriNetUnfolderBase]: For 382/392 co-relation queries the response was YES. [2024-01-29 14:19:57,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6910 conditions, 3679 events. 1617/3679 cut-off events. For 382/392 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 27991 event pairs, 1431 based on Foata normal form. 2/2780 useless extension candidates. Maximal degree in co-relation 6827. Up to 2708 conditions per place. [2024-01-29 14:19:57,207 INFO L140 encePairwiseOnDemand]: 465/479 looper letters, 65 selfloop transitions, 8 changer transitions 0/278 dead transitions. [2024-01-29 14:19:57,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 278 transitions, 740 flow [2024-01-29 14:19:57,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2024-01-29 14:19:57,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8503827418232429 [2024-01-29 14:19:57,210 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 606 flow. Second operand 3 states and 1222 transitions. [2024-01-29 14:19:57,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 278 transitions, 740 flow [2024-01-29 14:19:57,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 278 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:57,213 INFO L231 Difference]: Finished difference. Result has 281 places, 278 transitions, 606 flow [2024-01-29 14:19:57,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=281, PETRI_TRANSITIONS=278} [2024-01-29 14:19:57,214 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -197 predicate places. [2024-01-29 14:19:57,214 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 278 transitions, 606 flow [2024-01-29 14:19:57,215 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-29 14:19:57,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:57,215 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-29 14:19:57,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 14:19:57,215 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:57,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:57,216 INFO L85 PathProgramCache]: Analyzing trace with hash 677458412, now seen corresponding path program 1 times [2024-01-29 14:19:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247300314] [2024-01-29 14:19:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:57,279 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-29 14:19:57,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:57,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247300314] [2024-01-29 14:19:57,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247300314] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:57,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:57,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:19:57,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132602378] [2024-01-29 14:19:57,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:57,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:19:57,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:57,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:19:57,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:19:57,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 479 [2024-01-29 14:19:57,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 278 transitions, 606 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-29 14:19:57,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:57,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 479 [2024-01-29 14:19:57,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:57,814 INFO L124 PetriNetUnfolderBase]: 1617/3673 cut-off events. [2024-01-29 14:19:57,815 INFO L125 PetriNetUnfolderBase]: For 387/397 co-relation queries the response was YES. [2024-01-29 14:19:57,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6914 conditions, 3673 events. 1617/3673 cut-off events. For 387/397 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 27896 event pairs, 1431 based on Foata normal form. 4/2782 useless extension candidates. Maximal degree in co-relation 6686. Up to 2708 conditions per place. [2024-01-29 14:19:57,825 INFO L140 encePairwiseOnDemand]: 463/479 looper letters, 67 selfloop transitions, 10 changer transitions 0/272 dead transitions. [2024-01-29 14:19:57,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 272 transitions, 748 flow [2024-01-29 14:19:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:19:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:19:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1568 transitions. [2024-01-29 14:19:57,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8183716075156576 [2024-01-29 14:19:57,828 INFO L175 Difference]: Start difference. First operand has 281 places, 278 transitions, 606 flow. Second operand 4 states and 1568 transitions. [2024-01-29 14:19:57,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 272 transitions, 748 flow [2024-01-29 14:19:57,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 272 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:57,832 INFO L231 Difference]: Finished difference. Result has 276 places, 272 transitions, 598 flow [2024-01-29 14:19:57,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=598, PETRI_PLACES=276, PETRI_TRANSITIONS=272} [2024-01-29 14:19:57,833 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -202 predicate places. [2024-01-29 14:19:57,833 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 272 transitions, 598 flow [2024-01-29 14:19:57,833 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-29 14:19:57,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:57,834 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] [2024-01-29 14:19:57,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 14:19:57,834 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:57,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:57,834 INFO L85 PathProgramCache]: Analyzing trace with hash -565492627, now seen corresponding path program 1 times [2024-01-29 14:19:57,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:57,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534217434] [2024-01-29 14:19:57,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:57,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:57,941 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-29 14:19:57,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:57,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534217434] [2024-01-29 14:19:57,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534217434] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:57,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:57,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:19:57,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568100057] [2024-01-29 14:19:57,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:57,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 14:19:57,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:57,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 14:19:57,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-29 14:19:58,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 479 [2024-01-29 14:19:58,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 272 transitions, 598 flow. Second operand has 5 states, 5 states have (on average 335.2) internal successors, (1676), 5 states have internal predecessors, (1676), 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-29 14:19:58,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:58,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 479 [2024-01-29 14:19:58,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:58,462 INFO L124 PetriNetUnfolderBase]: 1617/3643 cut-off events. [2024-01-29 14:19:58,462 INFO L125 PetriNetUnfolderBase]: For 392/404 co-relation queries the response was YES. [2024-01-29 14:19:58,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6904 conditions, 3643 events. 1617/3643 cut-off events. For 392/404 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 28174 event pairs, 663 based on Foata normal form. 3/2765 useless extension candidates. Maximal degree in co-relation 6661. Up to 1612 conditions per place. [2024-01-29 14:19:58,475 INFO L140 encePairwiseOnDemand]: 465/479 looper letters, 114 selfloop transitions, 12 changer transitions 0/301 dead transitions. [2024-01-29 14:19:58,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 301 transitions, 921 flow [2024-01-29 14:19:58,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:19:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:19:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1779 transitions. [2024-01-29 14:19:58,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7427974947807933 [2024-01-29 14:19:58,479 INFO L175 Difference]: Start difference. First operand has 276 places, 272 transitions, 598 flow. Second operand 5 states and 1779 transitions. [2024-01-29 14:19:58,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 301 transitions, 921 flow [2024-01-29 14:19:58,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 301 transitions, 901 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 14:19:58,483 INFO L231 Difference]: Finished difference. Result has 275 places, 270 transitions, 598 flow [2024-01-29 14:19:58,483 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=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=598, PETRI_PLACES=275, PETRI_TRANSITIONS=270} [2024-01-29 14:19:58,484 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -203 predicate places. [2024-01-29 14:19:58,484 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 270 transitions, 598 flow [2024-01-29 14:19:58,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 335.2) internal successors, (1676), 5 states have internal predecessors, (1676), 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-29 14:19:58,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:58,501 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, 1, 1] [2024-01-29 14:19:58,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 14:19:58,501 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:58,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:58,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1820445017, now seen corresponding path program 1 times [2024-01-29 14:19:58,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:58,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341296417] [2024-01-29 14:19:58,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:58,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:58,728 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-29 14:19:58,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:58,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341296417] [2024-01-29 14:19:58,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341296417] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:58,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:58,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 14:19:58,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727968584] [2024-01-29 14:19:58,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:58,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 14:19:58,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:58,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 14:19:58,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-29 14:19:58,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 479 [2024-01-29 14:19:58,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 270 transitions, 598 flow. Second operand has 6 states, 6 states have (on average 372.8333333333333) internal successors, (2237), 6 states have internal predecessors, (2237), 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-29 14:19:58,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:58,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 479 [2024-01-29 14:19:58,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:59,155 INFO L124 PetriNetUnfolderBase]: 1615/3661 cut-off events. [2024-01-29 14:19:59,155 INFO L125 PetriNetUnfolderBase]: For 469/479 co-relation queries the response was YES. [2024-01-29 14:19:59,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6941 conditions, 3661 events. 1615/3661 cut-off events. For 469/479 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 27927 event pairs, 1431 based on Foata normal form. 4/2772 useless extension candidates. Maximal degree in co-relation 3313. Up to 2696 conditions per place. [2024-01-29 14:19:59,170 INFO L140 encePairwiseOnDemand]: 463/479 looper letters, 63 selfloop transitions, 12 changer transitions 0/260 dead transitions. [2024-01-29 14:19:59,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 260 transitions, 724 flow [2024-01-29 14:19:59,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 14:19:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 14:19:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2296 transitions. [2024-01-29 14:19:59,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7988865692414753 [2024-01-29 14:19:59,174 INFO L175 Difference]: Start difference. First operand has 275 places, 270 transitions, 598 flow. Second operand 6 states and 2296 transitions. [2024-01-29 14:19:59,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 260 transitions, 724 flow [2024-01-29 14:19:59,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 260 transitions, 710 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 14:19:59,178 INFO L231 Difference]: Finished difference. Result has 268 places, 260 transitions, 584 flow [2024-01-29 14:19:59,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=584, PETRI_PLACES=268, PETRI_TRANSITIONS=260} [2024-01-29 14:19:59,178 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -210 predicate places. [2024-01-29 14:19:59,178 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 260 transitions, 584 flow [2024-01-29 14:19:59,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 372.8333333333333) internal successors, (2237), 6 states have internal predecessors, (2237), 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-29 14:19:59,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:59,180 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, 1, 1, 1] [2024-01-29 14:19:59,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 14:19:59,180 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:59,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash 599221910, now seen corresponding path program 1 times [2024-01-29 14:19:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:59,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111190713] [2024-01-29 14:19:59,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:19:59,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 14:19:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:19:59,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 14:19:59,222 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 14:19:59,223 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT (291 of 292 remaining) [2024-01-29 14:19:59,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (290 of 292 remaining) [2024-01-29 14:19:59,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (289 of 292 remaining) [2024-01-29 14:19:59,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (288 of 292 remaining) [2024-01-29 14:19:59,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (287 of 292 remaining) [2024-01-29 14:19:59,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (286 of 292 remaining) [2024-01-29 14:19:59,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (285 of 292 remaining) [2024-01-29 14:19:59,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (284 of 292 remaining) [2024-01-29 14:19:59,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (283 of 292 remaining) [2024-01-29 14:19:59,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (282 of 292 remaining) [2024-01-29 14:19:59,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (281 of 292 remaining) [2024-01-29 14:19:59,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (280 of 292 remaining) [2024-01-29 14:19:59,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (279 of 292 remaining) [2024-01-29 14:19:59,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (278 of 292 remaining) [2024-01-29 14:19:59,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (277 of 292 remaining) [2024-01-29 14:19:59,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (276 of 292 remaining) [2024-01-29 14:19:59,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (275 of 292 remaining) [2024-01-29 14:19:59,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (274 of 292 remaining) [2024-01-29 14:19:59,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (273 of 292 remaining) [2024-01-29 14:19:59,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (272 of 292 remaining) [2024-01-29 14:19:59,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (271 of 292 remaining) [2024-01-29 14:19:59,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (270 of 292 remaining) [2024-01-29 14:19:59,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (269 of 292 remaining) [2024-01-29 14:19:59,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (268 of 292 remaining) [2024-01-29 14:19:59,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (267 of 292 remaining) [2024-01-29 14:19:59,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (266 of 292 remaining) [2024-01-29 14:19:59,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (265 of 292 remaining) [2024-01-29 14:19:59,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (264 of 292 remaining) [2024-01-29 14:19:59,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (263 of 292 remaining) [2024-01-29 14:19:59,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (262 of 292 remaining) [2024-01-29 14:19:59,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (261 of 292 remaining) [2024-01-29 14:19:59,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (260 of 292 remaining) [2024-01-29 14:19:59,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (259 of 292 remaining) [2024-01-29 14:19:59,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (258 of 292 remaining) [2024-01-29 14:19:59,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (257 of 292 remaining) [2024-01-29 14:19:59,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (256 of 292 remaining) [2024-01-29 14:19:59,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (255 of 292 remaining) [2024-01-29 14:19:59,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (254 of 292 remaining) [2024-01-29 14:19:59,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (253 of 292 remaining) [2024-01-29 14:19:59,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (252 of 292 remaining) [2024-01-29 14:19:59,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (251 of 292 remaining) [2024-01-29 14:19:59,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (250 of 292 remaining) [2024-01-29 14:19:59,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (249 of 292 remaining) [2024-01-29 14:19:59,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (248 of 292 remaining) [2024-01-29 14:19:59,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (247 of 292 remaining) [2024-01-29 14:19:59,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (246 of 292 remaining) [2024-01-29 14:19:59,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (245 of 292 remaining) [2024-01-29 14:19:59,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (244 of 292 remaining) [2024-01-29 14:19:59,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (243 of 292 remaining) [2024-01-29 14:19:59,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (242 of 292 remaining) [2024-01-29 14:19:59,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (241 of 292 remaining) [2024-01-29 14:19:59,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (240 of 292 remaining) [2024-01-29 14:19:59,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (239 of 292 remaining) [2024-01-29 14:19:59,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (238 of 292 remaining) [2024-01-29 14:19:59,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (237 of 292 remaining) [2024-01-29 14:19:59,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (236 of 292 remaining) [2024-01-29 14:19:59,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (235 of 292 remaining) [2024-01-29 14:19:59,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (234 of 292 remaining) [2024-01-29 14:19:59,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (233 of 292 remaining) [2024-01-29 14:19:59,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (232 of 292 remaining) [2024-01-29 14:19:59,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (231 of 292 remaining) [2024-01-29 14:19:59,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (230 of 292 remaining) [2024-01-29 14:19:59,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (229 of 292 remaining) [2024-01-29 14:19:59,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (228 of 292 remaining) [2024-01-29 14:19:59,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (227 of 292 remaining) [2024-01-29 14:19:59,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (226 of 292 remaining) [2024-01-29 14:19:59,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (225 of 292 remaining) [2024-01-29 14:19:59,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (224 of 292 remaining) [2024-01-29 14:19:59,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (223 of 292 remaining) [2024-01-29 14:19:59,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (222 of 292 remaining) [2024-01-29 14:19:59,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (221 of 292 remaining) [2024-01-29 14:19:59,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (220 of 292 remaining) [2024-01-29 14:19:59,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (219 of 292 remaining) [2024-01-29 14:19:59,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (218 of 292 remaining) [2024-01-29 14:19:59,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (217 of 292 remaining) [2024-01-29 14:19:59,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (216 of 292 remaining) [2024-01-29 14:19:59,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (215 of 292 remaining) [2024-01-29 14:19:59,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (214 of 292 remaining) [2024-01-29 14:19:59,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (213 of 292 remaining) [2024-01-29 14:19:59,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (212 of 292 remaining) [2024-01-29 14:19:59,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (211 of 292 remaining) [2024-01-29 14:19:59,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (210 of 292 remaining) [2024-01-29 14:19:59,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (209 of 292 remaining) [2024-01-29 14:19:59,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (208 of 292 remaining) [2024-01-29 14:19:59,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (207 of 292 remaining) [2024-01-29 14:19:59,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (206 of 292 remaining) [2024-01-29 14:19:59,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (205 of 292 remaining) [2024-01-29 14:19:59,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (204 of 292 remaining) [2024-01-29 14:19:59,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (203 of 292 remaining) [2024-01-29 14:19:59,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (202 of 292 remaining) [2024-01-29 14:19:59,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (201 of 292 remaining) [2024-01-29 14:19:59,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (200 of 292 remaining) [2024-01-29 14:19:59,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 292 remaining) [2024-01-29 14:19:59,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 292 remaining) [2024-01-29 14:19:59,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 292 remaining) [2024-01-29 14:19:59,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 292 remaining) [2024-01-29 14:19:59,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 292 remaining) [2024-01-29 14:19:59,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 292 remaining) [2024-01-29 14:19:59,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 292 remaining) [2024-01-29 14:19:59,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 292 remaining) [2024-01-29 14:19:59,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 292 remaining) [2024-01-29 14:19:59,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 292 remaining) [2024-01-29 14:19:59,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 292 remaining) [2024-01-29 14:19:59,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 292 remaining) [2024-01-29 14:19:59,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 292 remaining) [2024-01-29 14:19:59,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 292 remaining) [2024-01-29 14:19:59,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 292 remaining) [2024-01-29 14:19:59,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 292 remaining) [2024-01-29 14:19:59,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 292 remaining) [2024-01-29 14:19:59,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 292 remaining) [2024-01-29 14:19:59,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 292 remaining) [2024-01-29 14:19:59,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 292 remaining) [2024-01-29 14:19:59,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 292 remaining) [2024-01-29 14:19:59,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 292 remaining) [2024-01-29 14:19:59,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 292 remaining) [2024-01-29 14:19:59,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 292 remaining) [2024-01-29 14:19:59,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 292 remaining) [2024-01-29 14:19:59,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 292 remaining) [2024-01-29 14:19:59,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 292 remaining) [2024-01-29 14:19:59,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 292 remaining) [2024-01-29 14:19:59,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 292 remaining) [2024-01-29 14:19:59,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 292 remaining) [2024-01-29 14:19:59,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 292 remaining) [2024-01-29 14:19:59,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 292 remaining) [2024-01-29 14:19:59,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 292 remaining) [2024-01-29 14:19:59,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 292 remaining) [2024-01-29 14:19:59,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 292 remaining) [2024-01-29 14:19:59,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 292 remaining) [2024-01-29 14:19:59,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 292 remaining) [2024-01-29 14:19:59,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 292 remaining) [2024-01-29 14:19:59,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 292 remaining) [2024-01-29 14:19:59,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 292 remaining) [2024-01-29 14:19:59,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 292 remaining) [2024-01-29 14:19:59,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 292 remaining) [2024-01-29 14:19:59,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 292 remaining) [2024-01-29 14:19:59,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 292 remaining) [2024-01-29 14:19:59,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 292 remaining) [2024-01-29 14:19:59,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 292 remaining) [2024-01-29 14:19:59,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 292 remaining) [2024-01-29 14:19:59,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 292 remaining) [2024-01-29 14:19:59,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 292 remaining) [2024-01-29 14:19:59,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 292 remaining) [2024-01-29 14:19:59,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 292 remaining) [2024-01-29 14:19:59,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 292 remaining) [2024-01-29 14:19:59,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 292 remaining) [2024-01-29 14:19:59,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 292 remaining) [2024-01-29 14:19:59,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 292 remaining) [2024-01-29 14:19:59,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 292 remaining) [2024-01-29 14:19:59,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 292 remaining) [2024-01-29 14:19:59,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 292 remaining) [2024-01-29 14:19:59,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 292 remaining) [2024-01-29 14:19:59,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 292 remaining) [2024-01-29 14:19:59,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 292 remaining) [2024-01-29 14:19:59,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 292 remaining) [2024-01-29 14:19:59,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 292 remaining) [2024-01-29 14:19:59,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 292 remaining) [2024-01-29 14:19:59,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 292 remaining) [2024-01-29 14:19:59,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 292 remaining) [2024-01-29 14:19:59,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 292 remaining) [2024-01-29 14:19:59,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 292 remaining) [2024-01-29 14:19:59,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 292 remaining) [2024-01-29 14:19:59,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 292 remaining) [2024-01-29 14:19:59,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 292 remaining) [2024-01-29 14:19:59,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 292 remaining) [2024-01-29 14:19:59,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 292 remaining) [2024-01-29 14:19:59,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 292 remaining) [2024-01-29 14:19:59,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 292 remaining) [2024-01-29 14:19:59,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 292 remaining) [2024-01-29 14:19:59,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 292 remaining) [2024-01-29 14:19:59,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 292 remaining) [2024-01-29 14:19:59,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 292 remaining) [2024-01-29 14:19:59,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 292 remaining) [2024-01-29 14:19:59,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 292 remaining) [2024-01-29 14:19:59,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 292 remaining) [2024-01-29 14:19:59,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 292 remaining) [2024-01-29 14:19:59,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 292 remaining) [2024-01-29 14:19:59,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 292 remaining) [2024-01-29 14:19:59,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 292 remaining) [2024-01-29 14:19:59,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 292 remaining) [2024-01-29 14:19:59,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 292 remaining) [2024-01-29 14:19:59,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 292 remaining) [2024-01-29 14:19:59,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 292 remaining) [2024-01-29 14:19:59,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 292 remaining) [2024-01-29 14:19:59,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 292 remaining) [2024-01-29 14:19:59,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 292 remaining) [2024-01-29 14:19:59,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 292 remaining) [2024-01-29 14:19:59,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 292 remaining) [2024-01-29 14:19:59,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 292 remaining) [2024-01-29 14:19:59,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 292 remaining) [2024-01-29 14:19:59,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 292 remaining) [2024-01-29 14:19:59,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 292 remaining) [2024-01-29 14:19:59,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 292 remaining) [2024-01-29 14:19:59,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 292 remaining) [2024-01-29 14:19:59,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 292 remaining) [2024-01-29 14:19:59,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 292 remaining) [2024-01-29 14:19:59,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 292 remaining) [2024-01-29 14:19:59,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 292 remaining) [2024-01-29 14:19:59,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 292 remaining) [2024-01-29 14:19:59,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 292 remaining) [2024-01-29 14:19:59,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 292 remaining) [2024-01-29 14:19:59,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 292 remaining) [2024-01-29 14:19:59,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 292 remaining) [2024-01-29 14:19:59,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 292 remaining) [2024-01-29 14:19:59,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 292 remaining) [2024-01-29 14:19:59,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 292 remaining) [2024-01-29 14:19:59,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 292 remaining) [2024-01-29 14:19:59,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 292 remaining) [2024-01-29 14:19:59,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 292 remaining) [2024-01-29 14:19:59,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 292 remaining) [2024-01-29 14:19:59,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 292 remaining) [2024-01-29 14:19:59,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 292 remaining) [2024-01-29 14:19:59,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 292 remaining) [2024-01-29 14:19:59,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 292 remaining) [2024-01-29 14:19:59,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 292 remaining) [2024-01-29 14:19:59,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 292 remaining) [2024-01-29 14:19:59,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 292 remaining) [2024-01-29 14:19:59,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 292 remaining) [2024-01-29 14:19:59,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 292 remaining) [2024-01-29 14:19:59,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 292 remaining) [2024-01-29 14:19:59,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 292 remaining) [2024-01-29 14:19:59,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 292 remaining) [2024-01-29 14:19:59,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 292 remaining) [2024-01-29 14:19:59,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 292 remaining) [2024-01-29 14:19:59,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 292 remaining) [2024-01-29 14:19:59,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 292 remaining) [2024-01-29 14:19:59,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 292 remaining) [2024-01-29 14:19:59,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 292 remaining) [2024-01-29 14:19:59,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 292 remaining) [2024-01-29 14:19:59,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 292 remaining) [2024-01-29 14:19:59,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 292 remaining) [2024-01-29 14:19:59,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 292 remaining) [2024-01-29 14:19:59,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 292 remaining) [2024-01-29 14:19:59,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 292 remaining) [2024-01-29 14:19:59,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 292 remaining) [2024-01-29 14:19:59,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 292 remaining) [2024-01-29 14:19:59,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 292 remaining) [2024-01-29 14:19:59,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 292 remaining) [2024-01-29 14:19:59,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 292 remaining) [2024-01-29 14:19:59,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 292 remaining) [2024-01-29 14:19:59,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 292 remaining) [2024-01-29 14:19:59,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 292 remaining) [2024-01-29 14:19:59,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193ASSERT_VIOLATIONERROR_FUNCTION (50 of 292 remaining) [2024-01-29 14:19:59,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 292 remaining) [2024-01-29 14:19:59,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 292 remaining) [2024-01-29 14:19:59,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 292 remaining) [2024-01-29 14:19:59,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 292 remaining) [2024-01-29 14:19:59,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 292 remaining) [2024-01-29 14:19:59,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 292 remaining) [2024-01-29 14:19:59,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 292 remaining) [2024-01-29 14:19:59,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 292 remaining) [2024-01-29 14:19:59,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 292 remaining) [2024-01-29 14:19:59,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 292 remaining) [2024-01-29 14:19:59,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 292 remaining) [2024-01-29 14:19:59,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 292 remaining) [2024-01-29 14:19:59,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 292 remaining) [2024-01-29 14:19:59,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 292 remaining) [2024-01-29 14:19:59,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 292 remaining) [2024-01-29 14:19:59,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 292 remaining) [2024-01-29 14:19:59,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 292 remaining) [2024-01-29 14:19:59,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 292 remaining) [2024-01-29 14:19:59,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 292 remaining) [2024-01-29 14:19:59,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 292 remaining) [2024-01-29 14:19:59,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 292 remaining) [2024-01-29 14:19:59,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 292 remaining) [2024-01-29 14:19:59,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 292 remaining) [2024-01-29 14:19:59,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 292 remaining) [2024-01-29 14:19:59,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 292 remaining) [2024-01-29 14:19:59,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 292 remaining) [2024-01-29 14:19:59,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 292 remaining) [2024-01-29 14:19:59,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 292 remaining) [2024-01-29 14:19:59,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 292 remaining) [2024-01-29 14:19:59,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 292 remaining) [2024-01-29 14:19:59,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 292 remaining) [2024-01-29 14:19:59,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 292 remaining) [2024-01-29 14:19:59,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 292 remaining) [2024-01-29 14:19:59,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 292 remaining) [2024-01-29 14:19:59,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 292 remaining) [2024-01-29 14:19:59,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 292 remaining) [2024-01-29 14:19:59,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 292 remaining) [2024-01-29 14:19:59,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 292 remaining) [2024-01-29 14:19:59,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 292 remaining) [2024-01-29 14:19:59,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 292 remaining) [2024-01-29 14:19:59,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 292 remaining) [2024-01-29 14:19:59,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 292 remaining) [2024-01-29 14:19:59,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 292 remaining) [2024-01-29 14:19:59,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 292 remaining) [2024-01-29 14:19:59,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 292 remaining) [2024-01-29 14:19:59,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 292 remaining) [2024-01-29 14:19:59,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 292 remaining) [2024-01-29 14:19:59,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 292 remaining) [2024-01-29 14:19:59,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 292 remaining) [2024-01-29 14:19:59,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 292 remaining) [2024-01-29 14:19:59,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 14:19:59,263 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:59,269 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 14:19:59,269 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 14:19:59,362 INFO L503 ceAbstractionStarter]: Automizer considered 241 witness invariants [2024-01-29 14:19:59,362 INFO L504 ceAbstractionStarter]: WitnessConsidered=241 [2024-01-29 14:19:59,363 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 02:19:59 BasicIcfg [2024-01-29 14:19:59,363 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 14:19:59,365 INFO L158 Benchmark]: Toolchain (without parser) took 11041.89ms. Allocated memory was 159.4MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 76.4MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 840.2MB. Max. memory is 16.1GB. [2024-01-29 14:19:59,365 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:19:59,365 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:19:59,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.37ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 76.2MB in the beginning and 167.5MB in the end (delta: -91.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-01-29 14:19:59,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.01ms. Allocated memory is still 220.2MB. Free memory was 167.5MB in the beginning and 164.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:19:59,366 INFO L158 Benchmark]: Boogie Preprocessor took 56.86ms. Allocated memory is still 220.2MB. Free memory was 164.4MB in the beginning and 160.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:19:59,366 INFO L158 Benchmark]: RCFGBuilder took 1159.09ms. Allocated memory is still 220.2MB. Free memory was 160.2MB in the beginning and 155.8MB in the end (delta: 4.4MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB. [2024-01-29 14:19:59,366 INFO L158 Benchmark]: TraceAbstraction took 9392.22ms. Allocated memory was 220.2MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 154.7MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 855.2MB. Max. memory is 16.1GB. [2024-01-29 14:19:59,368 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.37ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 76.2MB in the beginning and 167.5MB in the end (delta: -91.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.01ms. Allocated memory is still 220.2MB. Free memory was 167.5MB in the beginning and 164.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.86ms. Allocated memory is still 220.2MB. Free memory was 164.4MB in the beginning and 160.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1159.09ms. Allocated memory is still 220.2MB. Free memory was 160.2MB in the beginning and 155.8MB in the end (delta: 4.4MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9392.22ms. Allocated memory was 220.2MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 154.7MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 855.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 117]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L41] int *queue, *A; [L42] int i, N, n, last, start, end, new, v_old; [L43] _Bool ok; [L86] pthread_t t1, t2; VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={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[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[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[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[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[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[ok],CastExpression[ACSLType[_Bool],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[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[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[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[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[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[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,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] [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[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[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] [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[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[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[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[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[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[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[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[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[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[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[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] [L89] N = __VERIFIER_nondet_int() [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[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[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[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[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] [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[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[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[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[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[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[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[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] [L90] n = __VERIFIER_nondet_int() [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[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[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[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[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[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[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[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[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[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[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[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L91] start = __VERIFIER_nondet_int() [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[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[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[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[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[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]]]] 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]]]] [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[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] [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[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[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[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[A],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[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] [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[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] [L113] CALL assume_abort_if_not(size >= 0) [L38] COND FALSE !(!cond) [L113] RET assume_abort_if_not(size >= 0) [L114] CodeAnnotStmt[Assertion[BinaryExpression[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]]]]] 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[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]]]] [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[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[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] [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[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[i],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[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[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] 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[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[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[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] 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[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[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[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[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[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[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[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] 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[last],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] [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=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: 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: 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: 9.2s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1617 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 895 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 463 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2805 IncrementalHoareTripleChecker+Invalid, 3268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 463 mSolverCounterUnsat, 178 mSDtfsCounter, 2805 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=964occurred in iteration=0, InterpolantAutomatonStates: 54, 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.7s InterpolantComputationTime, 692 NumberOfCodeBlocks, 692 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 564 ConstructedInterpolants, 0 QuantifiedInterpolants, 1406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-29 14:19:59,444 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