./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.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-subst.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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-subst.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-simpl-str-subst.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-a340643-m [2024-01-27 14:50:51,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 14:50:51,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 14:50:51,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 14:50:51,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 14:50:51,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 14:50:51,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 14:50:51,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 14:50:51,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 14:50:51,719 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 14:50:51,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 14:50:51,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 14:50:51,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 14:50:51,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 14:50:51,720 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 14:50:51,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 14:50:51,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 14:50:51,721 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 14:50:51,722 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 14:50:51,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 14:50:51,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 14:50:51,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 14:50:51,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 14:50:51,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 14:50:51,723 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 14:50:51,724 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 14:50:51,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 14:50:51,724 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 14:50:51,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 14:50:51,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 14:50:51,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 14:50:51,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 14:50:51,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:50:51,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 14:50:51,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 14:50:51,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 14:50:51,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 14:50:51,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 14:50:51,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 14:50:51,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 14:50:51,727 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 14:50:51,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 14:50:51,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 14:50:51,728 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 14:50:51,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 14:50:51,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 14:50:51,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 14:50:51,976 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 14:50:51,977 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 14:50:51,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2024-01-27 14:50:53,055 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 14:50:53,218 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 14:50:53,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2024-01-27 14:50:53,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff943862e/1b659e050ed842d798d746e8eefd66a0/FLAG96dc51a3d [2024-01-27 14:50:53,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff943862e/1b659e050ed842d798d746e8eefd66a0 [2024-01-27 14:50:53,237 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 14:50:53,238 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 14:50:53,238 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-subst.wvr.yml/witness.yml [2024-01-27 14:50:53,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 14:50:53,315 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 14:50:53,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 14:50:53,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 14:50:53,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 14:50:53,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:50:53" (1/2) ... [2024-01-27 14:50:53,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4932e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:53, skipping insertion in model container [2024-01-27 14:50:53,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:50:53" (1/2) ... [2024-01-27 14:50:53,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5b3753e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:53, skipping insertion in model container [2024-01-27 14:50:53,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:50:53" (2/2) ... [2024-01-27 14:50:53,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4932e9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:53, skipping insertion in model container [2024-01-27 14:50:53,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:50:53" (2/2) ... [2024-01-27 14:50:53,323 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 14:50:53,339 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 14:50:53,340 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] b != 0 [2024-01-27 14:50:53,340 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] b <= -1 [2024-01-27 14:50:53,340 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] length_4 == 0 [2024-01-27 14:50:53,341 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_7 == 0 [2024-01-27 14:50:53,341 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] to_int_5 == 0 [2024-01-27 14:50:53,341 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_6 == 0 [2024-01-27 14:50:53,341 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_8 == 0 [2024-01-27 14:50:53,341 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_6 == 0 [2024-01-27 14:50:53,341 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] to_int_5 == 0 [2024-01-27 14:50:53,341 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_7 == 0 [2024-01-27 14:50:53,342 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_8 == 0 [2024-01-27 14:50:53,342 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] to_int_3 == 0 [2024-01-27 14:50:53,342 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] length_4 == 0 [2024-01-27 14:50:53,342 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_6 == 0 [2024-01-27 14:50:53,342 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] to_int_5 == 0 [2024-01-27 14:50:53,342 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_7 == 0 [2024-01-27 14:50:53,342 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] length_2 == 0 [2024-01-27 14:50:53,343 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_8 == 0 [2024-01-27 14:50:53,343 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] to_int_1 == 0 [2024-01-27 14:50:53,343 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-27 14:50:53,343 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_6 == 0 [2024-01-27 14:50:53,343 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] length_4 == 0 [2024-01-27 14:50:53,343 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] length_2 == 0 [2024-01-27 14:50:53,343 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_7 == 0 [2024-01-27 14:50:53,343 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] to_int_5 == 0 [2024-01-27 14:50:53,344 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] to_int_3 == 0 [2024-01-27 14:50:53,344 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_8 == 0 [2024-01-27 14:50:53,344 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] to_int_5 == 0 [2024-01-27 14:50:53,344 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_7 == 0 [2024-01-27 14:50:53,344 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] length_4 == 0 [2024-01-27 14:50:53,344 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_8 == 0 [2024-01-27 14:50:53,344 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] to_int_3 == 0 [2024-01-27 14:50:53,345 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_6 == 0 [2024-01-27 14:50:53,345 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_6 == 0 [2024-01-27 14:50:53,345 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_7 == 0 [2024-01-27 14:50:53,345 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_8 == 0 [2024-01-27 14:50:53,345 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_8 == 0 [2024-01-27 14:50:53,345 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_7 == 0 [2024-01-27 14:50:53,345 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] length_0 == 0 [2024-01-27 14:50:53,346 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] length_2 == 0 [2024-01-27 14:50:53,346 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] length_4 == 0 [2024-01-27 14:50:53,346 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] to_int_5 == 0 [2024-01-27 14:50:53,346 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] to_int_1 == 0 [2024-01-27 14:50:53,346 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] to_int_3 == 0 [2024-01-27 14:50:53,346 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_6 == 0 [2024-01-27 14:50:53,346 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-01-27 14:50:53,346 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] 1 <= b [2024-01-27 14:50:53,347 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] b != 0 [2024-01-27 14:50:53,347 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] to_int_5 == 0 [2024-01-27 14:50:53,347 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_8 == 0 [2024-01-27 14:50:53,347 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_7 == 0 [2024-01-27 14:50:53,347 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_6 == 0 [2024-01-27 14:50:53,347 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-27 14:50:53,368 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 14:50:53,508 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-subst.wvr.c[2614,2627] [2024-01-27 14:50:53,514 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:50:53,522 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 14:50:53,531 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 14:50:53,597 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-subst.wvr.c[2614,2627] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 14:50:53,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:50:53,612 INFO L206 MainTranslator]: Completed translation [2024-01-27 14:50:53,613 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:53 WrapperNode [2024-01-27 14:50:53,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 14:50:53,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 14:50:53,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 14:50:53,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 14:50:53,619 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 02:50:53" (1/1) ... [2024-01-27 14:50:53,626 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 02:50:53" (1/1) ... [2024-01-27 14:50:53,653 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 232 [2024-01-27 14:50:53,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 14:50:53,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 14:50:53,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 14:50:53,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 14:50:53,667 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 02:50:53" (1/1) ... [2024-01-27 14:50:53,668 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 02:50:53" (1/1) ... [2024-01-27 14:50:53,683 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 02:50:53" (1/1) ... [2024-01-27 14:50:53,704 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 14:50:53,704 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 02:50:53" (1/1) ... [2024-01-27 14:50:53,704 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 02:50:53" (1/1) ... [2024-01-27 14:50:53,716 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 02:50:53" (1/1) ... [2024-01-27 14:50:53,719 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 02:50:53" (1/1) ... [2024-01-27 14:50:53,724 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 02:50:53" (1/1) ... [2024-01-27 14:50:53,725 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 02:50:53" (1/1) ... [2024-01-27 14:50:53,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 14:50:53,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 14:50:53,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 14:50:53,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 14:50:53,732 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 02:50:53" (1/1) ... [2024-01-27 14:50:53,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:50:53,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:50:53,781 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 14:50:53,783 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 14:50:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 14:50:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 14:50:53,819 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 14:50:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 14:50:53,820 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 14:50:53,820 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 14:50:53,820 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 14:50:53,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 14:50:53,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 14:50:53,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 14:50:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 14:50:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 14:50:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 14:50:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 14:50:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 14:50:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 14:50:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 14:50:53,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 14:50:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 14:50:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 14:50:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 14:50:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 14:50:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 14:50:53,824 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 14:50:53,931 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 14:50:53,933 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 14:50:54,258 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 14:50:54,258 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 14:50:54,426 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 14:50:54,427 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 14:50:54,429 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:50:54 BoogieIcfgContainer [2024-01-27 14:50:54,429 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 14:50:54,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 14:50:54,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 14:50:54,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 14:50:54,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 02:50:53" (1/4) ... [2024-01-27 14:50:54,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551a9952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:50:54, skipping insertion in model container [2024-01-27 14:50:54,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:50:53" (2/4) ... [2024-01-27 14:50:54,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551a9952 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 02:50:54, skipping insertion in model container [2024-01-27 14:50:54,435 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 02:50:53" (3/4) ... [2024-01-27 14:50:54,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551a9952 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 02:50:54, skipping insertion in model container [2024-01-27 14:50:54,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:50:54" (4/4) ... [2024-01-27 14:50:54,439 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2024-01-27 14:50:54,452 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 14:50:54,452 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-01-27 14:50:54,452 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 14:50:54,574 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 14:50:54,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 153 transitions, 327 flow [2024-01-27 14:50:54,674 INFO L124 PetriNetUnfolderBase]: 6/150 cut-off events. [2024-01-27 14:50:54,675 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 14:50:54,678 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 254 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 14:50:54,679 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 153 transitions, 327 flow [2024-01-27 14:50:54,692 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 149 transitions, 316 flow [2024-01-27 14:50:54,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 14:50:54,706 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;@21d1e970, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 14:50:54,707 INFO L358 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2024-01-27 14:50:54,709 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 14:50:54,710 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 14:50:54,710 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:50:54,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:54,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 14:50:54,711 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 14:50:54,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:54,719 INFO L85 PathProgramCache]: Analyzing trace with hash 20640, now seen corresponding path program 1 times [2024-01-27 14:50:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:54,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335726088] [2024-01-27 14:50:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:54,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:54,895 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 14:50:54,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:54,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335726088] [2024-01-27 14:50:54,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335726088] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:54,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:54,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:54,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067029958] [2024-01-27 14:50:54,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:54,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:54,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:54,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:54,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:54,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 153 [2024-01-27 14:50:54,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 149 transitions, 316 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 14:50:54,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:54,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 153 [2024-01-27 14:50:54,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:55,456 INFO L124 PetriNetUnfolderBase]: 2167/3625 cut-off events. [2024-01-27 14:50:55,457 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2024-01-27 14:50:55,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6861 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 24650 event pairs, 1112 based on Foata normal form. 0/3042 useless extension candidates. Maximal degree in co-relation 6056. Up to 1959 conditions per place. [2024-01-27 14:50:55,492 INFO L140 encePairwiseOnDemand]: 143/153 looper letters, 61 selfloop transitions, 3 changer transitions 0/161 dead transitions. [2024-01-27 14:50:55,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 161 transitions, 474 flow [2024-01-27 14:50:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2024-01-27 14:50:55,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8082788671023965 [2024-01-27 14:50:55,514 INFO L175 Difference]: Start difference. First operand has 153 places, 149 transitions, 316 flow. Second operand 3 states and 371 transitions. [2024-01-27 14:50:55,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 161 transitions, 474 flow [2024-01-27 14:50:55,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 161 transitions, 458 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 14:50:55,530 INFO L231 Difference]: Finished difference. Result has 142 places, 142 transitions, 296 flow [2024-01-27 14:50:55,532 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=142, PETRI_TRANSITIONS=142} [2024-01-27 14:50:55,535 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -11 predicate places. [2024-01-27 14:50:55,535 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 142 transitions, 296 flow [2024-01-27 14:50:55,536 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 14:50:55,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:55,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 14:50:55,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 14:50:55,537 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 14:50:55,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:55,537 INFO L85 PathProgramCache]: Analyzing trace with hash 640477, now seen corresponding path program 1 times [2024-01-27 14:50:55,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:55,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267282241] [2024-01-27 14:50:55,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:55,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:55,586 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 14:50:55,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:55,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267282241] [2024-01-27 14:50:55,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267282241] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:55,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:55,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:55,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651872195] [2024-01-27 14:50:55,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:55,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:55,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:55,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:55,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:55,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 153 [2024-01-27 14:50:55,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 142 transitions, 296 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 14:50:55,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:55,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 153 [2024-01-27 14:50:55,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:55,953 INFO L124 PetriNetUnfolderBase]: 2177/3646 cut-off events. [2024-01-27 14:50:55,954 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2024-01-27 14:50:55,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6881 conditions, 3646 events. 2177/3646 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 24441 event pairs, 1782 based on Foata normal form. 0/3011 useless extension candidates. Maximal degree in co-relation 4400. Up to 3053 conditions per place. [2024-01-27 14:50:55,978 INFO L140 encePairwiseOnDemand]: 147/153 looper letters, 42 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2024-01-27 14:50:55,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 138 transitions, 376 flow [2024-01-27 14:50:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2024-01-27 14:50:55,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2024-01-27 14:50:55,980 INFO L175 Difference]: Start difference. First operand has 142 places, 142 transitions, 296 flow. Second operand 3 states and 360 transitions. [2024-01-27 14:50:55,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 138 transitions, 376 flow [2024-01-27 14:50:55,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 138 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:55,985 INFO L231 Difference]: Finished difference. Result has 138 places, 138 transitions, 286 flow [2024-01-27 14:50:55,986 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 14:50:55,986 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -15 predicate places. [2024-01-27 14:50:55,987 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 138 transitions, 286 flow [2024-01-27 14:50:55,987 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 14:50:55,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:55,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 14:50:55,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 14:50:55,988 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 14:50:55,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:55,991 INFO L85 PathProgramCache]: Analyzing trace with hash 19855533, now seen corresponding path program 1 times [2024-01-27 14:50:55,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:55,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025837935] [2024-01-27 14:50:55,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:55,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:56,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:56,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025837935] [2024-01-27 14:50:56,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025837935] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:56,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:56,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:56,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803370651] [2024-01-27 14:50:56,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:56,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:56,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:56,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:56,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:56,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 153 [2024-01-27 14:50:56,046 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 14:50:56,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:56,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 153 [2024-01-27 14:50:56,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:56,356 INFO L124 PetriNetUnfolderBase]: 2177/3644 cut-off events. [2024-01-27 14:50:56,356 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-01-27 14:50:56,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6764 conditions, 3644 events. 2177/3644 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 24531 event pairs, 1782 based on Foata normal form. 0/3011 useless extension candidates. Maximal degree in co-relation 6701. Up to 3055 conditions per place. [2024-01-27 14:50:56,378 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 41 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2024-01-27 14:50:56,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 136 transitions, 368 flow [2024-01-27 14:50:56,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2024-01-27 14:50:56,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7973856209150327 [2024-01-27 14:50:56,380 INFO L175 Difference]: Start difference. First operand has 138 places, 138 transitions, 286 flow. Second operand 3 states and 366 transitions. [2024-01-27 14:50:56,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 136 transitions, 368 flow [2024-01-27 14:50:56,381 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 14:50:56,383 INFO L231 Difference]: Finished difference. Result has 136 places, 136 transitions, 282 flow [2024-01-27 14:50:56,383 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 14:50:56,384 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -17 predicate places. [2024-01-27 14:50:56,384 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 136 transitions, 282 flow [2024-01-27 14:50:56,384 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 14:50:56,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:56,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 14:50:56,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 14:50:56,385 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 14:50:56,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:56,385 INFO L85 PathProgramCache]: Analyzing trace with hash 615522282, now seen corresponding path program 1 times [2024-01-27 14:50:56,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:56,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837607507] [2024-01-27 14:50:56,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:56,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:56,407 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 14:50:56,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:56,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837607507] [2024-01-27 14:50:56,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837607507] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:56,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:56,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:56,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994208668] [2024-01-27 14:50:56,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:56,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:56,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:56,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:56,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:56,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 153 [2024-01-27 14:50:56,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 136 transitions, 282 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 14:50:56,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:56,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 153 [2024-01-27 14:50:56,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:56,806 INFO L124 PetriNetUnfolderBase]: 2177/3638 cut-off events. [2024-01-27 14:50:56,806 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-01-27 14:50:56,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6761 conditions, 3638 events. 2177/3638 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 24458 event pairs, 1782 based on Foata normal form. 0/3010 useless extension candidates. Maximal degree in co-relation 6724. Up to 3051 conditions per place. [2024-01-27 14:50:56,824 INFO L140 encePairwiseOnDemand]: 145/153 looper letters, 44 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2024-01-27 14:50:56,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 130 transitions, 362 flow [2024-01-27 14:50:56,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2024-01-27 14:50:56,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7668845315904139 [2024-01-27 14:50:56,826 INFO L175 Difference]: Start difference. First operand has 136 places, 136 transitions, 282 flow. Second operand 3 states and 352 transitions. [2024-01-27 14:50:56,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 130 transitions, 362 flow [2024-01-27 14:50:56,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 130 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:56,828 INFO L231 Difference]: Finished difference. Result has 130 places, 130 transitions, 270 flow [2024-01-27 14:50:56,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2024-01-27 14:50:56,829 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -23 predicate places. [2024-01-27 14:50:56,829 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 270 flow [2024-01-27 14:50:56,829 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 14:50:56,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:56,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 14:50:56,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 14:50:56,830 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 14:50:56,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1901322181, now seen corresponding path program 1 times [2024-01-27 14:50:56,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:56,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356008179] [2024-01-27 14:50:56,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:56,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:56,849 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 14:50:56,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:56,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356008179] [2024-01-27 14:50:56,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356008179] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:56,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:56,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:56,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231922568] [2024-01-27 14:50:56,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:56,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:56,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:56,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:56,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:56,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 153 [2024-01-27 14:50:56,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 14:50:56,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:56,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 153 [2024-01-27 14:50:56,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:57,348 INFO L124 PetriNetUnfolderBase]: 3358/5685 cut-off events. [2024-01-27 14:50:57,348 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-01-27 14:50:57,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10497 conditions, 5685 events. 3358/5685 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 41081 event pairs, 1782 based on Foata normal form. 0/4993 useless extension candidates. Maximal degree in co-relation 10425. Up to 2812 conditions per place. [2024-01-27 14:50:57,380 INFO L140 encePairwiseOnDemand]: 142/153 looper letters, 69 selfloop transitions, 4 changer transitions 0/153 dead transitions. [2024-01-27 14:50:57,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 153 transitions, 466 flow [2024-01-27 14:50:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2024-01-27 14:50:57,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.840958605664488 [2024-01-27 14:50:57,382 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 270 flow. Second operand 3 states and 386 transitions. [2024-01-27 14:50:57,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 153 transitions, 466 flow [2024-01-27 14:50:57,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 153 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:57,385 INFO L231 Difference]: Finished difference. Result has 127 places, 127 transitions, 284 flow [2024-01-27 14:50:57,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=127, PETRI_TRANSITIONS=127} [2024-01-27 14:50:57,388 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -26 predicate places. [2024-01-27 14:50:57,388 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 127 transitions, 284 flow [2024-01-27 14:50:57,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 14:50:57,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:57,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:57,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 14:50:57,389 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 14:50:57,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:57,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1188553810, now seen corresponding path program 1 times [2024-01-27 14:50:57,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:57,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546245681] [2024-01-27 14:50:57,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:57,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:57,430 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 14:50:57,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:57,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546245681] [2024-01-27 14:50:57,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546245681] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:57,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:57,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:57,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683449121] [2024-01-27 14:50:57,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:57,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:57,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:57,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:57,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:57,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 153 [2024-01-27 14:50:57,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 127 transitions, 284 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 14:50:57,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:57,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 153 [2024-01-27 14:50:57,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:58,178 INFO L124 PetriNetUnfolderBase]: 5651/9919 cut-off events. [2024-01-27 14:50:58,178 INFO L125 PetriNetUnfolderBase]: For 1654/1654 co-relation queries the response was YES. [2024-01-27 14:50:58,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19594 conditions, 9919 events. 5651/9919 cut-off events. For 1654/1654 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 79854 event pairs, 2899 based on Foata normal form. 0/9295 useless extension candidates. Maximal degree in co-relation 11482. Up to 4647 conditions per place. [2024-01-27 14:50:58,222 INFO L140 encePairwiseOnDemand]: 144/153 looper letters, 76 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2024-01-27 14:50:58,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 157 transitions, 525 flow [2024-01-27 14:50:58,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2024-01-27 14:50:58,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8562091503267973 [2024-01-27 14:50:58,224 INFO L175 Difference]: Start difference. First operand has 127 places, 127 transitions, 284 flow. Second operand 3 states and 393 transitions. [2024-01-27 14:50:58,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 157 transitions, 525 flow [2024-01-27 14:50:58,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 157 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:58,235 INFO L231 Difference]: Finished difference. Result has 126 places, 126 transitions, 298 flow [2024-01-27 14:50:58,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=126, PETRI_TRANSITIONS=126} [2024-01-27 14:50:58,238 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -27 predicate places. [2024-01-27 14:50:58,238 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 126 transitions, 298 flow [2024-01-27 14:50:58,238 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 14:50:58,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:58,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:58,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 14:50:58,239 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 14:50:58,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1809538207, now seen corresponding path program 1 times [2024-01-27 14:50:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:58,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440619036] [2024-01-27 14:50:58,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:58,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:58,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:58,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440619036] [2024-01-27 14:50:58,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440619036] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:58,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:58,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:58,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078631745] [2024-01-27 14:50:58,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:58,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:58,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:58,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:58,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:58,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 153 [2024-01-27 14:50:58,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 126 transitions, 298 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 14:50:58,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:58,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 153 [2024-01-27 14:50:58,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:59,427 INFO L124 PetriNetUnfolderBase]: 9216/15271 cut-off events. [2024-01-27 14:50:59,427 INFO L125 PetriNetUnfolderBase]: For 3120/3427 co-relation queries the response was YES. [2024-01-27 14:50:59,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31962 conditions, 15271 events. 9216/15271 cut-off events. For 3120/3427 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 118906 event pairs, 5180 based on Foata normal form. 1/13377 useless extension candidates. Maximal degree in co-relation 18776. Up to 7930 conditions per place. [2024-01-27 14:50:59,501 INFO L140 encePairwiseOnDemand]: 146/153 looper letters, 80 selfloop transitions, 4 changer transitions 0/161 dead transitions. [2024-01-27 14:50:59,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 161 transitions, 567 flow [2024-01-27 14:50:59,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2024-01-27 14:50:59,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8714596949891068 [2024-01-27 14:50:59,517 INFO L175 Difference]: Start difference. First operand has 126 places, 126 transitions, 298 flow. Second operand 3 states and 400 transitions. [2024-01-27 14:50:59,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 161 transitions, 567 flow [2024-01-27 14:50:59,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 161 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:59,523 INFO L231 Difference]: Finished difference. Result has 127 places, 127 transitions, 316 flow [2024-01-27 14:50:59,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=127, PETRI_TRANSITIONS=127} [2024-01-27 14:50:59,524 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -26 predicate places. [2024-01-27 14:50:59,524 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 127 transitions, 316 flow [2024-01-27 14:50:59,524 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 14:50:59,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:59,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:59,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 14:50:59,525 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 14:50:59,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash 261110241, now seen corresponding path program 1 times [2024-01-27 14:50:59,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:59,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472868678] [2024-01-27 14:50:59,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:59,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:59,563 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 14:50:59,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:59,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472868678] [2024-01-27 14:50:59,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472868678] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:59,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:59,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:59,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999615272] [2024-01-27 14:50:59,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:59,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:59,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:59,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:59,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:59,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 153 [2024-01-27 14:50:59,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 127 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 14:50:59,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:59,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 153 [2024-01-27 14:50:59,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:00,775 INFO L124 PetriNetUnfolderBase]: 8551/14584 cut-off events. [2024-01-27 14:51:00,776 INFO L125 PetriNetUnfolderBase]: For 3581/4153 co-relation queries the response was YES. [2024-01-27 14:51:00,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31146 conditions, 14584 events. 8551/14584 cut-off events. For 3581/4153 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 118712 event pairs, 4216 based on Foata normal form. 0/12815 useless extension candidates. Maximal degree in co-relation 17545. Up to 7162 conditions per place. [2024-01-27 14:51:00,836 INFO L140 encePairwiseOnDemand]: 144/153 looper letters, 75 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2024-01-27 14:51:00,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 143 transitions, 526 flow [2024-01-27 14:51:00,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2024-01-27 14:51:00,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7952069716775599 [2024-01-27 14:51:00,838 INFO L175 Difference]: Start difference. First operand has 127 places, 127 transitions, 316 flow. Second operand 3 states and 365 transitions. [2024-01-27 14:51:00,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 143 transitions, 526 flow [2024-01-27 14:51:00,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 143 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:51:00,842 INFO L231 Difference]: Finished difference. Result has 120 places, 120 transitions, 298 flow [2024-01-27 14:51:00,842 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 14:51:00,844 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -33 predicate places. [2024-01-27 14:51:00,844 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 120 transitions, 298 flow [2024-01-27 14:51:00,844 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 14:51:00,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:00,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:00,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 14:51:00,845 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 14:51:00,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash -495516373, now seen corresponding path program 1 times [2024-01-27 14:51:00,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:00,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118160758] [2024-01-27 14:51:00,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:00,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:00,862 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 14:51:00,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:00,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118160758] [2024-01-27 14:51:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118160758] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:00,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:00,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:00,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841649390] [2024-01-27 14:51:00,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:00,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:00,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:00,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:00,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:00,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 153 [2024-01-27 14:51:00,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 120 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 14:51:00,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:00,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 153 [2024-01-27 14:51:00,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:01,833 INFO L124 PetriNetUnfolderBase]: 8551/14639 cut-off events. [2024-01-27 14:51:01,833 INFO L125 PetriNetUnfolderBase]: For 3319/3867 co-relation queries the response was YES. [2024-01-27 14:51:01,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31403 conditions, 14639 events. 8551/14639 cut-off events. For 3319/3867 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 118500 event pairs, 4507 based on Foata normal form. 1/12704 useless extension candidates. Maximal degree in co-relation 18539. Up to 7687 conditions per place. [2024-01-27 14:51:01,916 INFO L140 encePairwiseOnDemand]: 144/153 looper letters, 74 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2024-01-27 14:51:01,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 136 transitions, 506 flow [2024-01-27 14:51:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2024-01-27 14:51:01,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7995642701525054 [2024-01-27 14:51:01,918 INFO L175 Difference]: Start difference. First operand has 120 places, 120 transitions, 298 flow. Second operand 3 states and 367 transitions. [2024-01-27 14:51:01,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 136 transitions, 506 flow [2024-01-27 14:51:01,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 136 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:51:01,933 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 284 flow [2024-01-27 14:51:01,933 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 14:51:01,934 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -40 predicate places. [2024-01-27 14:51:01,934 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 284 flow [2024-01-27 14:51:01,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 14:51:01,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:01,935 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 14:51:01,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 14:51:01,935 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-27 14:51:01,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash 358196244, now seen corresponding path program 1 times [2024-01-27 14:51:01,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:01,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896788361] [2024-01-27 14:51:01,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:01,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:51:01,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 14:51:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:51:02,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 14:51:02,003 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 14:51:02,004 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 76 remaining) [2024-01-27 14:51:02,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 76 remaining) [2024-01-27 14:51:02,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 76 remaining) [2024-01-27 14:51:02,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 76 remaining) [2024-01-27 14:51:02,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 76 remaining) [2024-01-27 14:51:02,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 76 remaining) [2024-01-27 14:51:02,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 76 remaining) [2024-01-27 14:51:02,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 76 remaining) [2024-01-27 14:51:02,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 76 remaining) [2024-01-27 14:51:02,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 76 remaining) [2024-01-27 14:51:02,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 76 remaining) [2024-01-27 14:51:02,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 76 remaining) [2024-01-27 14:51:02,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 76 remaining) [2024-01-27 14:51:02,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 76 remaining) [2024-01-27 14:51:02,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 76 remaining) [2024-01-27 14:51:02,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 76 remaining) [2024-01-27 14:51:02,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 76 remaining) [2024-01-27 14:51:02,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 76 remaining) [2024-01-27 14:51:02,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 76 remaining) [2024-01-27 14:51:02,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 76 remaining) [2024-01-27 14:51:02,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 76 remaining) [2024-01-27 14:51:02,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 76 remaining) [2024-01-27 14:51:02,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 76 remaining) [2024-01-27 14:51:02,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 76 remaining) [2024-01-27 14:51:02,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 76 remaining) [2024-01-27 14:51:02,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 76 remaining) [2024-01-27 14:51:02,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 76 remaining) [2024-01-27 14:51:02,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 76 remaining) [2024-01-27 14:51:02,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 76 remaining) [2024-01-27 14:51:02,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 76 remaining) [2024-01-27 14:51:02,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 76 remaining) [2024-01-27 14:51:02,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 76 remaining) [2024-01-27 14:51:02,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 76 remaining) [2024-01-27 14:51:02,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 76 remaining) [2024-01-27 14:51:02,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 76 remaining) [2024-01-27 14:51:02,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 76 remaining) [2024-01-27 14:51:02,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 76 remaining) [2024-01-27 14:51:02,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 76 remaining) [2024-01-27 14:51:02,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 76 remaining) [2024-01-27 14:51:02,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 76 remaining) [2024-01-27 14:51:02,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 76 remaining) [2024-01-27 14:51:02,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 76 remaining) [2024-01-27 14:51:02,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 76 remaining) [2024-01-27 14:51:02,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 76 remaining) [2024-01-27 14:51:02,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 76 remaining) [2024-01-27 14:51:02,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 76 remaining) [2024-01-27 14:51:02,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 76 remaining) [2024-01-27 14:51:02,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 76 remaining) [2024-01-27 14:51:02,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 76 remaining) [2024-01-27 14:51:02,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 76 remaining) [2024-01-27 14:51:02,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 76 remaining) [2024-01-27 14:51:02,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 76 remaining) [2024-01-27 14:51:02,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 76 remaining) [2024-01-27 14:51:02,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 76 remaining) [2024-01-27 14:51:02,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 76 remaining) [2024-01-27 14:51:02,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 76 remaining) [2024-01-27 14:51:02,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 76 remaining) [2024-01-27 14:51:02,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 76 remaining) [2024-01-27 14:51:02,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (17 of 76 remaining) [2024-01-27 14:51:02,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 76 remaining) [2024-01-27 14:51:02,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 76 remaining) [2024-01-27 14:51:02,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 76 remaining) [2024-01-27 14:51:02,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 76 remaining) [2024-01-27 14:51:02,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 76 remaining) [2024-01-27 14:51:02,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 76 remaining) [2024-01-27 14:51:02,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 76 remaining) [2024-01-27 14:51:02,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 76 remaining) [2024-01-27 14:51:02,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 76 remaining) [2024-01-27 14:51:02,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 76 remaining) [2024-01-27 14:51:02,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 76 remaining) [2024-01-27 14:51:02,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 76 remaining) [2024-01-27 14:51:02,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 76 remaining) [2024-01-27 14:51:02,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 76 remaining) [2024-01-27 14:51:02,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 76 remaining) [2024-01-27 14:51:02,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 76 remaining) [2024-01-27 14:51:02,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 76 remaining) [2024-01-27 14:51:02,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 14:51:02,019 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:02,027 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 14:51:02,027 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 14:51:02,088 INFO L503 ceAbstractionStarter]: Automizer considered 57 witness invariants [2024-01-27 14:51:02,091 INFO L504 ceAbstractionStarter]: WitnessConsidered=57 [2024-01-27 14:51:02,092 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 02:51:02 BasicIcfg [2024-01-27 14:51:02,092 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 14:51:02,094 INFO L158 Benchmark]: Toolchain (without parser) took 8777.61ms. Allocated memory was 161.5MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 124.9MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 814.8MB. Max. memory is 16.1GB. [2024-01-27 14:51:02,096 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory was 86.0MB in the beginning and 85.9MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:51:02,096 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 161.5MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:51:02,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.70ms. Allocated memory is still 161.5MB. Free memory was 124.9MB in the beginning and 107.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-27 14:51:02,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.10ms. Allocated memory is still 161.5MB. Free memory was 107.0MB in the beginning and 104.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:51:02,097 INFO L158 Benchmark]: Boogie Preprocessor took 72.09ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 101.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:51:02,097 INFO L158 Benchmark]: RCFGBuilder took 697.80ms. Allocated memory is still 161.5MB. Free memory was 101.8MB in the beginning and 49.4MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-01-27 14:51:02,097 INFO L158 Benchmark]: TraceAbstraction took 7661.43ms. Allocated memory was 161.5MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 49.4MB in the beginning and 4.3GB in the end (delta: -4.3GB). Peak memory consumption was 739.3MB. Max. memory is 16.1GB. [2024-01-27 14:51:02,098 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.15ms. Allocated memory is still 125.8MB. Free memory was 86.0MB in the beginning and 85.9MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 161.5MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.70ms. Allocated memory is still 161.5MB. Free memory was 124.9MB in the beginning and 107.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.10ms. Allocated memory is still 161.5MB. Free memory was 107.0MB in the beginning and 104.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.09ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 101.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 697.80ms. Allocated memory is still 161.5MB. Free memory was 101.8MB in the beginning and 49.4MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7661.43ms. Allocated memory was 161.5MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 49.4MB in the beginning and 4.3GB in the end (delta: -4.3GB). Peak memory consumption was 739.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 87]: 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[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[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[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[result_7],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]]]] [L64] 0 length_0 = __VERIFIER_nondet_int() [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[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[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[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] [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[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_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[to_int_3],IntegerLiteral[0]]]] [L65] 0 to_int_1 = __VERIFIER_nondet_int() [L66] 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] [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[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[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[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[result_6],IntegerLiteral[0]]]] [L66] 0 length_2 = __VERIFIER_nondet_int() [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[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_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] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]] [L67] 0 to_int_3 = __VERIFIER_nondet_int() [L68] 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] [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[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[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[length_4],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_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] [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_6],IntegerLiteral[0]]]] [L69] 0 to_int_5 = __VERIFIER_nondet_int() [L72] 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] [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_6],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) [L87] 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: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: 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: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: 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: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 81]: 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.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 340 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 257 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 795 IncrementalHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 13 mSDtfsCounter, 795 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=316occurred in iteration=0, 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.2s 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 14:51:02,157 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