./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.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/chl-simpl-str-trans.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cb09d658 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-simpl-str-trans.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-cb09d65-m [2024-01-27 23:08:25,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 23:08:25,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 23:08:25,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 23:08:25,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 23:08:25,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 23:08:25,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 23:08:25,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 23:08:25,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 23:08:25,145 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 23:08:25,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 23:08:25,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 23:08:25,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 23:08:25,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 23:08:25,148 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 23:08:25,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 23:08:25,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 23:08:25,148 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 23:08:25,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 23:08:25,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 23:08:25,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 23:08:25,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 23:08:25,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 23:08:25,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 23:08:25,150 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 23:08:25,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 23:08:25,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 23:08:25,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 23:08:25,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 23:08:25,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 23:08:25,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 23:08:25,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 23:08:25,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:08:25,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 23:08:25,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 23:08:25,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 23:08:25,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 23:08:25,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 23:08:25,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 23:08:25,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 23:08:25,162 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 23:08:25,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 23:08:25,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 23:08:25,162 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-27 23:08:25,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 23:08:25,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 23:08:25,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 23:08:25,363 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 23:08:25,363 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 23:08:25,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2024-01-27 23:08:26,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 23:08:26,443 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 23:08:26,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2024-01-27 23:08:26,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ae038a7/b9878fd690c64eca82e6c0f464b4205a/FLAGf93262974 [2024-01-27 23:08:26,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ae038a7/b9878fd690c64eca82e6c0f464b4205a [2024-01-27 23:08:26,465 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 23:08:26,466 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 23:08:26,466 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/chl-simpl-str-trans.wvr.yml/witness.yml [2024-01-27 23:08:26,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 23:08:26,544 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 23:08:26,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 23:08:26,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 23:08:26,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 23:08:26,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:08:26" (1/2) ... [2024-01-27 23:08:26,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7217d9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:26, skipping insertion in model container [2024-01-27 23:08:26,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:08:26" (1/2) ... [2024-01-27 23:08:26,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@8c4b5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:26, skipping insertion in model container [2024-01-27 23:08:26,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:08:26" (2/2) ... [2024-01-27 23:08:26,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7217d9d3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:26, skipping insertion in model container [2024-01-27 23:08:26,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:08:26" (2/2) ... [2024-01-27 23:08:26,554 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 23:08:26,581 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 23:08:26,583 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-27 23:08:26,583 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] b <= -1 [2024-01-27 23:08:26,583 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] b != 0 [2024-01-27 23:08:26,583 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-27 23:08:26,583 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-01-27 23:08:26,584 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_8 == 0 [2024-01-27 23:08:26,584 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_7 == 0 [2024-01-27 23:08:26,584 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_6 == 0 [2024-01-27 23:08:26,584 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_6 == 0 [2024-01-27 23:08:26,584 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_8 == 0 [2024-01-27 23:08:26,585 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_7 == 0 [2024-01-27 23:08:26,585 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] to_int_5 == 0 [2024-01-27 23:08:26,585 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] 1 <= b [2024-01-27 23:08:26,585 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] b != 0 [2024-01-27 23:08:26,585 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_8 == 0 [2024-01-27 23:08:26,585 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_6 == 0 [2024-01-27 23:08:26,585 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] to_int_3 == 0 [2024-01-27 23:08:26,586 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] length_4 == 0 [2024-01-27 23:08:26,586 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] to_int_5 == 0 [2024-01-27 23:08:26,586 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] length_2 == 0 [2024-01-27 23:08:26,586 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_7 == 0 [2024-01-27 23:08:26,586 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_7 == 0 [2024-01-27 23:08:26,587 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_8 == 0 [2024-01-27 23:08:26,587 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] to_int_3 == 0 [2024-01-27 23:08:26,587 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_6 == 0 [2024-01-27 23:08:26,587 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] length_4 == 0 [2024-01-27 23:08:26,587 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] to_int_5 == 0 [2024-01-27 23:08:26,587 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_7 == 0 [2024-01-27 23:08:26,588 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] length_4 == 0 [2024-01-27 23:08:26,588 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] to_int_3 == 0 [2024-01-27 23:08:26,588 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] to_int_5 == 0 [2024-01-27 23:08:26,588 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] to_int_1 == 0 [2024-01-27 23:08:26,588 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] length_2 == 0 [2024-01-27 23:08:26,588 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_6 == 0 [2024-01-27 23:08:26,588 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_8 == 0 [2024-01-27 23:08:26,589 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_8 == 0 [2024-01-27 23:08:26,589 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_6 == 0 [2024-01-27 23:08:26,589 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] length_4 == 0 [2024-01-27 23:08:26,590 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] to_int_5 == 0 [2024-01-27 23:08:26,591 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_7 == 0 [2024-01-27 23:08:26,591 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_7 == 0 [2024-01-27 23:08:26,591 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_8 == 0 [2024-01-27 23:08:26,591 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] to_int_5 == 0 [2024-01-27 23:08:26,591 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] length_2 == 0 [2024-01-27 23:08:26,591 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] length_4 == 0 [2024-01-27 23:08:26,591 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] length_0 == 0 [2024-01-27 23:08:26,591 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] to_int_1 == 0 [2024-01-27 23:08:26,591 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] to_int_3 == 0 [2024-01-27 23:08:26,591 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_6 == 0 [2024-01-27 23:08:26,591 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_7 == 0 [2024-01-27 23:08:26,592 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] to_int_5 == 0 [2024-01-27 23:08:26,592 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_6 == 0 [2024-01-27 23:08:26,592 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_8 == 0 [2024-01-27 23:08:26,609 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 23:08:26,736 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/chl-simpl-str-trans.wvr.c[2553,2566] [2024-01-27 23:08:26,741 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:08:26,747 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 23:08:26,755 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 [2024-01-27 23:08:26,788 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/chl-simpl-str-trans.wvr.c[2553,2566] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 23:08:26,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:08:26,801 INFO L206 MainTranslator]: Completed translation [2024-01-27 23:08:26,801 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:26 WrapperNode [2024-01-27 23:08:26,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 23:08:26,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 23:08:26,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 23:08:26,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 23:08:26,807 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 27.01 11:08:26" (1/1) ... [2024-01-27 23:08:26,815 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 27.01 11:08:26" (1/1) ... [2024-01-27 23:08:26,834 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 228 [2024-01-27 23:08:26,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 23:08:26,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 23:08:26,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 23:08:26,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 23:08:26,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:26" (1/1) ... [2024-01-27 23:08:26,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:26" (1/1) ... [2024-01-27 23:08:26,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:26" (1/1) ... [2024-01-27 23:08:26,854 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 23:08:26,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:26" (1/1) ... [2024-01-27 23:08:26,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:26" (1/1) ... [2024-01-27 23:08:26,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:26" (1/1) ... [2024-01-27 23:08:26,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:26" (1/1) ... [2024-01-27 23:08:26,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:26" (1/1) ... [2024-01-27 23:08:26,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:26" (1/1) ... [2024-01-27 23:08:26,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 23:08:26,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 23:08:26,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 23:08:26,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 23:08:26,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:26" (1/1) ... [2024-01-27 23:08:26,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:08:26,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 23:08:26,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 23:08:26,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 23:08:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 23:08:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 23:08:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 23:08:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 23:08:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 23:08:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 23:08:26,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 23:08:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 23:08:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 23:08:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 23:08:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 23:08:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 23:08:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 23:08:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 23:08:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 23:08:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 23:08:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 23:08:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 23:08:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 23:08:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 23:08:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 23:08:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 23:08:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 23:08:26,969 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 23:08:27,066 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 23:08:27,068 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 23:08:27,351 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 23:08:27,352 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 23:08:27,474 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 23:08:27,475 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 23:08:27,476 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:08:27 BoogieIcfgContainer [2024-01-27 23:08:27,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 23:08:27,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 23:08:27,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 23:08:27,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 23:08:27,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:08:26" (1/4) ... [2024-01-27 23:08:27,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39050590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:08:27, skipping insertion in model container [2024-01-27 23:08:27,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:08:26" (2/4) ... [2024-01-27 23:08:27,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39050590 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:08:27, skipping insertion in model container [2024-01-27 23:08:27,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:26" (3/4) ... [2024-01-27 23:08:27,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39050590 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:08:27, skipping insertion in model container [2024-01-27 23:08:27,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:08:27" (4/4) ... [2024-01-27 23:08:27,486 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2024-01-27 23:08:27,499 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 23:08:27,500 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-01-27 23:08:27,500 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 23:08:27,569 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 23:08:27,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 153 transitions, 327 flow [2024-01-27 23:08:27,654 INFO L124 PetriNetUnfolderBase]: 6/150 cut-off events. [2024-01-27 23:08:27,655 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 23:08:27,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 6/150 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 252 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2024-01-27 23:08:27,658 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 153 transitions, 327 flow [2024-01-27 23:08:27,666 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 149 transitions, 316 flow [2024-01-27 23:08:27,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 23:08:27,683 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;@50081546, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 23:08:27,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2024-01-27 23:08:27,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 23:08:27,685 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 23:08:27,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:08:27,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:27,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 23:08:27,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-27 23:08:27,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:27,690 INFO L85 PathProgramCache]: Analyzing trace with hash 20124, now seen corresponding path program 1 times [2024-01-27 23:08:27,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:27,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702688081] [2024-01-27 23:08:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:27,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:27,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702688081] [2024-01-27 23:08:27,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702688081] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:27,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:27,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:27,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231843572] [2024-01-27 23:08:27,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:27,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:27,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:27,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:27,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:27,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 153 [2024-01-27 23:08:27,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 149 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:27,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:27,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 153 [2024-01-27 23:08:27,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:28,422 INFO L124 PetriNetUnfolderBase]: 2167/3625 cut-off events. [2024-01-27 23:08:28,423 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2024-01-27 23:08:28,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6864 conditions, 3625 events. 2167/3625 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 24553 event pairs, 1112 based on Foata normal form. 0/3045 useless extension candidates. Maximal degree in co-relation 6056. Up to 1961 conditions per place. [2024-01-27 23:08:28,455 INFO L140 encePairwiseOnDemand]: 144/153 looper letters, 65 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2024-01-27 23:08:28,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 161 transitions, 480 flow [2024-01-27 23:08:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2024-01-27 23:08:28,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7952069716775599 [2024-01-27 23:08:28,479 INFO L175 Difference]: Start difference. First operand has 153 places, 149 transitions, 316 flow. Second operand 3 states and 365 transitions. [2024-01-27 23:08:28,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 161 transitions, 480 flow [2024-01-27 23:08:28,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 161 transitions, 464 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 23:08:28,493 INFO L231 Difference]: Finished difference. Result has 142 places, 142 transitions, 294 flow [2024-01-27 23:08:28,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=142, PETRI_TRANSITIONS=142} [2024-01-27 23:08:28,499 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -11 predicate places. [2024-01-27 23:08:28,499 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 142 transitions, 294 flow [2024-01-27 23:08:28,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:28,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:28,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 23:08:28,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 23:08:28,500 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-27 23:08:28,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:28,501 INFO L85 PathProgramCache]: Analyzing trace with hash 624463, now seen corresponding path program 1 times [2024-01-27 23:08:28,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:28,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169091516] [2024-01-27 23:08:28,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:28,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:28,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:28,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169091516] [2024-01-27 23:08:28,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169091516] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:28,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:28,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444931200] [2024-01-27 23:08:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:28,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:28,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:28,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:28,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:28,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2024-01-27 23:08:28,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 142 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:28,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:28,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2024-01-27 23:08:28,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:28,913 INFO L124 PetriNetUnfolderBase]: 2172/3606 cut-off events. [2024-01-27 23:08:28,913 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2024-01-27 23:08:28,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6841 conditions, 3606 events. 2172/3606 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 23903 event pairs, 1782 based on Foata normal form. 0/2981 useless extension candidates. Maximal degree in co-relation 4401. Up to 3053 conditions per place. [2024-01-27 23:08:28,930 INFO L140 encePairwiseOnDemand]: 147/153 looper letters, 43 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2024-01-27 23:08:28,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 138 transitions, 376 flow [2024-01-27 23:08:28,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2024-01-27 23:08:28,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7799564270152506 [2024-01-27 23:08:28,932 INFO L175 Difference]: Start difference. First operand has 142 places, 142 transitions, 294 flow. Second operand 3 states and 358 transitions. [2024-01-27 23:08:28,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 138 transitions, 376 flow [2024-01-27 23:08:28,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 138 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:28,936 INFO L231 Difference]: Finished difference. Result has 138 places, 138 transitions, 286 flow [2024-01-27 23:08:28,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=138, PETRI_TRANSITIONS=138} [2024-01-27 23:08:28,937 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -15 predicate places. [2024-01-27 23:08:28,937 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 138 transitions, 286 flow [2024-01-27 23:08:28,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:28,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:28,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 23:08:28,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 23:08:28,938 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-27 23:08:28,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:28,940 INFO L85 PathProgramCache]: Analyzing trace with hash 19359081, now seen corresponding path program 1 times [2024-01-27 23:08:28,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:28,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215860701] [2024-01-27 23:08:28,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:28,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:28,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:28,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215860701] [2024-01-27 23:08:28,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215860701] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:28,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:28,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:28,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505708908] [2024-01-27 23:08:28,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:28,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:28,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:28,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:28,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:28,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 153 [2024-01-27 23:08:28,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 138 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:28,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:28,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 153 [2024-01-27 23:08:28,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:29,289 INFO L124 PetriNetUnfolderBase]: 2172/3604 cut-off events. [2024-01-27 23:08:29,290 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-01-27 23:08:29,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6724 conditions, 3604 events. 2172/3604 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 23974 event pairs, 1782 based on Foata normal form. 0/2981 useless extension candidates. Maximal degree in co-relation 6661. Up to 3055 conditions per place. [2024-01-27 23:08:29,308 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 41 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2024-01-27 23:08:29,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 136 transitions, 368 flow [2024-01-27 23:08:29,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2024-01-27 23:08:29,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7973856209150327 [2024-01-27 23:08:29,309 INFO L175 Difference]: Start difference. First operand has 138 places, 138 transitions, 286 flow. Second operand 3 states and 366 transitions. [2024-01-27 23:08:29,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 136 transitions, 368 flow [2024-01-27 23:08:29,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:29,311 INFO L231 Difference]: Finished difference. Result has 136 places, 136 transitions, 282 flow [2024-01-27 23:08:29,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=136, PETRI_TRANSITIONS=136} [2024-01-27 23:08:29,312 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -17 predicate places. [2024-01-27 23:08:29,312 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 136 transitions, 282 flow [2024-01-27 23:08:29,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:29,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:29,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 23:08:29,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 23:08:29,313 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-27 23:08:29,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:29,313 INFO L85 PathProgramCache]: Analyzing trace with hash 600132250, now seen corresponding path program 1 times [2024-01-27 23:08:29,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:29,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998736551] [2024-01-27 23:08:29,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:29,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:29,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:29,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998736551] [2024-01-27 23:08:29,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998736551] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:29,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:29,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:29,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570456130] [2024-01-27 23:08:29,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:29,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:29,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:29,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:29,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:29,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 153 [2024-01-27 23:08:29,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 136 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:29,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:29,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 153 [2024-01-27 23:08:29,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:29,902 INFO L124 PetriNetUnfolderBase]: 3949/7038 cut-off events. [2024-01-27 23:08:29,903 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-01-27 23:08:29,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12672 conditions, 7038 events. 3949/7038 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 53964 event pairs, 2148 based on Foata normal form. 0/5875 useless extension candidates. Maximal degree in co-relation 12635. Up to 3056 conditions per place. [2024-01-27 23:08:29,933 INFO L140 encePairwiseOnDemand]: 146/153 looper letters, 72 selfloop transitions, 4 changer transitions 0/167 dead transitions. [2024-01-27 23:08:29,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 167 transitions, 501 flow [2024-01-27 23:08:29,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2024-01-27 23:08:29,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8714596949891068 [2024-01-27 23:08:29,935 INFO L175 Difference]: Start difference. First operand has 136 places, 136 transitions, 282 flow. Second operand 3 states and 400 transitions. [2024-01-27 23:08:29,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 167 transitions, 501 flow [2024-01-27 23:08:29,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 167 transitions, 497 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:29,938 INFO L231 Difference]: Finished difference. Result has 137 places, 137 transitions, 304 flow [2024-01-27 23:08:29,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=137, PETRI_TRANSITIONS=137} [2024-01-27 23:08:29,939 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -16 predicate places. [2024-01-27 23:08:29,940 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 137 transitions, 304 flow [2024-01-27 23:08:29,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:29,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:29,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 23:08:29,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 23:08:29,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-27 23:08:29,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:29,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1424231171, now seen corresponding path program 1 times [2024-01-27 23:08:29,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:29,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393002122] [2024-01-27 23:08:29,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:29,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:29,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393002122] [2024-01-27 23:08:29,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393002122] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:29,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:29,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843019805] [2024-01-27 23:08:29,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:29,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:29,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:29,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:29,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 153 [2024-01-27 23:08:29,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 137 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:29,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:29,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 153 [2024-01-27 23:08:29,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:30,678 INFO L124 PetriNetUnfolderBase]: 5454/9293 cut-off events. [2024-01-27 23:08:30,678 INFO L125 PetriNetUnfolderBase]: For 1546/1778 co-relation queries the response was YES. [2024-01-27 23:08:30,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18050 conditions, 9293 events. 5454/9293 cut-off events. For 1546/1778 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 71493 event pairs, 2882 based on Foata normal form. 0/8175 useless extension candidates. Maximal degree in co-relation 9158. Up to 4600 conditions per place. [2024-01-27 23:08:30,726 INFO L140 encePairwiseOnDemand]: 142/153 looper letters, 74 selfloop transitions, 4 changer transitions 0/162 dead transitions. [2024-01-27 23:08:30,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 162 transitions, 526 flow [2024-01-27 23:08:30,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2024-01-27 23:08:30,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8366013071895425 [2024-01-27 23:08:30,728 INFO L175 Difference]: Start difference. First operand has 137 places, 137 transitions, 304 flow. Second operand 3 states and 384 transitions. [2024-01-27 23:08:30,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 162 transitions, 526 flow [2024-01-27 23:08:30,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 162 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:30,734 INFO L231 Difference]: Finished difference. Result has 134 places, 134 transitions, 314 flow [2024-01-27 23:08:30,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=134, PETRI_TRANSITIONS=134} [2024-01-27 23:08:30,736 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -19 predicate places. [2024-01-27 23:08:30,736 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 134 transitions, 314 flow [2024-01-27 23:08:30,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:30,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:30,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:30,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 23:08:30,737 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-27 23:08:30,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:30,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1201494048, now seen corresponding path program 1 times [2024-01-27 23:08:30,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:30,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622214606] [2024-01-27 23:08:30,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:30,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:30,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:30,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622214606] [2024-01-27 23:08:30,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622214606] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:30,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:30,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:30,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587840552] [2024-01-27 23:08:30,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:30,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:30,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:30,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:30,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:30,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 153 [2024-01-27 23:08:30,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 134 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:30,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:30,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 153 [2024-01-27 23:08:30,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:31,912 INFO L124 PetriNetUnfolderBase]: 8724/14737 cut-off events. [2024-01-27 23:08:31,912 INFO L125 PetriNetUnfolderBase]: For 3567/4054 co-relation queries the response was YES. [2024-01-27 23:08:31,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30471 conditions, 14737 events. 8724/14737 cut-off events. For 3567/4054 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 116830 event pairs, 4832 based on Foata normal form. 0/13522 useless extension candidates. Maximal degree in co-relation 18574. Up to 7572 conditions per place. [2024-01-27 23:08:31,971 INFO L140 encePairwiseOnDemand]: 144/153 looper letters, 80 selfloop transitions, 4 changer transitions 0/166 dead transitions. [2024-01-27 23:08:31,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 166 transitions, 575 flow [2024-01-27 23:08:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:31,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2024-01-27 23:08:31,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8562091503267973 [2024-01-27 23:08:31,973 INFO L175 Difference]: Start difference. First operand has 134 places, 134 transitions, 314 flow. Second operand 3 states and 393 transitions. [2024-01-27 23:08:31,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 166 transitions, 575 flow [2024-01-27 23:08:31,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 166 transitions, 563 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:31,989 INFO L231 Difference]: Finished difference. Result has 133 places, 133 transitions, 328 flow [2024-01-27 23:08:31,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=133, PETRI_TRANSITIONS=133} [2024-01-27 23:08:31,991 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -20 predicate places. [2024-01-27 23:08:31,992 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 133 transitions, 328 flow [2024-01-27 23:08:31,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:31,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:31,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:31,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 23:08:31,993 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-27 23:08:31,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1408389541, now seen corresponding path program 1 times [2024-01-27 23:08:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:31,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436493957] [2024-01-27 23:08:31,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:31,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:32,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:32,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436493957] [2024-01-27 23:08:32,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436493957] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:32,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:32,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:32,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385718719] [2024-01-27 23:08:32,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:32,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:32,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:32,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:32,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:32,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 153 [2024-01-27 23:08:32,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 133 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:32,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:32,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 153 [2024-01-27 23:08:32,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:33,009 INFO L124 PetriNetUnfolderBase]: 8542/14350 cut-off events. [2024-01-27 23:08:33,009 INFO L125 PetriNetUnfolderBase]: For 3801/4298 co-relation queries the response was YES. [2024-01-27 23:08:33,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30819 conditions, 14350 events. 8542/14350 cut-off events. For 3801/4298 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 114376 event pairs, 7157 based on Foata normal form. 0/12704 useless extension candidates. Maximal degree in co-relation 17768. Up to 12309 conditions per place. [2024-01-27 23:08:33,226 INFO L140 encePairwiseOnDemand]: 145/153 looper letters, 51 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-01-27 23:08:33,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 127 transitions, 422 flow [2024-01-27 23:08:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2024-01-27 23:08:33,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7625272331154684 [2024-01-27 23:08:33,228 INFO L175 Difference]: Start difference. First operand has 133 places, 133 transitions, 328 flow. Second operand 3 states and 350 transitions. [2024-01-27 23:08:33,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 127 transitions, 422 flow [2024-01-27 23:08:33,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 127 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:33,234 INFO L231 Difference]: Finished difference. Result has 127 places, 127 transitions, 312 flow [2024-01-27 23:08:33,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=127, PETRI_TRANSITIONS=127} [2024-01-27 23:08:33,235 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -26 predicate places. [2024-01-27 23:08:33,235 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 127 transitions, 312 flow [2024-01-27 23:08:33,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:33,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:33,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:33,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 23:08:33,236 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-27 23:08:33,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:33,236 INFO L85 PathProgramCache]: Analyzing trace with hash -710402159, now seen corresponding path program 1 times [2024-01-27 23:08:33,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:33,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672831766] [2024-01-27 23:08:33,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:33,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:33,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:33,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672831766] [2024-01-27 23:08:33,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672831766] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:33,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:33,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:33,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701140919] [2024-01-27 23:08:33,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:33,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:33,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:33,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:33,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:33,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 153 [2024-01-27 23:08:33,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 127 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:33,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:33,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 153 [2024-01-27 23:08:33,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:34,112 INFO L124 PetriNetUnfolderBase]: 8542/14622 cut-off events. [2024-01-27 23:08:34,112 INFO L125 PetriNetUnfolderBase]: For 2556/3053 co-relation queries the response was YES. [2024-01-27 23:08:34,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30574 conditions, 14622 events. 8542/14622 cut-off events. For 2556/3053 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 118929 event pairs, 4435 based on Foata normal form. 2/12789 useless extension candidates. Maximal degree in co-relation 30503. Up to 7610 conditions per place. [2024-01-27 23:08:34,181 INFO L140 encePairwiseOnDemand]: 144/153 looper letters, 72 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2024-01-27 23:08:34,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 143 transitions, 514 flow [2024-01-27 23:08:34,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2024-01-27 23:08:34,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8082788671023965 [2024-01-27 23:08:34,183 INFO L175 Difference]: Start difference. First operand has 127 places, 127 transitions, 312 flow. Second operand 3 states and 371 transitions. [2024-01-27 23:08:34,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 143 transitions, 514 flow [2024-01-27 23:08:34,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 143 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:34,187 INFO L231 Difference]: Finished difference. Result has 120 places, 120 transitions, 298 flow [2024-01-27 23:08:34,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=120, PETRI_TRANSITIONS=120} [2024-01-27 23:08:34,189 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -33 predicate places. [2024-01-27 23:08:34,189 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 120 transitions, 298 flow [2024-01-27 23:08:34,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:34,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:34,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:34,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 23:08:34,190 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-27 23:08:34,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:34,190 INFO L85 PathProgramCache]: Analyzing trace with hash -547629719, now seen corresponding path program 1 times [2024-01-27 23:08:34,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:34,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739692290] [2024-01-27 23:08:34,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:34,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:34,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:34,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739692290] [2024-01-27 23:08:34,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739692290] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:34,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:34,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:34,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434886206] [2024-01-27 23:08:34,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:34,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:34,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:34,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:34,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:34,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 153 [2024-01-27 23:08:34,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 120 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:34,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:34,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 153 [2024-01-27 23:08:34,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:35,039 INFO L124 PetriNetUnfolderBase]: 8560/14585 cut-off events. [2024-01-27 23:08:35,040 INFO L125 PetriNetUnfolderBase]: For 3221/3750 co-relation queries the response was YES. [2024-01-27 23:08:35,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31305 conditions, 14585 events. 8560/14585 cut-off events. For 3221/3750 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 118730 event pairs, 4282 based on Foata normal form. 1/12920 useless extension candidates. Maximal degree in co-relation 19736. Up to 7196 conditions per place. [2024-01-27 23:08:35,094 INFO L140 encePairwiseOnDemand]: 144/153 looper letters, 71 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2024-01-27 23:08:35,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 136 transitions, 500 flow [2024-01-27 23:08:35,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-01-27 23:08:35,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8126361655773421 [2024-01-27 23:08:35,096 INFO L175 Difference]: Start difference. First operand has 120 places, 120 transitions, 298 flow. Second operand 3 states and 373 transitions. [2024-01-27 23:08:35,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 136 transitions, 500 flow [2024-01-27 23:08:35,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 136 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:35,126 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 284 flow [2024-01-27 23:08:35,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-01-27 23:08:35,128 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -40 predicate places. [2024-01-27 23:08:35,128 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 284 flow [2024-01-27 23:08:35,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:35,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:35,128 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] [2024-01-27 23:08:35,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 23:08:35,129 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-27 23:08:35,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:35,129 INFO L85 PathProgramCache]: Analyzing trace with hash -169595958, now seen corresponding path program 1 times [2024-01-27 23:08:35,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:35,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926538898] [2024-01-27 23:08:35,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:35,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:08:35,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 23:08:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:08:35,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 23:08:35,184 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 23:08:35,185 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 76 remaining) [2024-01-27 23:08:35,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 76 remaining) [2024-01-27 23:08:35,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 76 remaining) [2024-01-27 23:08:35,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 76 remaining) [2024-01-27 23:08:35,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 76 remaining) [2024-01-27 23:08:35,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 76 remaining) [2024-01-27 23:08:35,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 76 remaining) [2024-01-27 23:08:35,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 76 remaining) [2024-01-27 23:08:35,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 76 remaining) [2024-01-27 23:08:35,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 76 remaining) [2024-01-27 23:08:35,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 76 remaining) [2024-01-27 23:08:35,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 76 remaining) [2024-01-27 23:08:35,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 76 remaining) [2024-01-27 23:08:35,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 76 remaining) [2024-01-27 23:08:35,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 76 remaining) [2024-01-27 23:08:35,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 76 remaining) [2024-01-27 23:08:35,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 76 remaining) [2024-01-27 23:08:35,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 76 remaining) [2024-01-27 23:08:35,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 76 remaining) [2024-01-27 23:08:35,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 76 remaining) [2024-01-27 23:08:35,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 76 remaining) [2024-01-27 23:08:35,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 76 remaining) [2024-01-27 23:08:35,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 76 remaining) [2024-01-27 23:08:35,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 76 remaining) [2024-01-27 23:08:35,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 76 remaining) [2024-01-27 23:08:35,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 76 remaining) [2024-01-27 23:08:35,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 76 remaining) [2024-01-27 23:08:35,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 76 remaining) [2024-01-27 23:08:35,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 76 remaining) [2024-01-27 23:08:35,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 76 remaining) [2024-01-27 23:08:35,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 76 remaining) [2024-01-27 23:08:35,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 76 remaining) [2024-01-27 23:08:35,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 76 remaining) [2024-01-27 23:08:35,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 76 remaining) [2024-01-27 23:08:35,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 76 remaining) [2024-01-27 23:08:35,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 76 remaining) [2024-01-27 23:08:35,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 76 remaining) [2024-01-27 23:08:35,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 76 remaining) [2024-01-27 23:08:35,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 76 remaining) [2024-01-27 23:08:35,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 76 remaining) [2024-01-27 23:08:35,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 76 remaining) [2024-01-27 23:08:35,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 76 remaining) [2024-01-27 23:08:35,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 76 remaining) [2024-01-27 23:08:35,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 76 remaining) [2024-01-27 23:08:35,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 76 remaining) [2024-01-27 23:08:35,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 76 remaining) [2024-01-27 23:08:35,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 76 remaining) [2024-01-27 23:08:35,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 76 remaining) [2024-01-27 23:08:35,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 76 remaining) [2024-01-27 23:08:35,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 76 remaining) [2024-01-27 23:08:35,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 76 remaining) [2024-01-27 23:08:35,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 76 remaining) [2024-01-27 23:08:35,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 76 remaining) [2024-01-27 23:08:35,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 76 remaining) [2024-01-27 23:08:35,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 76 remaining) [2024-01-27 23:08:35,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 76 remaining) [2024-01-27 23:08:35,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 76 remaining) [2024-01-27 23:08:35,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 76 remaining) [2024-01-27 23:08:35,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (17 of 76 remaining) [2024-01-27 23:08:35,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 76 remaining) [2024-01-27 23:08:35,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 76 remaining) [2024-01-27 23:08:35,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 76 remaining) [2024-01-27 23:08:35,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 76 remaining) [2024-01-27 23:08:35,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 76 remaining) [2024-01-27 23:08:35,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 76 remaining) [2024-01-27 23:08:35,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 76 remaining) [2024-01-27 23:08:35,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 76 remaining) [2024-01-27 23:08:35,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 76 remaining) [2024-01-27 23:08:35,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 76 remaining) [2024-01-27 23:08:35,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 76 remaining) [2024-01-27 23:08:35,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 76 remaining) [2024-01-27 23:08:35,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 76 remaining) [2024-01-27 23:08:35,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 76 remaining) [2024-01-27 23:08:35,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 76 remaining) [2024-01-27 23:08:35,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 76 remaining) [2024-01-27 23:08:35,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 76 remaining) [2024-01-27 23:08:35,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 23:08:35,198 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:35,204 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 23:08:35,205 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 23:08:35,266 INFO L503 ceAbstractionStarter]: Automizer considered 57 witness invariants [2024-01-27 23:08:35,266 INFO L504 ceAbstractionStarter]: WitnessConsidered=57 [2024-01-27 23:08:35,267 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:08:35 BasicIcfg [2024-01-27 23:08:35,267 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 23:08:35,269 INFO L158 Benchmark]: Toolchain (without parser) took 8724.00ms. Allocated memory was 165.7MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 105.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 594.5MB. Max. memory is 16.1GB. [2024-01-27 23:08:35,269 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:08:35,269 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:08:35,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.45ms. Allocated memory is still 165.7MB. Free memory was 105.4MB in the beginning and 88.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-01-27 23:08:35,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.39ms. Allocated memory is still 165.7MB. Free memory was 88.1MB in the beginning and 85.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 23:08:35,270 INFO L158 Benchmark]: Boogie Preprocessor took 34.16ms. Allocated memory is still 165.7MB. Free memory was 85.5MB in the beginning and 82.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 23:08:35,270 INFO L158 Benchmark]: RCFGBuilder took 606.89ms. Allocated memory is still 165.7MB. Free memory was 82.9MB in the beginning and 86.8MB in the end (delta: -3.9MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-01-27 23:08:35,270 INFO L158 Benchmark]: TraceAbstraction took 7787.76ms. Allocated memory was 165.7MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 85.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 571.8MB. Max. memory is 16.1GB. [2024-01-27 23:08:35,271 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.16ms. Allocated memory is still 117.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.45ms. Allocated memory is still 165.7MB. Free memory was 105.4MB in the beginning and 88.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.39ms. Allocated memory is still 165.7MB. Free memory was 88.1MB in the beginning and 85.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.16ms. Allocated memory is still 165.7MB. Free memory was 85.5MB in the beginning and 82.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 606.89ms. Allocated memory is still 165.7MB. Free memory was 82.9MB in the beginning and 86.8MB in the end (delta: -3.9MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7787.76ms. Allocated memory was 165.7MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 85.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 571.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 86]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 int length_0, to_int_1, length_2, to_int_3, length_4, to_int_5, result_6, result_7, result_8; [L61] 0 pthread_t t1, t2, t3; VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] [L64] 0 length_0 = __VERIFIER_nondet_int() [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] [L65] 0 to_int_1 = __VERIFIER_nondet_int() [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] [L66] 0 length_2 = __VERIFIER_nondet_int() [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] [L67] 0 to_int_3 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] [L68] 0 length_4 = __VERIFIER_nondet_int() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] [L69] 0 to_int_5 = __VERIFIER_nondet_int() [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L43] 1 length_0 == 0 ? (length_2 == 0 ? 0 : 1) : (length_2 == 0 ? -1 : minus(to_int_1, to_int_3)) VAL [_argptr={0:0}, _argptr={0:0}, length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, to_int_1=0, to_int_3=0, to_int_5=0] [L43] 1 length_2 == 0 ? -1 : minus(to_int_1, to_int_3) [L43] CALL 1 minus(to_int_1, to_int_3) [L86] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]] VAL [\old(a)=0, \old(b)=0, a=0, b=0, length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, to_int_1=0, to_int_3=0, to_int_5=0] - UnprovableResult [Line: 45]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: 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: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: 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: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: 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: 66]: 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: 66]: 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: 66]: 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: 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: 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: 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: 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: 69]: 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: 69]: 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: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: 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: 73]: 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: 72]: 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: 74]: 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 7 procedures, 199 locations, 76 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 265 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 786 IncrementalHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 2 mSDtfsCounter, 786 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=328occurred in iteration=6, InterpolantAutomatonStates: 27, 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.3s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 23:08:35,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE