./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-match-subst.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/chl-match-subst.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d8006e4b 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-match-subst.wvr.c ./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/chl-match-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-d8006e4-m [2024-02-05 10:32:25,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-05 10:32:25,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-05 10:32:25,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-05 10:32:25,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-05 10:32:25,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-05 10:32:25,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-05 10:32:25,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-05 10:32:25,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-05 10:32:25,706 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-05 10:32:25,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-05 10:32:25,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-05 10:32:25,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-05 10:32:25,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-05 10:32:25,709 INFO L153 SettingsManager]: * Use SBE=true [2024-02-05 10:32:25,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-05 10:32:25,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-05 10:32:25,709 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-05 10:32:25,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-05 10:32:25,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-05 10:32:25,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-05 10:32:25,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-05 10:32:25,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-05 10:32:25,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-05 10:32:25,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-05 10:32:25,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-05 10:32:25,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-05 10:32:25,713 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-05 10:32:25,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-05 10:32:25,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-05 10:32:25,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-05 10:32:25,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-05 10:32:25,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:32:25,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-05 10:32:25,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-05 10:32:25,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-05 10:32:25,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-05 10:32:25,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-05 10:32:25,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-05 10:32:25,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-05 10:32:25,716 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-05 10:32:25,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-05 10:32:25,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-05 10:32:25,717 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-02-05 10:32:25,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-05 10:32:25,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-05 10:32:25,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-05 10:32:25,979 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-05 10:32:25,979 INFO L274 PluginConnector]: CDTParser initialized [2024-02-05 10:32:25,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-match-subst.wvr.c [2024-02-05 10:32:27,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-05 10:32:27,344 INFO L384 CDTParser]: Found 1 translation units. [2024-02-05 10:32:27,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-subst.wvr.c [2024-02-05 10:32:27,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2bed393b/3f3f7d90b4844d35b393ae727476803c/FLAG136e566e1 [2024-02-05 10:32:27,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2bed393b/3f3f7d90b4844d35b393ae727476803c [2024-02-05 10:32:27,374 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-05 10:32:27,375 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-05 10:32:27,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/chl-match-subst.wvr.yml/witness.yml [2024-02-05 10:32:27,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-05 10:32:27,505 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-05 10:32:27,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-05 10:32:27,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-05 10:32:27,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-05 10:32:27,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:32:27" (1/2) ... [2024-02-05 10:32:27,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691355ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:27, skipping insertion in model container [2024-02-05 10:32:27,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:32:27" (1/2) ... [2024-02-05 10:32:27,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3c73dcbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:27, skipping insertion in model container [2024-02-05 10:32:27,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:32:27" (2/2) ... [2024-02-05 10:32:27,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691355ce and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:27, skipping insertion in model container [2024-02-05 10:32:27,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:32:27" (2/2) ... [2024-02-05 10:32:27,514 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-05 10:32:27,556 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-05 10:32:27,557 INFO L101 nessWitnessExtractor]: Location invariant before [L69-L69] (((((((((((score_0 == 0) && (seq_1_start_1 == 0)) && (seq_2_start_2 == 0)) && (score_3 == 0)) && (seq_1_start_4 == 0)) && (seq_2_start_5 == 0)) && (score_6 == 0)) && (seq_1_start_7 == 0)) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-02-05 10:32:27,557 INFO L101 nessWitnessExtractor]: Location invariant after [L52-L52] (unsigned long )_argptr == 0UL [2024-02-05 10:32:27,557 INFO L101 nessWitnessExtractor]: Location invariant before [L73-L73] (((((((seq_1_start_4 == 0) && (seq_2_start_5 == 0)) && (score_6 == 0)) && (seq_1_start_7 == 0)) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-02-05 10:32:27,557 INFO L101 nessWitnessExtractor]: Location invariant after [L44-L44] (unsigned long )_argptr == 0UL [2024-02-05 10:32:27,557 INFO L101 nessWitnessExtractor]: Location invariant before [L72-L72] ((((((((score_3 == 0) && (seq_1_start_4 == 0)) && (seq_2_start_5 == 0)) && (score_6 == 0)) && (seq_1_start_7 == 0)) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-02-05 10:32:27,557 INFO L101 nessWitnessExtractor]: Location invariant before [L95-L95] (b <= -1) && (b != 0) [2024-02-05 10:32:27,557 INFO L101 nessWitnessExtractor]: Location invariant after [L59-L59] (((((4294967296LL + (long long )s1) + (long long )s2 >= 0LL) && ((4294967295LL - (long long )s1) + (long long )s2 >= 0LL)) && ((4294967295LL + (long long )s1) - (long long )s2 >= 0LL)) && ((4294967294LL - (long long )s1) - (long long )s2 >= 0LL)) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:32:27,558 INFO L101 nessWitnessExtractor]: Location invariant before [L96-L96] (1 <= b) && (b != 0) [2024-02-05 10:32:27,558 INFO L101 nessWitnessExtractor]: Location invariant before [L60-L60] (unsigned long )_argptr == 0UL [2024-02-05 10:32:27,558 INFO L101 nessWitnessExtractor]: Location invariant before [L70-L70] ((((((((((seq_1_start_1 == 0) && (seq_2_start_2 == 0)) && (score_3 == 0)) && (seq_1_start_4 == 0)) && (seq_2_start_5 == 0)) && (score_6 == 0)) && (seq_1_start_7 == 0)) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-02-05 10:32:27,558 INFO L101 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-02-05 10:32:27,558 INFO L101 nessWitnessExtractor]: Location invariant before [L59-L59] (((((4294967296LL + (long long )s1) + (long long )s2 >= 0LL) && ((4294967295LL - (long long )s1) + (long long )s2 >= 0LL)) && ((4294967295LL + (long long )s1) - (long long )s2 >= 0LL)) && ((4294967294LL - (long long )s1) - (long long )s2 >= 0LL)) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:32:27,558 INFO L101 nessWitnessExtractor]: Location invariant before [L76-L76] ((((seq_1_start_7 == 0) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-02-05 10:32:27,558 INFO L101 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-02-05 10:32:27,559 INFO L101 nessWitnessExtractor]: Location invariant before [L77-L77] (((seq_2_start_8 == 0) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-02-05 10:32:27,559 INFO L101 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-02-05 10:32:27,559 INFO L101 nessWitnessExtractor]: Location invariant before [L71-L71] (((((((((seq_2_start_2 == 0) && (score_3 == 0)) && (seq_1_start_4 == 0)) && (seq_2_start_5 == 0)) && (score_6 == 0)) && (seq_1_start_7 == 0)) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-02-05 10:32:27,559 INFO L101 nessWitnessExtractor]: Location invariant before [L51-L51] (((((4294967296LL + (long long )s1) + (long long )s2 >= 0LL) && ((4294967295LL - (long long )s1) + (long long )s2 >= 0LL)) && ((4294967295LL + (long long )s1) - (long long )s2 >= 0LL)) && ((4294967294LL - (long long )s1) - (long long )s2 >= 0LL)) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:32:27,559 INFO L101 nessWitnessExtractor]: Location invariant after [L51-L51] (((((4294967296LL + (long long )s1) + (long long )s2 >= 0LL) && ((4294967295LL - (long long )s1) + (long long )s2 >= 0LL)) && ((4294967295LL + (long long )s1) - (long long )s2 >= 0LL)) && ((4294967294LL - (long long )s1) - (long long )s2 >= 0LL)) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:32:27,559 INFO L101 nessWitnessExtractor]: Location invariant before [L43-L43] (((((4294967296LL + (long long )s1) + (long long )s2 >= 0LL) && ((4294967295LL - (long long )s1) + (long long )s2 >= 0LL)) && ((4294967295LL + (long long )s1) - (long long )s2 >= 0LL)) && ((4294967294LL - (long long )s1) - (long long )s2 >= 0LL)) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:32:27,559 INFO L101 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-02-05 10:32:27,560 INFO L101 nessWitnessExtractor]: Location invariant before [L80-L80] ((result_9 == 0) && (result_10 == 0)) && (result_11 == 0) [2024-02-05 10:32:27,560 INFO L101 nessWitnessExtractor]: Location invariant after [L60-L60] (unsigned long )_argptr == 0UL [2024-02-05 10:32:27,560 INFO L101 nessWitnessExtractor]: Location invariant before [L74-L74] ((((((seq_2_start_5 == 0) && (score_6 == 0)) && (seq_1_start_7 == 0)) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-02-05 10:32:27,560 INFO L101 nessWitnessExtractor]: Location invariant before [L63-L63] (unsigned long )_argptr == 0UL [2024-02-05 10:32:27,560 INFO L101 nessWitnessExtractor]: Location invariant before [L75-L75] (((((score_6 == 0) && (seq_1_start_7 == 0)) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-02-05 10:32:27,560 INFO L101 nessWitnessExtractor]: Location invariant after [L43-L43] (((((4294967296LL + (long long )s1) + (long long )s2 >= 0LL) && ((4294967295LL - (long long )s1) + (long long )s2 >= 0LL)) && ((4294967295LL + (long long )s1) - (long long )s2 >= 0LL)) && ((4294967294LL - (long long )s1) - (long long )s2 >= 0LL)) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:32:27,579 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-02-05 10:32:27,742 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-match-subst.wvr.c[3056,3069] [2024-02-05 10:32:27,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:32:27,764 INFO L204 MainTranslator]: Completed pre-run [2024-02-05 10:32:27,788 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-02-05 10:32:27,788 WARN L424 MainDispatcher]: Unable to annotate s1 = plus(seq_1_start_1, seq_2_start_2) with a witness entry [2024-02-05 10:32:27,789 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-02-05 10:32:27,789 WARN L424 MainDispatcher]: Unable to annotate s2 = plus(seq_1_start_4, seq_2_start_5) with a witness entry Start Parsing Local [2024-02-05 10:32:27,817 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-02-05 10:32:27,817 WARN L424 MainDispatcher]: Unable to annotate s1 = plus(seq_1_start_1, seq_2_start_2) with a witness entry [2024-02-05 10:32:27,818 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-02-05 10:32:27,818 WARN L424 MainDispatcher]: Unable to annotate s2 = plus(seq_1_start_7, seq_2_start_8) with a witness entry Start Parsing Local [2024-02-05 10:32:27,839 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-02-05 10:32:27,839 WARN L424 MainDispatcher]: Unable to annotate s1 = plus(seq_1_start_4, seq_2_start_5) with a witness entry [2024-02-05 10:32:27,840 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-02-05 10:32:27,845 WARN L424 MainDispatcher]: Unable to annotate s2 = plus(seq_1_start_7, seq_2_start_8) 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 [2024-02-05 10:32:27,865 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-match-subst.wvr.c[3056,3069] Start Parsing Local Start Parsing Local [2024-02-05 10:32:27,868 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:32:27,893 INFO L208 MainTranslator]: Completed translation [2024-02-05 10:32:27,894 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:27 WrapperNode [2024-02-05 10:32:27,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-05 10:32:27,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-05 10:32:27,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-05 10:32:27,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-05 10:32:27,902 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 05.02 10:32:27" (1/1) ... [2024-02-05 10:32:27,921 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 05.02 10:32:27" (1/1) ... [2024-02-05 10:32:27,956 INFO L138 Inliner]: procedures = 23, calls = 34, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 242 [2024-02-05 10:32:27,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-05 10:32:27,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-05 10:32:27,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-05 10:32:27,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-05 10:32:27,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:27" (1/1) ... [2024-02-05 10:32:27,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:27" (1/1) ... [2024-02-05 10:32:27,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:27" (1/1) ... [2024-02-05 10:32:28,009 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-02-05 10:32:28,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:27" (1/1) ... [2024-02-05 10:32:28,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:27" (1/1) ... [2024-02-05 10:32:28,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:27" (1/1) ... [2024-02-05 10:32:28,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:27" (1/1) ... [2024-02-05 10:32:28,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:27" (1/1) ... [2024-02-05 10:32:28,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:27" (1/1) ... [2024-02-05 10:32:28,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-05 10:32:28,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-05 10:32:28,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-05 10:32:28,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-05 10:32:28,040 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:27" (1/1) ... [2024-02-05 10:32:28,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:32:28,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:32:28,117 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-02-05 10:32:28,124 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-02-05 10:32:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-05 10:32:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-05 10:32:28,168 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-05 10:32:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-05 10:32:28,168 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-05 10:32:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-05 10:32:28,168 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-05 10:32:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-05 10:32:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-05 10:32:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-05 10:32:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-05 10:32:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-05 10:32:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-05 10:32:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-05 10:32:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-05 10:32:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-05 10:32:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-05 10:32:28,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-05 10:32:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-05 10:32:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-05 10:32:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-05 10:32:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-05 10:32:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-05 10:32:28,172 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-05 10:32:28,291 INFO L244 CfgBuilder]: Building ICFG [2024-02-05 10:32:28,293 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-05 10:32:28,630 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-05 10:32:28,630 INFO L293 CfgBuilder]: Performing block encoding [2024-02-05 10:32:28,862 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-05 10:32:28,863 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-05 10:32:28,864 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:32:28 BoogieIcfgContainer [2024-02-05 10:32:28,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-05 10:32:28,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-05 10:32:28,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-05 10:32:28,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-05 10:32:28,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:32:27" (1/4) ... [2024-02-05 10:32:28,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5338672e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:32:28, skipping insertion in model container [2024-02-05 10:32:28,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:32:27" (2/4) ... [2024-02-05 10:32:28,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5338672e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:32:28, skipping insertion in model container [2024-02-05 10:32:28,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:27" (3/4) ... [2024-02-05 10:32:28,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5338672e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:32:28, skipping insertion in model container [2024-02-05 10:32:28,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:32:28" (4/4) ... [2024-02-05 10:32:28,873 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-subst.wvr.c [2024-02-05 10:32:28,887 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-05 10:32:28,888 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-02-05 10:32:28,888 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-05 10:32:28,948 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-05 10:32:28,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 71 transitions, 163 flow [2024-02-05 10:32:28,998 INFO L124 PetriNetUnfolderBase]: 0/68 cut-off events. [2024-02-05 10:32:28,998 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-05 10:32:29,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 68 events. 0/68 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 130 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-02-05 10:32:29,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 71 transitions, 163 flow [2024-02-05 10:32:29,002 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 67 transitions, 152 flow [2024-02-05 10:32:29,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-05 10:32:29,014 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;@5da2cd3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-05 10:32:29,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-02-05 10:32:29,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-05 10:32:29,017 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-05 10:32:29,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:32:29,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:29,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-05 10:32:29,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-02-05 10:32:29,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:29,022 INFO L85 PathProgramCache]: Analyzing trace with hash 23960, now seen corresponding path program 1 times [2024-02-05 10:32:29,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:29,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274081220] [2024-02-05 10:32:29,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:29,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:29,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:29,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274081220] [2024-02-05 10:32:29,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274081220] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:29,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:29,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:29,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969640380] [2024-02-05 10:32:29,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:29,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:29,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:29,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:29,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:29,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-02-05 10:32:29,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-02-05 10:32:29,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:29,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-02-05 10:32:29,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:30,010 INFO L124 PetriNetUnfolderBase]: 1782/3242 cut-off events. [2024-02-05 10:32:30,011 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2024-02-05 10:32:30,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6132 conditions, 3242 events. 1782/3242 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19005 event pairs, 1782 based on Foata normal form. 0/3233 useless extension candidates. Maximal degree in co-relation 5437. Up to 2714 conditions per place. [2024-02-05 10:32:30,035 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 48 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-02-05 10:32:30,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 66 transitions, 250 flow [2024-02-05 10:32:30,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-02-05 10:32:30,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070422535211268 [2024-02-05 10:32:30,047 INFO L175 Difference]: Start difference. First operand has 77 places, 67 transitions, 152 flow. Second operand 3 states and 108 transitions. [2024-02-05 10:32:30,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 66 transitions, 250 flow [2024-02-05 10:32:30,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 238 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-02-05 10:32:30,058 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 142 flow [2024-02-05 10:32:30,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2024-02-05 10:32:30,062 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -5 predicate places. [2024-02-05 10:32:30,063 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 142 flow [2024-02-05 10:32:30,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-02-05 10:32:30,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:30,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-05 10:32:30,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-05 10:32:30,067 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-02-05 10:32:30,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:30,072 INFO L85 PathProgramCache]: Analyzing trace with hash 743535, now seen corresponding path program 1 times [2024-02-05 10:32:30,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:30,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959519284] [2024-02-05 10:32:30,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:30,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:30,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959519284] [2024-02-05 10:32:30,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959519284] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:30,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:30,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:30,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879747446] [2024-02-05 10:32:30,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:30,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:30,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:30,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:30,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:30,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-02-05 10:32:30,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02-05 10:32:30,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:30,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-02-05 10:32:30,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:30,538 INFO L124 PetriNetUnfolderBase]: 1782/3241 cut-off events. [2024-02-05 10:32:30,539 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-02-05 10:32:30,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6016 conditions, 3241 events. 1782/3241 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19007 event pairs, 1782 based on Foata normal form. 0/3233 useless extension candidates. Maximal degree in co-relation 6007. Up to 2712 conditions per place. [2024-02-05 10:32:30,555 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 47 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-02-05 10:32:30,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 238 flow [2024-02-05 10:32:30,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-02-05 10:32:30,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5164319248826291 [2024-02-05 10:32:30,558 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 142 flow. Second operand 3 states and 110 transitions. [2024-02-05 10:32:30,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 238 flow [2024-02-05 10:32:30,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 65 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:32:30,560 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 140 flow [2024-02-05 10:32:30,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2024-02-05 10:32:30,561 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -6 predicate places. [2024-02-05 10:32:30,561 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 140 flow [2024-02-05 10:32:30,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02-05 10:32:30,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:30,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-05 10:32:30,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-05 10:32:30,562 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-02-05 10:32:30,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash 23050317, now seen corresponding path program 1 times [2024-02-05 10:32:30,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:30,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252927653] [2024-02-05 10:32:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:30,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:30,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252927653] [2024-02-05 10:32:30,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252927653] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:30,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:30,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:30,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374378353] [2024-02-05 10:32:30,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:30,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:30,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:30,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:30,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 71 [2024-02-05 10:32:30,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-02-05 10:32:30,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:30,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 71 [2024-02-05 10:32:30,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:30,886 INFO L124 PetriNetUnfolderBase]: 1782/3240 cut-off events. [2024-02-05 10:32:30,887 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-02-05 10:32:30,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6014 conditions, 3240 events. 1782/3240 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19008 event pairs, 1782 based on Foata normal form. 0/3233 useless extension candidates. Maximal degree in co-relation 6003. Up to 2710 conditions per place. [2024-02-05 10:32:30,902 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 46 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-02-05 10:32:30,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 234 flow [2024-02-05 10:32:30,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-02-05 10:32:30,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258215962441315 [2024-02-05 10:32:30,904 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 140 flow. Second operand 3 states and 112 transitions. [2024-02-05 10:32:30,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 234 flow [2024-02-05 10:32:30,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 64 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:32:30,905 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 138 flow [2024-02-05 10:32:30,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2024-02-05 10:32:30,906 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -7 predicate places. [2024-02-05 10:32:30,906 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 138 flow [2024-02-05 10:32:30,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-02-05 10:32:30,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:30,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-05 10:32:30,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-05 10:32:30,907 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-02-05 10:32:30,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:30,907 INFO L85 PathProgramCache]: Analyzing trace with hash 714560600, now seen corresponding path program 1 times [2024-02-05 10:32:30,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:30,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756898530] [2024-02-05 10:32:30,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:30,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:30,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:30,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756898530] [2024-02-05 10:32:30,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756898530] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:30,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:30,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:30,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284568976] [2024-02-05 10:32:30,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:30,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:30,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:30,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:30,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:30,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 71 [2024-02-05 10:32:30,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-02-05 10:32:30,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:30,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 71 [2024-02-05 10:32:30,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:31,198 INFO L124 PetriNetUnfolderBase]: 1782/3239 cut-off events. [2024-02-05 10:32:31,199 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-02-05 10:32:31,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6012 conditions, 3239 events. 1782/3239 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19007 event pairs, 1782 based on Foata normal form. 0/3233 useless extension candidates. Maximal degree in co-relation 5999. Up to 2708 conditions per place. [2024-02-05 10:32:31,217 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 45 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-02-05 10:32:31,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 230 flow [2024-02-05 10:32:31,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-02-05 10:32:31,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5352112676056338 [2024-02-05 10:32:31,222 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 138 flow. Second operand 3 states and 114 transitions. [2024-02-05 10:32:31,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 230 flow [2024-02-05 10:32:31,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:32:31,229 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 136 flow [2024-02-05 10:32:31,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2024-02-05 10:32:31,230 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -8 predicate places. [2024-02-05 10:32:31,230 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 136 flow [2024-02-05 10:32:31,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-02-05 10:32:31,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:31,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-05 10:32:31,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-05 10:32:31,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-02-05 10:32:31,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:31,231 INFO L85 PathProgramCache]: Analyzing trace with hash 676542871, now seen corresponding path program 1 times [2024-02-05 10:32:31,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:31,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035290099] [2024-02-05 10:32:31,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:31,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:31,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:31,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035290099] [2024-02-05 10:32:31,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035290099] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:31,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:31,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:31,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134028613] [2024-02-05 10:32:31,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:31,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:31,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:31,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:31,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:31,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 71 [2024-02-05 10:32:31,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-02-05 10:32:31,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:31,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 71 [2024-02-05 10:32:31,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:31,527 INFO L124 PetriNetUnfolderBase]: 1782/3238 cut-off events. [2024-02-05 10:32:31,527 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-02-05 10:32:31,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6010 conditions, 3238 events. 1782/3238 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19007 event pairs, 1782 based on Foata normal form. 0/3233 useless extension candidates. Maximal degree in co-relation 5995. Up to 2706 conditions per place. [2024-02-05 10:32:31,541 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 44 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-02-05 10:32:31,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 226 flow [2024-02-05 10:32:31,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-02-05 10:32:31,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5446009389671361 [2024-02-05 10:32:31,543 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 136 flow. Second operand 3 states and 116 transitions. [2024-02-05 10:32:31,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 226 flow [2024-02-05 10:32:31,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 62 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:32:31,544 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 134 flow [2024-02-05 10:32:31,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2024-02-05 10:32:31,545 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -9 predicate places. [2024-02-05 10:32:31,545 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 134 flow [2024-02-05 10:32:31,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-02-05 10:32:31,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:31,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:31,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-05 10:32:31,546 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-02-05 10:32:31,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:31,546 INFO L85 PathProgramCache]: Analyzing trace with hash -502006749, now seen corresponding path program 1 times [2024-02-05 10:32:31,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:31,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430537271] [2024-02-05 10:32:31,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:31,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:31,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:31,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430537271] [2024-02-05 10:32:31,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430537271] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:31,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:31,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:31,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178474932] [2024-02-05 10:32:31,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:31,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:31,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:31,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:31,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:31,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 71 [2024-02-05 10:32:31,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-02-05 10:32:31,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:31,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 71 [2024-02-05 10:32:31,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:31,819 INFO L124 PetriNetUnfolderBase]: 1782/3237 cut-off events. [2024-02-05 10:32:31,820 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-02-05 10:32:31,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6008 conditions, 3237 events. 1782/3237 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19006 event pairs, 1782 based on Foata normal form. 0/3233 useless extension candidates. Maximal degree in co-relation 5991. Up to 2704 conditions per place. [2024-02-05 10:32:31,832 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 43 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2024-02-05 10:32:31,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 222 flow [2024-02-05 10:32:31,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-02-05 10:32:31,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5539906103286385 [2024-02-05 10:32:31,833 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 134 flow. Second operand 3 states and 118 transitions. [2024-02-05 10:32:31,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 222 flow [2024-02-05 10:32:31,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:32:31,834 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 132 flow [2024-02-05 10:32:31,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2024-02-05 10:32:31,835 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -10 predicate places. [2024-02-05 10:32:31,835 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 132 flow [2024-02-05 10:32:31,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-02-05 10:32:31,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:31,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:31,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-05 10:32:31,836 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-02-05 10:32:31,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1617660736, now seen corresponding path program 1 times [2024-02-05 10:32:31,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:31,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49107132] [2024-02-05 10:32:31,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:31,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:31,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:31,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49107132] [2024-02-05 10:32:31,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49107132] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:31,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:31,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:31,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656992611] [2024-02-05 10:32:31,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:31,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:31,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:31,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:31,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:31,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 71 [2024-02-05 10:32:31,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-02-05 10:32:31,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:31,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 71 [2024-02-05 10:32:31,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:32,083 INFO L124 PetriNetUnfolderBase]: 1782/3236 cut-off events. [2024-02-05 10:32:32,083 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-02-05 10:32:32,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6006 conditions, 3236 events. 1782/3236 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19009 event pairs, 1782 based on Foata normal form. 0/3233 useless extension candidates. Maximal degree in co-relation 5987. Up to 2702 conditions per place. [2024-02-05 10:32:32,095 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 42 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-02-05 10:32:32,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 218 flow [2024-02-05 10:32:32,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-02-05 10:32:32,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5633802816901409 [2024-02-05 10:32:32,096 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 132 flow. Second operand 3 states and 120 transitions. [2024-02-05 10:32:32,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 218 flow [2024-02-05 10:32:32,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:32:32,097 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 130 flow [2024-02-05 10:32:32,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-02-05 10:32:32,098 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -11 predicate places. [2024-02-05 10:32:32,098 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 130 flow [2024-02-05 10:32:32,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-02-05 10:32:32,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:32,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:32,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-05 10:32:32,099 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-02-05 10:32:32,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:32,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1392123959, now seen corresponding path program 1 times [2024-02-05 10:32:32,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:32,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101810398] [2024-02-05 10:32:32,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:32,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:32,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:32,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101810398] [2024-02-05 10:32:32,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101810398] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:32,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:32,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:32,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576188008] [2024-02-05 10:32:32,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:32,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:32,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:32,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:32,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:32,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 71 [2024-02-05 10:32:32,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-02-05 10:32:32,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:32,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 71 [2024-02-05 10:32:32,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:32,336 INFO L124 PetriNetUnfolderBase]: 1782/3235 cut-off events. [2024-02-05 10:32:32,336 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-02-05 10:32:32,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6004 conditions, 3235 events. 1782/3235 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19008 event pairs, 1782 based on Foata normal form. 0/3233 useless extension candidates. Maximal degree in co-relation 5983. Up to 2700 conditions per place. [2024-02-05 10:32:32,346 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 41 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2024-02-05 10:32:32,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 214 flow [2024-02-05 10:32:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-02-05 10:32:32,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5727699530516432 [2024-02-05 10:32:32,347 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 130 flow. Second operand 3 states and 122 transitions. [2024-02-05 10:32:32,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 214 flow [2024-02-05 10:32:32,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:32:32,348 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 128 flow [2024-02-05 10:32:32,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-02-05 10:32:32,349 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -12 predicate places. [2024-02-05 10:32:32,349 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 128 flow [2024-02-05 10:32:32,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-02-05 10:32:32,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:32,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:32,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-05 10:32:32,350 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-02-05 10:32:32,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash -206169033, now seen corresponding path program 1 times [2024-02-05 10:32:32,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:32,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548554823] [2024-02-05 10:32:32,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:32,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:32,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548554823] [2024-02-05 10:32:32,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548554823] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:32,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:32,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:32,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733437906] [2024-02-05 10:32:32,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:32,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:32,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:32,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:32,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:32,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 71 [2024-02-05 10:32:32,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-02-05 10:32:32,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:32,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 71 [2024-02-05 10:32:32,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:32,592 INFO L124 PetriNetUnfolderBase]: 1782/3234 cut-off events. [2024-02-05 10:32:32,593 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-02-05 10:32:32,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6002 conditions, 3234 events. 1782/3234 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19005 event pairs, 1782 based on Foata normal form. 0/3233 useless extension candidates. Maximal degree in co-relation 5979. Up to 2698 conditions per place. [2024-02-05 10:32:32,601 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 40 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2024-02-05 10:32:32,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 58 transitions, 210 flow [2024-02-05 10:32:32,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:32,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:32,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-02-05 10:32:32,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5821596244131455 [2024-02-05 10:32:32,603 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 128 flow. Second operand 3 states and 124 transitions. [2024-02-05 10:32:32,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 58 transitions, 210 flow [2024-02-05 10:32:32,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:32:32,604 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 126 flow [2024-02-05 10:32:32,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-02-05 10:32:32,604 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -13 predicate places. [2024-02-05 10:32:32,605 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 126 flow [2024-02-05 10:32:32,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-02-05 10:32:32,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:32,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:32,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-05 10:32:32,605 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-02-05 10:32:32,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2096271989, now seen corresponding path program 1 times [2024-02-05 10:32:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:32,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388086708] [2024-02-05 10:32:32,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:32,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:32,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:32,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388086708] [2024-02-05 10:32:32,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388086708] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:32,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:32,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:32,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374570843] [2024-02-05 10:32:32,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:32,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:32,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:32,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:32,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:32,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 71 [2024-02-05 10:32:32,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-02-05 10:32:32,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:32,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 71 [2024-02-05 10:32:32,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:32,866 INFO L124 PetriNetUnfolderBase]: 1782/3205 cut-off events. [2024-02-05 10:32:32,866 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-02-05 10:32:32,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5972 conditions, 3205 events. 1782/3205 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 18834 event pairs, 712 based on Foata normal form. 0/3205 useless extension candidates. Maximal degree in co-relation 5947. Up to 1821 conditions per place. [2024-02-05 10:32:32,877 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 57 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2024-02-05 10:32:32,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 77 transitions, 288 flow [2024-02-05 10:32:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-02-05 10:32:32,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6854460093896714 [2024-02-05 10:32:32,879 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 126 flow. Second operand 3 states and 146 transitions. [2024-02-05 10:32:32,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 77 transitions, 288 flow [2024-02-05 10:32:32,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:32:32,880 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 144 flow [2024-02-05 10:32:32,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2024-02-05 10:32:32,881 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -13 predicate places. [2024-02-05 10:32:32,881 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 144 flow [2024-02-05 10:32:32,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-02-05 10:32:32,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:32,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:32,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-05 10:32:32,882 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-02-05 10:32:32,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:32,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1213527413, now seen corresponding path program 1 times [2024-02-05 10:32:32,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:32,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57922419] [2024-02-05 10:32:32,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:32,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-05 10:32:32,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-05 10:32:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-05 10:32:32,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-05 10:32:32,917 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-05 10:32:32,917 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 44 remaining) [2024-02-05 10:32:32,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 44 remaining) [2024-02-05 10:32:32,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 44 remaining) [2024-02-05 10:32:32,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 44 remaining) [2024-02-05 10:32:32,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 44 remaining) [2024-02-05 10:32:32,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 44 remaining) [2024-02-05 10:32:32,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 44 remaining) [2024-02-05 10:32:32,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 44 remaining) [2024-02-05 10:32:32,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 44 remaining) [2024-02-05 10:32:32,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 44 remaining) [2024-02-05 10:32:32,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 44 remaining) [2024-02-05 10:32:32,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 44 remaining) [2024-02-05 10:32:32,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 44 remaining) [2024-02-05 10:32:32,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 44 remaining) [2024-02-05 10:32:32,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 44 remaining) [2024-02-05 10:32:32,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 44 remaining) [2024-02-05 10:32:32,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 44 remaining) [2024-02-05 10:32:32,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 44 remaining) [2024-02-05 10:32:32,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 44 remaining) [2024-02-05 10:32:32,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 44 remaining) [2024-02-05 10:32:32,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 44 remaining) [2024-02-05 10:32:32,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 44 remaining) [2024-02-05 10:32:32,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 44 remaining) [2024-02-05 10:32:32,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 44 remaining) [2024-02-05 10:32:32,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 44 remaining) [2024-02-05 10:32:32,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 44 remaining) [2024-02-05 10:32:32,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (17 of 44 remaining) [2024-02-05 10:32:32,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 44 remaining) [2024-02-05 10:32:32,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 44 remaining) [2024-02-05 10:32:32,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 44 remaining) [2024-02-05 10:32:32,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 44 remaining) [2024-02-05 10:32:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 44 remaining) [2024-02-05 10:32:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 44 remaining) [2024-02-05 10:32:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 44 remaining) [2024-02-05 10:32:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 44 remaining) [2024-02-05 10:32:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 44 remaining) [2024-02-05 10:32:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 44 remaining) [2024-02-05 10:32:32,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 44 remaining) [2024-02-05 10:32:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 44 remaining) [2024-02-05 10:32:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 44 remaining) [2024-02-05 10:32:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 44 remaining) [2024-02-05 10:32:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 44 remaining) [2024-02-05 10:32:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 44 remaining) [2024-02-05 10:32:32,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 44 remaining) [2024-02-05 10:32:32,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-05 10:32:32,926 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:32,930 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-05 10:32:32,931 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-05 10:32:32,951 INFO L503 ceAbstractionStarter]: Automizer considered 25 witness invariants [2024-02-05 10:32:32,952 INFO L504 ceAbstractionStarter]: WitnessConsidered=25 [2024-02-05 10:32:32,952 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:32:32 BasicIcfg [2024-02-05 10:32:32,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-05 10:32:32,953 INFO L158 Benchmark]: Toolchain (without parser) took 5448.06ms. Allocated memory was 163.6MB in the beginning and 524.3MB in the end (delta: 360.7MB). Free memory was 83.6MB in the beginning and 442.0MB in the end (delta: -358.4MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-02-05 10:32:32,953 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:32:32,953 INFO L158 Benchmark]: Witness Parser took 0.40ms. Allocated memory is still 163.6MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:32:32,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.97ms. Allocated memory was 163.6MB in the beginning and 228.6MB in the end (delta: 65.0MB). Free memory was 83.3MB in the beginning and 197.2MB in the end (delta: -113.9MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-02-05 10:32:32,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.83ms. Allocated memory is still 228.6MB. Free memory was 197.2MB in the beginning and 194.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-05 10:32:32,954 INFO L158 Benchmark]: Boogie Preprocessor took 78.42ms. Allocated memory is still 228.6MB. Free memory was 194.1MB in the beginning and 190.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-05 10:32:32,954 INFO L158 Benchmark]: RCFGBuilder took 825.43ms. Allocated memory is still 228.6MB. Free memory was 190.9MB in the beginning and 110.2MB in the end (delta: 80.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-02-05 10:32:32,954 INFO L158 Benchmark]: TraceAbstraction took 4085.41ms. Allocated memory was 228.6MB in the beginning and 524.3MB in the end (delta: 295.7MB). Free memory was 109.1MB in the beginning and 442.0MB in the end (delta: -332.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:32:32,955 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.18ms. Allocated memory is still 163.6MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.40ms. Allocated memory is still 163.6MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.97ms. Allocated memory was 163.6MB in the beginning and 228.6MB in the end (delta: 65.0MB). Free memory was 83.3MB in the beginning and 197.2MB in the end (delta: -113.9MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.83ms. Allocated memory is still 228.6MB. Free memory was 197.2MB in the beginning and 194.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.42ms. Allocated memory is still 228.6MB. Free memory was 194.1MB in the beginning and 190.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 825.43ms. Allocated memory is still 228.6MB. Free memory was 190.9MB in the beginning and 110.2MB in the end (delta: 80.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4085.41ms. Allocated memory was 228.6MB in the beginning and 524.3MB in the end (delta: 295.7MB). Free memory was 109.1MB in the beginning and 442.0MB in the end (delta: -332.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 95]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 int score_0, seq_1_start_1, seq_2_start_2, score_3, seq_1_start_4, seq_2_start_5, score_6, seq_1_start_7, seq_2_start_8, result_9, result_10, result_11; [L67] 0 pthread_t t1, t2, t3; VAL [result_10=0, result_11=0, result_9=0, score_0=0, score_3=0, score_6=0, seq_1_start_1=0, seq_1_start_4=0, seq_1_start_7=0, seq_2_start_2=0, seq_2_start_5=0, seq_2_start_8=0, t1={6:0}, t2={5:0}, t3={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[score_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[score_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[score_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L69] 0 score_0 = __VERIFIER_nondet_int() [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[score_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[score_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L70] 0 seq_1_start_1 = __VERIFIER_nondet_int() [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[score_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[score_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L71] 0 seq_2_start_2 = __VERIFIER_nondet_int() [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[score_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[score_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L72] 0 score_3 = __VERIFIER_nondet_int() [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[score_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L73] 0 seq_1_start_4 =__VERIFIER_nondet_int() [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[score_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L74] 0 seq_2_start_5 = __VERIFIER_nondet_int() [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[score_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L75] 0 score_6 = __VERIFIER_nondet_int() [L76] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L76] 0 seq_1_start_7 =__VERIFIER_nondet_int() [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L77] 0 seq_2_start_8 = __VERIFIER_nondet_int() [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L80] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [result_10=0, result_11=0, result_9=0, score_0=0, score_3=0, score_6=0, seq_1_start_1=-2, seq_1_start_4=0, seq_1_start_7=0, seq_2_start_2=0, seq_2_start_5=0, seq_2_start_8=0, t1={6:0}, t2={5:0}, t3={3:0}] [L43] CALL 1 plus(seq_1_start_1, seq_2_start_2) [L95] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IdentifierExpression[b],UnaryExpression[MINUS,IntegerLiteral[1]]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=-2, \old(b)=0, a=-2, b=0, result_10=0, result_11=0, result_9=0, score_0=0, score_3=0, score_6=0, seq_1_start_1=-2, seq_1_start_4=0, seq_1_start_7=0, seq_2_start_2=0, seq_2_start_5=0, seq_2_start_8=0] - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 80]: 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: 82]: 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: 81]: 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, 111 locations, 44 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 903 IncrementalHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 39 mSDtfsCounter, 903 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=0, InterpolantAutomatonStates: 30, 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.6s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 1045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-02-05 10:32:32,992 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