./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-match-trans.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-trans.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-trans.wvr.c ./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/chl-match-trans.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-d8006e4-m [2024-02-05 10:32:28,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-05 10:32:28,201 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:28,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-05 10:32:28,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-05 10:32:28,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-05 10:32:28,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-05 10:32:28,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-05 10:32:28,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-05 10:32:28,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-05 10:32:28,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-05 10:32:28,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-05 10:32:28,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-05 10:32:28,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-05 10:32:28,239 INFO L153 SettingsManager]: * Use SBE=true [2024-02-05 10:32:28,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-05 10:32:28,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-05 10:32:28,240 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-05 10:32:28,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-05 10:32:28,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-05 10:32:28,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-05 10:32:28,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-05 10:32:28,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-05 10:32:28,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-05 10:32:28,241 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-05 10:32:28,242 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-05 10:32:28,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-05 10:32:28,242 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-05 10:32:28,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-05 10:32:28,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-05 10:32:28,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-05 10:32:28,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-05 10:32:28,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:32:28,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-05 10:32:28,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-05 10:32:28,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-05 10:32:28,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-05 10:32:28,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-05 10:32:28,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-05 10:32:28,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-05 10:32:28,245 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-05 10:32:28,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-05 10:32:28,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-05 10:32:28,246 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:28,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-05 10:32:28,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-05 10:32:28,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-05 10:32:28,546 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-05 10:32:28,546 INFO L274 PluginConnector]: CDTParser initialized [2024-02-05 10:32:28,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-match-trans.wvr.c [2024-02-05 10:32:29,625 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-05 10:32:29,852 INFO L384 CDTParser]: Found 1 translation units. [2024-02-05 10:32:29,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-trans.wvr.c [2024-02-05 10:32:29,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1026cd0e/36d53688c54f4274900facd40c46feed/FLAGec69c769f [2024-02-05 10:32:29,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1026cd0e/36d53688c54f4274900facd40c46feed [2024-02-05 10:32:29,880 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-05 10:32:29,880 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-05 10:32:29,881 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-trans.wvr.yml/witness.yml [2024-02-05 10:32:29,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-05 10:32:29,979 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-05 10:32:29,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-05 10:32:29,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-05 10:32:29,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-05 10:32:29,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:32:29" (1/2) ... [2024-02-05 10:32:29,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f4a6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:29, skipping insertion in model container [2024-02-05 10:32:29,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:32:29" (1/2) ... [2024-02-05 10:32:29,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@53a1d7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:32:29, skipping insertion in model container [2024-02-05 10:32:29,993 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:29" (2/2) ... [2024-02-05 10:32:29,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f4a6e0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:29, skipping insertion in model container [2024-02-05 10:32:29,994 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:29" (2/2) ... [2024-02-05 10:32:29,994 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-05 10:32:30,043 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-05 10:32:30,044 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:30,044 INFO L101 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-02-05 10:32:30,044 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:30,045 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:30,045 INFO L101 nessWitnessExtractor]: Location invariant before [L95-L95] (1 <= b) && (b != 0) [2024-02-05 10:32:30,045 INFO L101 nessWitnessExtractor]: Location invariant before [L94-L94] (b <= -1) && (b != 0) [2024-02-05 10:32:30,045 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:30,045 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:30,046 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:30,046 INFO L101 nessWitnessExtractor]: Location invariant before [L80-L80] ((result_9 == 0) && (result_10 == 0)) && (result_11 == 0) [2024-02-05 10:32:30,046 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:30,046 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:30,046 INFO L101 nessWitnessExtractor]: Location invariant after [L60-L60] (unsigned long )_argptr == 0UL [2024-02-05 10:32:30,046 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:30,047 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:30,047 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:30,047 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:30,047 INFO L101 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-02-05 10:32:30,048 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:30,048 INFO L101 nessWitnessExtractor]: Location invariant after [L52-L52] (unsigned long )_argptr == 0UL [2024-02-05 10:32:30,048 INFO L101 nessWitnessExtractor]: Location invariant before [L63-L63] (unsigned long )_argptr == 0UL [2024-02-05 10:32:30,048 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:30,048 INFO L101 nessWitnessExtractor]: Location invariant after [L44-L44] (unsigned long )_argptr == 0UL [2024-02-05 10:32:30,048 INFO L101 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-02-05 10:32:30,049 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:30,049 INFO L101 nessWitnessExtractor]: Location invariant before [L60-L60] (unsigned long )_argptr == 0UL [2024-02-05 10:32:30,049 INFO L101 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-02-05 10:32:30,067 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-02-05 10:32:30,219 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-trans.wvr.c[2993,3006] [2024-02-05 10:32:30,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:32:30,245 INFO L204 MainTranslator]: Completed pre-run [2024-02-05 10:32:30,256 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-02-05 10:32:30,257 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:30,257 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-02-05 10:32:30,257 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:30,279 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-02-05 10:32:30,279 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:30,280 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-02-05 10:32:30,280 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:30,282 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-02-05 10:32:30,285 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:30,286 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-02-05 10:32:30,286 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:30,308 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-trans.wvr.c[2993,3006] Start Parsing Local Start Parsing Local [2024-02-05 10:32:30,312 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:32:30,339 INFO L208 MainTranslator]: Completed translation [2024-02-05 10:32:30,341 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:32:30 WrapperNode [2024-02-05 10:32:30,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-05 10:32:30,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-05 10:32:30,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-05 10:32:30,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-05 10:32:30,349 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:30" (1/1) ... [2024-02-05 10:32:30,369 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:30" (1/1) ... [2024-02-05 10:32:30,403 INFO L138 Inliner]: procedures = 23, calls = 33, calls flagged for inlining = 11, calls inlined = 21, statements flattened = 238 [2024-02-05 10:32:30,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-05 10:32:30,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-05 10:32:30,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-05 10:32:30,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-05 10:32:30,418 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:30" (1/1) ... [2024-02-05 10:32:30,418 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:30" (1/1) ... [2024-02-05 10:32:30,432 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:30" (1/1) ... [2024-02-05 10:32:30,451 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:30,451 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:30" (1/1) ... [2024-02-05 10:32:30,451 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:30" (1/1) ... [2024-02-05 10:32:30,464 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:30" (1/1) ... [2024-02-05 10:32:30,475 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:30" (1/1) ... [2024-02-05 10:32:30,477 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:30" (1/1) ... [2024-02-05 10:32:30,478 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:30" (1/1) ... [2024-02-05 10:32:30,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-05 10:32:30,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-05 10:32:30,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-05 10:32:30,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-05 10:32:30,488 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:30" (1/1) ... [2024-02-05 10:32:30,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:32:30,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:32:30,527 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:30,586 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:30,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-05 10:32:30,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-05 10:32:30,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-05 10:32:30,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-05 10:32:30,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-05 10:32:30,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-05 10:32:30,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-05 10:32:30,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-05 10:32:30,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-05 10:32:30,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-05 10:32:30,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-05 10:32:30,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-05 10:32:30,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-05 10:32:30,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-05 10:32:30,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-05 10:32:30,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-05 10:32:30,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-05 10:32:30,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-05 10:32:30,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-05 10:32:30,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-05 10:32:30,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-05 10:32:30,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-05 10:32:30,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-05 10:32:30,623 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:30,705 INFO L244 CfgBuilder]: Building ICFG [2024-02-05 10:32:30,706 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-05 10:32:31,002 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-05 10:32:31,002 INFO L293 CfgBuilder]: Performing block encoding [2024-02-05 10:32:31,258 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-05 10:32:31,258 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-05 10:32:31,260 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:32:31 BoogieIcfgContainer [2024-02-05 10:32:31,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-05 10:32:31,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-05 10:32:31,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-05 10:32:31,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-05 10:32:31,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:32:29" (1/4) ... [2024-02-05 10:32:31,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dddb119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:32:31, skipping insertion in model container [2024-02-05 10:32:31,266 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:29" (2/4) ... [2024-02-05 10:32:31,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dddb119 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:32:31, skipping insertion in model container [2024-02-05 10:32:31,266 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:30" (3/4) ... [2024-02-05 10:32:31,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dddb119 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:32:31, skipping insertion in model container [2024-02-05 10:32:31,267 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:31" (4/4) ... [2024-02-05 10:32:31,269 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-trans.wvr.c [2024-02-05 10:32:31,282 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-05 10:32:31,282 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-02-05 10:32:31,282 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-05 10:32:31,341 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-05 10:32:31,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 71 transitions, 163 flow [2024-02-05 10:32:31,433 INFO L124 PetriNetUnfolderBase]: 0/68 cut-off events. [2024-02-05 10:32:31,440 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-05 10:32:31,442 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 125 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:31,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 71 transitions, 163 flow [2024-02-05 10:32:31,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 67 transitions, 152 flow [2024-02-05 10:32:31,456 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-05 10:32:31,461 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;@681b3633, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-05 10:32:31,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-02-05 10:32:31,463 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-05 10:32:31,466 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-05 10:32:31,466 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:32:31,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:31,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-05 10:32:31,470 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:31,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash 23316, now seen corresponding path program 1 times [2024-02-05 10:32:31,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:31,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379569002] [2024-02-05 10:32:31,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:31,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:31,799 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,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:31,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379569002] [2024-02-05 10:32:31,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379569002] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:31,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:31,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:31,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811774372] [2024-02-05 10:32:31,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:31,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:31,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:31,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:31,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:31,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-02-05 10:32:31,855 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:31,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:31,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-02-05 10:32:31,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:32,241 INFO L124 PetriNetUnfolderBase]: 1782/3261 cut-off events. [2024-02-05 10:32:32,241 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2024-02-05 10:32:32,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6151 conditions, 3261 events. 1782/3261 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19295 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 5456. Up to 2714 conditions per place. [2024-02-05 10:32:32,263 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 48 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-02-05 10:32:32,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 66 transitions, 250 flow [2024-02-05 10:32:32,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:32,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-02-05 10:32:32,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070422535211268 [2024-02-05 10:32:32,274 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:32,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 66 transitions, 250 flow [2024-02-05 10:32:32,279 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:32,281 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 142 flow [2024-02-05 10:32:32,283 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:32,285 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -5 predicate places. [2024-02-05 10:32:32,285 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 142 flow [2024-02-05 10:32:32,286 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:32,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:32,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-05 10:32:32,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-05 10:32:32,286 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:32,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:32,287 INFO L85 PathProgramCache]: Analyzing trace with hash 723551, now seen corresponding path program 1 times [2024-02-05 10:32:32,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:32,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906504534] [2024-02-05 10:32:32,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:32,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:32,400 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,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:32,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906504534] [2024-02-05 10:32:32,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906504534] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:32,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:32,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:32,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326531225] [2024-02-05 10:32:32,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:32,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:32,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:32,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:32,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:32,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-02-05 10:32:32,433 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:32,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:32,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-02-05 10:32:32,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:32,837 INFO L124 PetriNetUnfolderBase]: 1782/3260 cut-off events. [2024-02-05 10:32:32,838 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-02-05 10:32:32,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6035 conditions, 3260 events. 1782/3260 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19294 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 6026. Up to 2712 conditions per place. [2024-02-05 10:32:32,885 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 47 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-02-05 10:32:32,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 238 flow [2024-02-05 10:32:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-02-05 10:32:32,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5164319248826291 [2024-02-05 10:32:32,889 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:32,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 238 flow [2024-02-05 10:32:32,890 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:32,892 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 140 flow [2024-02-05 10:32:32,892 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:32,893 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -6 predicate places. [2024-02-05 10:32:32,893 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 140 flow [2024-02-05 10:32:32,893 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:32,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:32,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-05 10:32:32,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-05 10:32:32,894 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:32,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash 22430787, now seen corresponding path program 1 times [2024-02-05 10:32:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:32,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230022152] [2024-02-05 10:32:32,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:32,992 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,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:32,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230022152] [2024-02-05 10:32:32,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230022152] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:32,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:32,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:32,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715525564] [2024-02-05 10:32:32,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:32,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:32,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:32,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:32,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:33,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 71 [2024-02-05 10:32:33,009 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:33,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:33,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 71 [2024-02-05 10:32:33,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:33,253 INFO L124 PetriNetUnfolderBase]: 1782/3259 cut-off events. [2024-02-05 10:32:33,254 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-02-05 10:32:33,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6033 conditions, 3259 events. 1782/3259 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19296 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 6022. Up to 2710 conditions per place. [2024-02-05 10:32:33,271 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 46 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-02-05 10:32:33,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 234 flow [2024-02-05 10:32:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-02-05 10:32:33,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258215962441315 [2024-02-05 10:32:33,276 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:33,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 234 flow [2024-02-05 10:32:33,277 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:33,277 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 138 flow [2024-02-05 10:32:33,277 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:33,278 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -7 predicate places. [2024-02-05 10:32:33,279 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 138 flow [2024-02-05 10:32:33,279 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:33,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:33,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-05 10:32:33,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-05 10:32:33,279 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:33,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:33,280 INFO L85 PathProgramCache]: Analyzing trace with hash 695355150, now seen corresponding path program 1 times [2024-02-05 10:32:33,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:33,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289896314] [2024-02-05 10:32:33,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:33,346 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:33,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:33,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289896314] [2024-02-05 10:32:33,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289896314] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:33,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:33,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:33,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071239850] [2024-02-05 10:32:33,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:33,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:33,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:33,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:33,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:33,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 71 [2024-02-05 10:32:33,362 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:33,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:33,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 71 [2024-02-05 10:32:33,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:33,597 INFO L124 PetriNetUnfolderBase]: 1782/3258 cut-off events. [2024-02-05 10:32:33,597 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-02-05 10:32:33,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6031 conditions, 3258 events. 1782/3258 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19295 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 6018. Up to 2708 conditions per place. [2024-02-05 10:32:33,609 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 45 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-02-05 10:32:33,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 230 flow [2024-02-05 10:32:33,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-02-05 10:32:33,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5352112676056338 [2024-02-05 10:32:33,612 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:33,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 230 flow [2024-02-05 10:32:33,615 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:33,616 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 136 flow [2024-02-05 10:32:33,617 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:33,618 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -8 predicate places. [2024-02-05 10:32:33,621 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 136 flow [2024-02-05 10:32:33,622 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:33,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:33,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-05 10:32:33,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-05 10:32:33,622 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:33,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:33,623 INFO L85 PathProgramCache]: Analyzing trace with hash 81173901, now seen corresponding path program 1 times [2024-02-05 10:32:33,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:33,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703524661] [2024-02-05 10:32:33,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:33,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:33,703 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:33,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:33,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703524661] [2024-02-05 10:32:33,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703524661] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:33,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:33,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:33,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663098828] [2024-02-05 10:32:33,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:33,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:33,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:33,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:33,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:33,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 71 [2024-02-05 10:32:33,721 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:33,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:33,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 71 [2024-02-05 10:32:33,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:33,989 INFO L124 PetriNetUnfolderBase]: 1782/3257 cut-off events. [2024-02-05 10:32:33,989 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-02-05 10:32:33,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6029 conditions, 3257 events. 1782/3257 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19294 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 6014. Up to 2706 conditions per place. [2024-02-05 10:32:34,005 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 44 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-02-05 10:32:34,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 226 flow [2024-02-05 10:32:34,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-02-05 10:32:34,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5446009389671361 [2024-02-05 10:32:34,007 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:34,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 226 flow [2024-02-05 10:32:34,007 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:34,008 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 134 flow [2024-02-05 10:32:34,008 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:34,009 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -9 predicate places. [2024-02-05 10:32:34,009 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 134 flow [2024-02-05 10:32:34,009 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:34,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:34,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:34,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-05 10:32:34,010 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:34,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:34,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1778575661, now seen corresponding path program 1 times [2024-02-05 10:32:34,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:34,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659877823] [2024-02-05 10:32:34,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:34,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:34,056 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:34,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:34,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659877823] [2024-02-05 10:32:34,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659877823] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:34,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:34,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:34,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457694064] [2024-02-05 10:32:34,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:34,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:34,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:34,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:34,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:34,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 71 [2024-02-05 10:32:34,069 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:34,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:34,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 71 [2024-02-05 10:32:34,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:34,330 INFO L124 PetriNetUnfolderBase]: 1782/3256 cut-off events. [2024-02-05 10:32:34,330 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-02-05 10:32:34,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6027 conditions, 3256 events. 1782/3256 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19293 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 6010. Up to 2704 conditions per place. [2024-02-05 10:32:34,343 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 43 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2024-02-05 10:32:34,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 222 flow [2024-02-05 10:32:34,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-02-05 10:32:34,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5539906103286385 [2024-02-05 10:32:34,345 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:34,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 222 flow [2024-02-05 10:32:34,345 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:34,346 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 132 flow [2024-02-05 10:32:34,346 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:34,347 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -10 predicate places. [2024-02-05 10:32:34,347 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 132 flow [2024-02-05 10:32:34,347 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:34,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:34,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:34,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-05 10:32:34,348 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:34,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash 698730106, now seen corresponding path program 1 times [2024-02-05 10:32:34,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:34,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930113083] [2024-02-05 10:32:34,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:34,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:34,386 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:34,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:34,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930113083] [2024-02-05 10:32:34,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930113083] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:34,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:34,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:34,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651687232] [2024-02-05 10:32:34,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:34,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:34,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:34,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:34,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:34,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 71 [2024-02-05 10:32:34,399 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:34,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:34,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 71 [2024-02-05 10:32:34,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:34,616 INFO L124 PetriNetUnfolderBase]: 1782/3255 cut-off events. [2024-02-05 10:32:34,617 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-02-05 10:32:34,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6025 conditions, 3255 events. 1782/3255 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19292 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 6006. Up to 2702 conditions per place. [2024-02-05 10:32:34,628 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 42 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-02-05 10:32:34,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 218 flow [2024-02-05 10:32:34,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-02-05 10:32:34,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5633802816901409 [2024-02-05 10:32:34,630 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:34,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 218 flow [2024-02-05 10:32:34,631 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:34,631 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 130 flow [2024-02-05 10:32:34,631 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:34,632 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -11 predicate places. [2024-02-05 10:32:34,632 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 130 flow [2024-02-05 10:32:34,632 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:34,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:34,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:34,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-05 10:32:34,633 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:34,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:34,633 INFO L85 PathProgramCache]: Analyzing trace with hash 185797563, now seen corresponding path program 1 times [2024-02-05 10:32:34,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:34,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628365991] [2024-02-05 10:32:34,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:34,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:34,667 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:34,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:34,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628365991] [2024-02-05 10:32:34,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628365991] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:34,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:34,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187603042] [2024-02-05 10:32:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:34,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:34,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:34,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:34,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:34,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 71 [2024-02-05 10:32:34,680 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:34,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:34,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 71 [2024-02-05 10:32:34,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:34,915 INFO L124 PetriNetUnfolderBase]: 1782/3254 cut-off events. [2024-02-05 10:32:34,915 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-02-05 10:32:34,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6023 conditions, 3254 events. 1782/3254 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19291 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 6002. Up to 2700 conditions per place. [2024-02-05 10:32:34,927 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 41 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2024-02-05 10:32:34,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 214 flow [2024-02-05 10:32:34,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-02-05 10:32:34,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5727699530516432 [2024-02-05 10:32:34,928 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:34,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 214 flow [2024-02-05 10:32:34,929 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:34,929 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 128 flow [2024-02-05 10:32:34,930 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:34,930 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -12 predicate places. [2024-02-05 10:32:34,930 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 128 flow [2024-02-05 10:32:34,930 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:34,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:34,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:34,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-05 10:32:34,931 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:34,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:34,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1464757865, now seen corresponding path program 1 times [2024-02-05 10:32:34,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:34,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640078682] [2024-02-05 10:32:34,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:34,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:34,963 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:34,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:34,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640078682] [2024-02-05 10:32:34,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640078682] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:34,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:34,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:34,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977188571] [2024-02-05 10:32:34,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:34,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:34,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:34,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:34,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:34,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 71 [2024-02-05 10:32:34,976 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:34,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:34,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 71 [2024-02-05 10:32:34,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:35,186 INFO L124 PetriNetUnfolderBase]: 1782/3253 cut-off events. [2024-02-05 10:32:35,186 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-02-05 10:32:35,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6021 conditions, 3253 events. 1782/3253 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19288 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 5998. Up to 2698 conditions per place. [2024-02-05 10:32:35,197 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 40 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2024-02-05 10:32:35,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 58 transitions, 210 flow [2024-02-05 10:32:35,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-02-05 10:32:35,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5821596244131455 [2024-02-05 10:32:35,198 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:35,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 58 transitions, 210 flow [2024-02-05 10:32:35,199 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:35,199 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 126 flow [2024-02-05 10:32:35,200 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:35,200 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -13 predicate places. [2024-02-05 10:32:35,200 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 126 flow [2024-02-05 10:32:35,200 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:35,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:35,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:35,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-05 10:32:35,201 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:35,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:35,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1837145729, now seen corresponding path program 1 times [2024-02-05 10:32:35,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:35,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168344669] [2024-02-05 10:32:35,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:35,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:35,227 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:35,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:35,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168344669] [2024-02-05 10:32:35,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168344669] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:35,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:35,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:32:35,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147878685] [2024-02-05 10:32:35,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:35,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:32:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:35,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:32:35,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:32:35,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 71 [2024-02-05 10:32:35,242 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:35,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:35,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 71 [2024-02-05 10:32:35,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:35,476 INFO L124 PetriNetUnfolderBase]: 1782/3232 cut-off events. [2024-02-05 10:32:35,476 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-02-05 10:32:35,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5999 conditions, 3232 events. 1782/3232 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19158 event pairs, 712 based on Foata normal form. 0/3232 useless extension candidates. Maximal degree in co-relation 5974. Up to 1821 conditions per place. [2024-02-05 10:32:35,488 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 57 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2024-02-05 10:32:35,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 77 transitions, 288 flow [2024-02-05 10:32:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:32:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:32:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-02-05 10:32:35,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6854460093896714 [2024-02-05 10:32:35,490 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:35,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 77 transitions, 288 flow [2024-02-05 10:32:35,490 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:35,491 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 144 flow [2024-02-05 10:32:35,491 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:35,492 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -13 predicate places. [2024-02-05 10:32:35,492 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 144 flow [2024-02-05 10:32:35,492 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:35,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:35,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:35,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-05 10:32:35,493 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:35,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:35,493 INFO L85 PathProgramCache]: Analyzing trace with hash 360633475, now seen corresponding path program 1 times [2024-02-05 10:32:35,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:35,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474413531] [2024-02-05 10:32:35,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:35,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-05 10:32:35,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-05 10:32:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-05 10:32:35,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-05 10:32:35,530 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-05 10:32:35,530 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 44 remaining) [2024-02-05 10:32:35,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 44 remaining) [2024-02-05 10:32:35,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 44 remaining) [2024-02-05 10:32:35,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 44 remaining) [2024-02-05 10:32:35,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 44 remaining) [2024-02-05 10:32:35,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 44 remaining) [2024-02-05 10:32:35,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 44 remaining) [2024-02-05 10:32:35,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 44 remaining) [2024-02-05 10:32:35,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 44 remaining) [2024-02-05 10:32:35,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 44 remaining) [2024-02-05 10:32:35,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 44 remaining) [2024-02-05 10:32:35,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 44 remaining) [2024-02-05 10:32:35,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 44 remaining) [2024-02-05 10:32:35,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 44 remaining) [2024-02-05 10:32:35,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 44 remaining) [2024-02-05 10:32:35,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 44 remaining) [2024-02-05 10:32:35,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 44 remaining) [2024-02-05 10:32:35,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 44 remaining) [2024-02-05 10:32:35,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 44 remaining) [2024-02-05 10:32:35,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 44 remaining) [2024-02-05 10:32:35,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 44 remaining) [2024-02-05 10:32:35,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 44 remaining) [2024-02-05 10:32:35,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 44 remaining) [2024-02-05 10:32:35,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 44 remaining) [2024-02-05 10:32:35,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 44 remaining) [2024-02-05 10:32:35,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 44 remaining) [2024-02-05 10:32:35,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (17 of 44 remaining) [2024-02-05 10:32:35,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 44 remaining) [2024-02-05 10:32:35,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 44 remaining) [2024-02-05 10:32:35,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 44 remaining) [2024-02-05 10:32:35,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 44 remaining) [2024-02-05 10:32:35,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 44 remaining) [2024-02-05 10:32:35,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 44 remaining) [2024-02-05 10:32:35,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 44 remaining) [2024-02-05 10:32:35,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 44 remaining) [2024-02-05 10:32:35,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 44 remaining) [2024-02-05 10:32:35,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 44 remaining) [2024-02-05 10:32:35,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 44 remaining) [2024-02-05 10:32:35,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 44 remaining) [2024-02-05 10:32:35,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 44 remaining) [2024-02-05 10:32:35,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 44 remaining) [2024-02-05 10:32:35,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 44 remaining) [2024-02-05 10:32:35,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 44 remaining) [2024-02-05 10:32:35,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 44 remaining) [2024-02-05 10:32:35,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-05 10:32:35,539 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:35,544 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-05 10:32:35,544 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-05 10:32:35,565 INFO L503 ceAbstractionStarter]: Automizer considered 25 witness invariants [2024-02-05 10:32:35,566 INFO L504 ceAbstractionStarter]: WitnessConsidered=25 [2024-02-05 10:32:35,566 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:32:35 BasicIcfg [2024-02-05 10:32:35,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-05 10:32:35,567 INFO L158 Benchmark]: Toolchain (without parser) took 5587.95ms. Allocated memory was 151.0MB in the beginning and 572.5MB in the end (delta: 421.5MB). Free memory was 115.4MB in the beginning and 455.7MB in the end (delta: -340.3MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2024-02-05 10:32:35,567 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:32:35,567 INFO L158 Benchmark]: Witness Parser took 1.45ms. Allocated memory is still 151.0MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:32:35,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.37ms. Allocated memory is still 151.0MB. Free memory was 115.4MB in the beginning and 96.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-02-05 10:32:35,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.84ms. Allocated memory is still 151.0MB. Free memory was 96.5MB in the beginning and 93.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-05 10:32:35,568 INFO L158 Benchmark]: Boogie Preprocessor took 79.99ms. Allocated memory is still 151.0MB. Free memory was 93.7MB in the beginning and 90.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-05 10:32:35,568 INFO L158 Benchmark]: RCFGBuilder took 775.20ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 90.2MB in the beginning and 145.9MB in the end (delta: -55.6MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2024-02-05 10:32:35,569 INFO L158 Benchmark]: TraceAbstraction took 4304.62ms. Allocated memory was 182.5MB in the beginning and 572.5MB in the end (delta: 390.1MB). Free memory was 145.9MB in the beginning and 455.7MB in the end (delta: -309.9MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. [2024-02-05 10:32:35,570 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 1.45ms. Allocated memory is still 151.0MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.37ms. Allocated memory is still 151.0MB. Free memory was 115.4MB in the beginning and 96.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.84ms. Allocated memory is still 151.0MB. Free memory was 96.5MB in the beginning and 93.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.99ms. Allocated memory is still 151.0MB. Free memory was 93.7MB in the beginning and 90.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 775.20ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 90.2MB in the beginning and 145.9MB in the end (delta: -55.6MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4304.62ms. Allocated memory was 182.5MB in the beginning and 572.5MB in the end (delta: 390.1MB). Free memory was 145.9MB in the beginning and 455.7MB in the end (delta: -309.9MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 94]: 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) [L94] 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: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: 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: 94]: 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: 94]: 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: 55]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: 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: 88]: 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: 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. - 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. - 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.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 0.7s 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.7s 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:35,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE