./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_1_pos.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_18-first-reads_unknown_1_pos.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b 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/goblint-regression/13-privatized_18-first-reads_unknown_1_pos.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_18-first-reads_unknown_1_pos.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-8857f20-m [2024-01-29 23:21:18,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 23:21:19,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 23:21:19,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 23:21:19,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 23:21:19,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 23:21:19,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 23:21:19,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 23:21:19,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 23:21:19,070 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 23:21:19,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 23:21:19,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 23:21:19,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 23:21:19,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 23:21:19,072 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 23:21:19,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 23:21:19,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 23:21:19,073 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 23:21:19,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 23:21:19,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 23:21:19,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 23:21:19,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 23:21:19,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 23:21:19,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 23:21:19,074 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 23:21:19,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 23:21:19,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 23:21:19,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 23:21:19,075 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 23:21:19,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 23:21:19,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 23:21:19,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 23:21:19,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:21:19,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 23:21:19,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 23:21:19,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 23:21:19,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 23:21:19,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 23:21:19,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 23:21:19,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 23:21:19,078 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 23:21:19,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 23:21:19,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 23:21:19,078 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 23:21:19,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 23:21:19,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 23:21:19,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 23:21:19,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 23:21:19,258 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 23:21:19,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_1_pos.i [2024-01-29 23:21:20,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 23:21:20,457 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 23:21:20,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_1_pos.i [2024-01-29 23:21:20,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/614b9397f/affb3e590c2e4c3191df44b5f38e457c/FLAGd9cbaa761 [2024-01-29 23:21:20,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/614b9397f/affb3e590c2e4c3191df44b5f38e457c [2024-01-29 23:21:20,490 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 23:21:20,493 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 23:21:20,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_18-first-reads_unknown_1_pos.yml/witness.yml [2024-01-29 23:21:20,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 23:21:20,598 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 23:21:20,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 23:21:20,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 23:21:20,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 23:21:20,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:21:20" (1/2) ... [2024-01-29 23:21:20,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac6990d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:20, skipping insertion in model container [2024-01-29 23:21:20,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:21:20" (1/2) ... [2024-01-29 23:21:20,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5803ffbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:20, skipping insertion in model container [2024-01-29 23:21:20,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:20" (2/2) ... [2024-01-29 23:21:20,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac6990d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:20, skipping insertion in model container [2024-01-29 23:21:20,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:20" (2/2) ... [2024-01-29 23:21:20,610 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 23:21:20,655 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 23:21:20,657 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (glob1 == 0) && (t == 42) [2024-01-29 23:21:20,657 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] ((glob1 == 0) && (t == 42)) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:20,657 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] glob1 == 0 [2024-01-29 23:21:20,657 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] 0 <= glob1 [2024-01-29 23:21:20,657 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (0 <= glob1) && (glob1 <= 1) [2024-01-29 23:21:20,658 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (0 <= glob1) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:20,658 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (0 <= glob1) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:20,658 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (unsigned long )arg == 0UL [2024-01-29 23:21:20,659 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] (((0 <= t) && (t <= 1)) && (glob1 == 0)) && (t == 0 || t == 1) [2024-01-29 23:21:20,659 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] ((0 <= t) && (t <= 1)) && (glob1 == 0) [2024-01-29 23:21:20,659 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] (0 <= t) && (t <= 1) [2024-01-29 23:21:20,659 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] 0 <= t [2024-01-29 23:21:20,659 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] (((0 <= t) && (t <= 1)) && (glob1 == 0)) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:20,659 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] (((0 <= glob1) && (0 <= t)) && (glob1 <= 1)) && (t <= 1) [2024-01-29 23:21:20,659 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] ((((0 <= glob1) && (0 <= t)) && (glob1 <= 1)) && (t <= 1)) && (t == 0 || t == 1) [2024-01-29 23:21:20,659 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] ((0 <= glob1) && (0 <= t)) && (glob1 <= 1) [2024-01-29 23:21:20,660 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] (0 <= glob1) && (0 <= t) [2024-01-29 23:21:20,660 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] ((((0 <= glob1) && (0 <= t)) && (glob1 <= 1)) && (t <= 1)) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:20,660 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] 0 <= glob1 [2024-01-29 23:21:20,660 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] ((((0 <= glob1) && (0 <= t)) && (glob1 <= 1)) && (t <= 1)) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:20,660 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] (0 <= glob1) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:20,660 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] 0 <= glob1 [2024-01-29 23:21:20,661 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((0 <= glob1) && ((unsigned long )arg == 0UL)) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:20,661 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] (0 <= glob1) && (glob1 <= 1) [2024-01-29 23:21:20,661 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] (0 <= glob1) && (t <= 1) [2024-01-29 23:21:20,661 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((0 <= glob1) && ((unsigned long )arg == 0UL)) && (t == 0 || t == 1) [2024-01-29 23:21:20,661 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] (0 <= glob1) && (0 <= t) [2024-01-29 23:21:20,661 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((0 <= glob1) && (0 <= glob1)) && (glob1 <= 1)) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:20,661 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (0 <= glob1)) && (glob1 <= 1) [2024-01-29 23:21:20,662 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= glob1) && (0 <= glob1) [2024-01-29 23:21:20,662 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= glob1 [2024-01-29 23:21:20,662 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((((0 <= glob1) && (0 <= glob1)) && (glob1 <= 1)) && (glob1 == 0 || glob1 == 1)) && (0 <= glob1) [2024-01-29 23:21:20,662 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((((0 <= glob1) && (0 <= glob1)) && (glob1 <= 1)) && (glob1 == 0 || glob1 == 1)) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:20,662 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= glob1) && (glob1 <= 1) [2024-01-29 23:21:20,662 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((((0 <= glob1) && (0 <= glob1)) && (glob1 <= 1)) && (glob1 == 0 || glob1 == 1)) && (glob1 <= 1) [2024-01-29 23:21:20,662 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= glob1) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:20,663 INFO L98 nessWitnessExtractor]: Location invariant before [L685-L685] (unsigned long )arg == 0UL [2024-01-29 23:21:20,663 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L689] (glob1 == 0) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:20,664 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L689] glob1 == 0 [2024-01-29 23:21:20,664 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] glob1 == 0 [2024-01-29 23:21:20,664 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] ((0 <= t) && (t <= 1)) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:20,664 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] (((0 <= t) && (t <= 1)) && ((unsigned long )arg == 0UL)) && (t == 0 || t == 1) [2024-01-29 23:21:20,664 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] (0 <= t) && (t <= 1) [2024-01-29 23:21:20,665 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] 0 <= t [2024-01-29 23:21:20,665 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] glob1 == 0 [2024-01-29 23:21:20,700 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 23:21:20,830 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_1_pos.i[1097,1110] [2024-01-29 23:21:20,952 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:21:20,961 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 23:21:20,972 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_1_pos.i[1097,1110] [2024-01-29 23:21:20,972 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: {reach_error();abort();} } } with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 23:21:21,082 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:21:21,112 INFO L206 MainTranslator]: Completed translation [2024-01-29 23:21:21,114 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21 WrapperNode [2024-01-29 23:21:21,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 23:21:21,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 23:21:21,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 23:21:21,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 23:21:21,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,176 INFO L138 Inliner]: procedures = 164, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2024-01-29 23:21:21,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 23:21:21,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 23:21:21,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 23:21:21,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 23:21:21,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,218 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 5, 2]. 56 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 1 writes are split as follows [0, 0, 1]. [2024-01-29 23:21:21,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 23:21:21,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 23:21:21,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 23:21:21,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 23:21:21,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:21:21,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 23:21:21,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 23:21:21,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 23:21:21,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 23:21:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 23:21:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 23:21:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 23:21:21,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 23:21:21,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 23:21:21,318 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-29 23:21:21,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 23:21:21,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 23:21:21,318 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-29 23:21:21,318 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-29 23:21:21,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 23:21:21,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 23:21:21,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 23:21:21,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 23:21:21,319 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-29 23:21:21,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 23:21:21,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 23:21:21,320 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 23:21:21,407 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 23:21:21,409 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 23:21:21,601 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 23:21:21,601 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 23:21:21,657 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 23:21:21,658 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 23:21:21,658 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:21:21 BoogieIcfgContainer [2024-01-29 23:21:21,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 23:21:21,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 23:21:21,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 23:21:21,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 23:21:21,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:21:20" (1/4) ... [2024-01-29 23:21:21,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18254121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:21:21, skipping insertion in model container [2024-01-29 23:21:21,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:20" (2/4) ... [2024-01-29 23:21:21,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18254121 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 11:21:21, skipping insertion in model container [2024-01-29 23:21:21,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21" (3/4) ... [2024-01-29 23:21:21,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18254121 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 11:21:21, skipping insertion in model container [2024-01-29 23:21:21,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:21:21" (4/4) ... [2024-01-29 23:21:21,667 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_18-first-reads_unknown_1_pos.i [2024-01-29 23:21:21,681 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 23:21:21,683 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-01-29 23:21:21,683 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 23:21:21,782 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-29 23:21:21,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 94 transitions, 195 flow [2024-01-29 23:21:21,867 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2024-01-29 23:21:21,870 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 23:21:21,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 93 events. 2/93 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2024-01-29 23:21:21,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 94 transitions, 195 flow [2024-01-29 23:21:21,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 91 transitions, 185 flow [2024-01-29 23:21:21,884 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 23:21:21,889 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;@1c0f53b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 23:21:21,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2024-01-29 23:21:21,893 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 23:21:21,894 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 23:21:21,894 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:21:21,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:21,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 23:21:21,895 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:21,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:21,900 INFO L85 PathProgramCache]: Analyzing trace with hash 8684, now seen corresponding path program 1 times [2024-01-29 23:21:21,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:21,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033982745] [2024-01-29 23:21:21,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:21,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:22,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:22,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033982745] [2024-01-29 23:21:22,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033982745] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:22,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:22,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 23:21:22,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845796309] [2024-01-29 23:21:22,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:22,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:21:22,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:22,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:21:22,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:21:22,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 94 [2024-01-29 23:21:22,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:22,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:22,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 94 [2024-01-29 23:21:22,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:22,455 INFO L124 PetriNetUnfolderBase]: 134/825 cut-off events. [2024-01-29 23:21:22,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:21:22,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 825 events. 134/825 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5425 event pairs, 84 based on Foata normal form. 43/669 useless extension candidates. Maximal degree in co-relation 1145. Up to 207 conditions per place. [2024-01-29 23:21:22,467 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 36 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2024-01-29 23:21:22,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 96 transitions, 275 flow [2024-01-29 23:21:22,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:21:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:21:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2024-01-29 23:21:22,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7907801418439716 [2024-01-29 23:21:22,485 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 185 flow. Second operand 3 states and 223 transitions. [2024-01-29 23:21:22,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 96 transitions, 275 flow [2024-01-29 23:21:22,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:21:22,493 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 214 flow [2024-01-29 23:21:22,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2024-01-29 23:21:22,499 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 0 predicate places. [2024-01-29 23:21:22,500 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 214 flow [2024-01-29 23:21:22,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:22,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:22,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 23:21:22,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 23:21:22,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:22,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:22,511 INFO L85 PathProgramCache]: Analyzing trace with hash 259105612, now seen corresponding path program 1 times [2024-01-29 23:21:22,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:22,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574224665] [2024-01-29 23:21:22,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:22,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:22,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:22,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574224665] [2024-01-29 23:21:22,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574224665] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:22,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:22,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018339016] [2024-01-29 23:21:22,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:22,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:22,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:22,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:22,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:22,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 94 [2024-01-29 23:21:22,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:22,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:22,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 94 [2024-01-29 23:21:22,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:22,856 INFO L124 PetriNetUnfolderBase]: 70/707 cut-off events. [2024-01-29 23:21:22,856 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-01-29 23:21:22,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 707 events. 70/707 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4746 event pairs, 7 based on Foata normal form. 5/519 useless extension candidates. Maximal degree in co-relation 954. Up to 148 conditions per place. [2024-01-29 23:21:22,860 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 20 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-01-29 23:21:22,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 91 transitions, 262 flow [2024-01-29 23:21:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 311 transitions. [2024-01-29 23:21:22,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8271276595744681 [2024-01-29 23:21:22,866 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 214 flow. Second operand 4 states and 311 transitions. [2024-01-29 23:21:22,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 91 transitions, 262 flow [2024-01-29 23:21:22,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:22,870 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 206 flow [2024-01-29 23:21:22,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-01-29 23:21:22,870 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -1 predicate places. [2024-01-29 23:21:22,871 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 206 flow [2024-01-29 23:21:22,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:22,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:22,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:22,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 23:21:22,871 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:22,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:22,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1450981472, now seen corresponding path program 1 times [2024-01-29 23:21:22,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:22,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050486969] [2024-01-29 23:21:22,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:22,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:22,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:22,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050486969] [2024-01-29 23:21:22,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050486969] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:22,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:22,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:21:22,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204305701] [2024-01-29 23:21:22,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:22,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:22,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:22,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:22,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:23,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2024-01-29 23:21:23,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:23,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:23,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2024-01-29 23:21:23,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:23,175 INFO L124 PetriNetUnfolderBase]: 238/971 cut-off events. [2024-01-29 23:21:23,175 INFO L125 PetriNetUnfolderBase]: For 78/90 co-relation queries the response was YES. [2024-01-29 23:21:23,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 971 events. 238/971 cut-off events. For 78/90 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6070 event pairs, 26 based on Foata normal form. 3/803 useless extension candidates. Maximal degree in co-relation 1654. Up to 258 conditions per place. [2024-01-29 23:21:23,179 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 60 selfloop transitions, 11 changer transitions 0/114 dead transitions. [2024-01-29 23:21:23,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 114 transitions, 406 flow [2024-01-29 23:21:23,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2024-01-29 23:21:23,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6675531914893617 [2024-01-29 23:21:23,181 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 206 flow. Second operand 4 states and 251 transitions. [2024-01-29 23:21:23,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 114 transitions, 406 flow [2024-01-29 23:21:23,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 114 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:23,183 INFO L231 Difference]: Finished difference. Result has 94 places, 92 transitions, 271 flow [2024-01-29 23:21:23,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=94, PETRI_TRANSITIONS=92} [2024-01-29 23:21:23,183 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places. [2024-01-29 23:21:23,183 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 271 flow [2024-01-29 23:21:23,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:23,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:23,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:23,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 23:21:23,184 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:23,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:23,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1637831660, now seen corresponding path program 1 times [2024-01-29 23:21:23,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:23,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129741576] [2024-01-29 23:21:23,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:23,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:23,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:23,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129741576] [2024-01-29 23:21:23,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129741576] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:23,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:23,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849280720] [2024-01-29 23:21:23,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:23,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:21:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:23,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:21:23,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:21:23,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 94 [2024-01-29 23:21:23,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 92 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:23,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:23,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 94 [2024-01-29 23:21:23,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:23,636 INFO L124 PetriNetUnfolderBase]: 346/1102 cut-off events. [2024-01-29 23:21:23,636 INFO L125 PetriNetUnfolderBase]: For 333/337 co-relation queries the response was YES. [2024-01-29 23:21:23,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 1102 events. 346/1102 cut-off events. For 333/337 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6535 event pairs, 32 based on Foata normal form. 7/1088 useless extension candidates. Maximal degree in co-relation 2252. Up to 361 conditions per place. [2024-01-29 23:21:23,641 INFO L140 encePairwiseOnDemand]: 80/94 looper letters, 88 selfloop transitions, 12 changer transitions 0/129 dead transitions. [2024-01-29 23:21:23,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 129 transitions, 567 flow [2024-01-29 23:21:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:21:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:21:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 252 transitions. [2024-01-29 23:21:23,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5361702127659574 [2024-01-29 23:21:23,646 INFO L175 Difference]: Start difference. First operand has 94 places, 92 transitions, 271 flow. Second operand 5 states and 252 transitions. [2024-01-29 23:21:23,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 129 transitions, 567 flow [2024-01-29 23:21:23,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 129 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:23,652 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 279 flow [2024-01-29 23:21:23,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2024-01-29 23:21:23,652 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places. [2024-01-29 23:21:23,652 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 279 flow [2024-01-29 23:21:23,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:23,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:23,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:23,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 23:21:23,653 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:23,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:23,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1998183826, now seen corresponding path program 1 times [2024-01-29 23:21:23,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:23,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021122438] [2024-01-29 23:21:23,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:23,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:23,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:23,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021122438] [2024-01-29 23:21:23,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021122438] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:23,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:23,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:23,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17844645] [2024-01-29 23:21:23,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:23,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:23,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:23,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:23,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:23,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 94 [2024-01-29 23:21:23,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:23,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:23,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 94 [2024-01-29 23:21:23,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:23,880 INFO L124 PetriNetUnfolderBase]: 153/755 cut-off events. [2024-01-29 23:21:23,881 INFO L125 PetriNetUnfolderBase]: For 232/239 co-relation queries the response was YES. [2024-01-29 23:21:23,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 755 events. 153/755 cut-off events. For 232/239 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4392 event pairs, 5 based on Foata normal form. 63/705 useless extension candidates. Maximal degree in co-relation 1277. Up to 255 conditions per place. [2024-01-29 23:21:23,883 INFO L140 encePairwiseOnDemand]: 81/94 looper letters, 46 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2024-01-29 23:21:23,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 91 transitions, 342 flow [2024-01-29 23:21:23,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2024-01-29 23:21:23,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.675531914893617 [2024-01-29 23:21:23,884 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 279 flow. Second operand 4 states and 254 transitions. [2024-01-29 23:21:23,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 91 transitions, 342 flow [2024-01-29 23:21:23,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 91 transitions, 307 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-01-29 23:21:23,886 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 181 flow [2024-01-29 23:21:23,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2024-01-29 23:21:23,887 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -10 predicate places. [2024-01-29 23:21:23,887 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 181 flow [2024-01-29 23:21:23,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:23,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:23,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:23,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 23:21:23,888 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:23,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1783618102, now seen corresponding path program 1 times [2024-01-29 23:21:23,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:23,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068482880] [2024-01-29 23:21:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:23,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:23,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:23,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068482880] [2024-01-29 23:21:23,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068482880] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:23,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:23,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:21:23,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586886304] [2024-01-29 23:21:23,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:23,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:23,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:23,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:23,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:24,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 94 [2024-01-29 23:21:24,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:24,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 94 [2024-01-29 23:21:24,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:24,099 INFO L124 PetriNetUnfolderBase]: 194/829 cut-off events. [2024-01-29 23:21:24,099 INFO L125 PetriNetUnfolderBase]: For 109/111 co-relation queries the response was YES. [2024-01-29 23:21:24,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 829 events. 194/829 cut-off events. For 109/111 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4805 event pairs, 105 based on Foata normal form. 66/822 useless extension candidates. Maximal degree in co-relation 1387. Up to 229 conditions per place. [2024-01-29 23:21:24,102 INFO L140 encePairwiseOnDemand]: 77/94 looper letters, 52 selfloop transitions, 4 changer transitions 1/91 dead transitions. [2024-01-29 23:21:24,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 91 transitions, 329 flow [2024-01-29 23:21:24,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:24,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 242 transitions. [2024-01-29 23:21:24,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6436170212765957 [2024-01-29 23:21:24,104 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 181 flow. Second operand 4 states and 242 transitions. [2024-01-29 23:21:24,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 91 transitions, 329 flow [2024-01-29 23:21:24,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 91 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:24,105 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 220 flow [2024-01-29 23:21:24,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2024-01-29 23:21:24,106 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -7 predicate places. [2024-01-29 23:21:24,106 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 220 flow [2024-01-29 23:21:24,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:24,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:24,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 23:21:24,107 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:24,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash 542414041, now seen corresponding path program 1 times [2024-01-29 23:21:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:24,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986176938] [2024-01-29 23:21:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:24,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:24,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986176938] [2024-01-29 23:21:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986176938] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:24,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:24,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831615888] [2024-01-29 23:21:24,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:24,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:21:24,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:21:24,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:21:24,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 94 [2024-01-29 23:21:24,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:24,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 94 [2024-01-29 23:21:24,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:24,444 INFO L124 PetriNetUnfolderBase]: 279/904 cut-off events. [2024-01-29 23:21:24,445 INFO L125 PetriNetUnfolderBase]: For 259/261 co-relation queries the response was YES. [2024-01-29 23:21:24,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1815 conditions, 904 events. 279/904 cut-off events. For 259/261 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4792 event pairs, 31 based on Foata normal form. 6/864 useless extension candidates. Maximal degree in co-relation 1797. Up to 267 conditions per place. [2024-01-29 23:21:24,447 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 64 selfloop transitions, 6 changer transitions 9/101 dead transitions. [2024-01-29 23:21:24,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 101 transitions, 432 flow [2024-01-29 23:21:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:21:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:21:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2024-01-29 23:21:24,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44468085106382976 [2024-01-29 23:21:24,449 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 220 flow. Second operand 5 states and 209 transitions. [2024-01-29 23:21:24,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 101 transitions, 432 flow [2024-01-29 23:21:24,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 101 transitions, 429 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:21:24,451 INFO L231 Difference]: Finished difference. Result has 90 places, 74 transitions, 232 flow [2024-01-29 23:21:24,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=90, PETRI_TRANSITIONS=74} [2024-01-29 23:21:24,452 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -3 predicate places. [2024-01-29 23:21:24,452 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 74 transitions, 232 flow [2024-01-29 23:21:24,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:24,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:24,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 23:21:24,453 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:24,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:24,453 INFO L85 PathProgramCache]: Analyzing trace with hash 781913263, now seen corresponding path program 1 times [2024-01-29 23:21:24,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:24,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794693545] [2024-01-29 23:21:24,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:24,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:24,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:24,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794693545] [2024-01-29 23:21:24,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794693545] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:24,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:24,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:24,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302321207] [2024-01-29 23:21:24,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:24,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:21:24,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:24,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:21:24,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:21:24,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 94 [2024-01-29 23:21:24,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 74 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:24,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 94 [2024-01-29 23:21:24,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:24,524 INFO L124 PetriNetUnfolderBase]: 29/351 cut-off events. [2024-01-29 23:21:24,524 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2024-01-29 23:21:24,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 351 events. 29/351 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1695 event pairs, 7 based on Foata normal form. 10/347 useless extension candidates. Maximal degree in co-relation 562. Up to 60 conditions per place. [2024-01-29 23:21:24,525 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 15 selfloop transitions, 4 changer transitions 2/77 dead transitions. [2024-01-29 23:21:24,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 77 transitions, 282 flow [2024-01-29 23:21:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:21:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:21:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2024-01-29 23:21:24,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2024-01-29 23:21:24,527 INFO L175 Difference]: Start difference. First operand has 90 places, 74 transitions, 232 flow. Second operand 3 states and 247 transitions. [2024-01-29 23:21:24,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 77 transitions, 282 flow [2024-01-29 23:21:24,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 77 transitions, 234 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-01-29 23:21:24,529 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 189 flow [2024-01-29 23:21:24,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2024-01-29 23:21:24,529 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -9 predicate places. [2024-01-29 23:21:24,530 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 189 flow [2024-01-29 23:21:24,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:24,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:24,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 23:21:24,530 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:24,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:24,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1951049356, now seen corresponding path program 1 times [2024-01-29 23:21:24,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:24,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128205340] [2024-01-29 23:21:24,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:24,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:24,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:24,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128205340] [2024-01-29 23:21:24,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128205340] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:24,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:24,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:24,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271081396] [2024-01-29 23:21:24,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:24,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:24,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:24,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:24,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:24,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 94 [2024-01-29 23:21:24,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:24,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 94 [2024-01-29 23:21:24,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:24,731 INFO L124 PetriNetUnfolderBase]: 56/361 cut-off events. [2024-01-29 23:21:24,731 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-01-29 23:21:24,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 361 events. 56/361 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1604 event pairs, 48 based on Foata normal form. 28/375 useless extension candidates. Maximal degree in co-relation 580. Up to 141 conditions per place. [2024-01-29 23:21:24,732 INFO L140 encePairwiseOnDemand]: 84/94 looper letters, 31 selfloop transitions, 3 changer transitions 1/71 dead transitions. [2024-01-29 23:21:24,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 71 transitions, 243 flow [2024-01-29 23:21:24,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2024-01-29 23:21:24,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6329787234042553 [2024-01-29 23:21:24,733 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 189 flow. Second operand 4 states and 238 transitions. [2024-01-29 23:21:24,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 71 transitions, 243 flow [2024-01-29 23:21:24,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:24,735 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 162 flow [2024-01-29 23:21:24,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2024-01-29 23:21:24,736 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -16 predicate places. [2024-01-29 23:21:24,736 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 162 flow [2024-01-29 23:21:24,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:24,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:24,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 23:21:24,736 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:24,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:24,737 INFO L85 PathProgramCache]: Analyzing trace with hash -352987537, now seen corresponding path program 1 times [2024-01-29 23:21:24,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:24,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626340066] [2024-01-29 23:21:24,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:24,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:24,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:24,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626340066] [2024-01-29 23:21:24,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626340066] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:24,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:24,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:21:24,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421364807] [2024-01-29 23:21:24,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:24,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:21:24,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:24,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:21:24,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:21:24,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 94 [2024-01-29 23:21:24,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:24,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 94 [2024-01-29 23:21:24,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:24,980 INFO L124 PetriNetUnfolderBase]: 97/426 cut-off events. [2024-01-29 23:21:24,980 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-01-29 23:21:24,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 426 events. 97/426 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1755 event pairs, 15 based on Foata normal form. 8/416 useless extension candidates. Maximal degree in co-relation 753. Up to 200 conditions per place. [2024-01-29 23:21:24,981 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 47 selfloop transitions, 4 changer transitions 2/78 dead transitions. [2024-01-29 23:21:24,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 78 transitions, 292 flow [2024-01-29 23:21:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:21:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:21:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2024-01-29 23:21:24,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2024-01-29 23:21:24,983 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 162 flow. Second operand 5 states and 220 transitions. [2024-01-29 23:21:24,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 78 transitions, 292 flow [2024-01-29 23:21:24,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 281 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-29 23:21:24,984 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 151 flow [2024-01-29 23:21:24,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2024-01-29 23:21:24,985 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -18 predicate places. [2024-01-29 23:21:24,985 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 151 flow [2024-01-29 23:21:24,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:24,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:24,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 23:21:24,986 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:24,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:24,986 INFO L85 PathProgramCache]: Analyzing trace with hash 322047283, now seen corresponding path program 1 times [2024-01-29 23:21:24,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:24,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229423075] [2024-01-29 23:21:24,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:24,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:25,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:25,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229423075] [2024-01-29 23:21:25,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229423075] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:25,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:25,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:21:25,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008937177] [2024-01-29 23:21:25,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:25,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:21:25,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:25,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:21:25,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:21:25,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 94 [2024-01-29 23:21:25,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 63 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:25,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:25,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 94 [2024-01-29 23:21:25,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:25,265 INFO L124 PetriNetUnfolderBase]: 62/351 cut-off events. [2024-01-29 23:21:25,265 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2024-01-29 23:21:25,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 351 events. 62/351 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1474 event pairs, 42 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 581. Up to 122 conditions per place. [2024-01-29 23:21:25,266 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 29 selfloop transitions, 5 changer transitions 8/74 dead transitions. [2024-01-29 23:21:25,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 257 flow [2024-01-29 23:21:25,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 23:21:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 23:21:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 343 transitions. [2024-01-29 23:21:25,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6081560283687943 [2024-01-29 23:21:25,268 INFO L175 Difference]: Start difference. First operand has 75 places, 63 transitions, 151 flow. Second operand 6 states and 343 transitions. [2024-01-29 23:21:25,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 257 flow [2024-01-29 23:21:25,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 74 transitions, 249 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 23:21:25,269 INFO L231 Difference]: Finished difference. Result has 78 places, 62 transitions, 152 flow [2024-01-29 23:21:25,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=78, PETRI_TRANSITIONS=62} [2024-01-29 23:21:25,269 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -15 predicate places. [2024-01-29 23:21:25,270 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 62 transitions, 152 flow [2024-01-29 23:21:25,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:25,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:25,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:25,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 23:21:25,270 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:25,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:25,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1271264989, now seen corresponding path program 1 times [2024-01-29 23:21:25,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:25,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214328325] [2024-01-29 23:21:25,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:25,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:21:25,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 23:21:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:21:25,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 23:21:25,297 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 23:21:25,298 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr18ASSERT_VIOLATIONERROR_FUNCTION (72 of 73 remaining) [2024-01-29 23:21:25,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 73 remaining) [2024-01-29 23:21:25,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 73 remaining) [2024-01-29 23:21:25,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (69 of 73 remaining) [2024-01-29 23:21:25,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 73 remaining) [2024-01-29 23:21:25,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 73 remaining) [2024-01-29 23:21:25,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 73 remaining) [2024-01-29 23:21:25,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 73 remaining) [2024-01-29 23:21:25,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 73 remaining) [2024-01-29 23:21:25,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 73 remaining) [2024-01-29 23:21:25,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 73 remaining) [2024-01-29 23:21:25,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 73 remaining) [2024-01-29 23:21:25,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 73 remaining) [2024-01-29 23:21:25,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 73 remaining) [2024-01-29 23:21:25,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 73 remaining) [2024-01-29 23:21:25,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 73 remaining) [2024-01-29 23:21:25,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 73 remaining) [2024-01-29 23:21:25,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 73 remaining) [2024-01-29 23:21:25,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 73 remaining) [2024-01-29 23:21:25,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 73 remaining) [2024-01-29 23:21:25,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 73 remaining) [2024-01-29 23:21:25,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 73 remaining) [2024-01-29 23:21:25,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18ASSERT_VIOLATIONERROR_FUNCTION (50 of 73 remaining) [2024-01-29 23:21:25,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 73 remaining) [2024-01-29 23:21:25,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 73 remaining) [2024-01-29 23:21:25,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 73 remaining) [2024-01-29 23:21:25,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr22ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 73 remaining) [2024-01-29 23:21:25,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr23ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 73 remaining) [2024-01-29 23:21:25,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr24ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 73 remaining) [2024-01-29 23:21:25,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr25ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 73 remaining) [2024-01-29 23:21:25,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr26ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 73 remaining) [2024-01-29 23:21:25,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr27ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 73 remaining) [2024-01-29 23:21:25,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr28ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 73 remaining) [2024-01-29 23:21:25,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr29ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 73 remaining) [2024-01-29 23:21:25,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr30ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 73 remaining) [2024-01-29 23:21:25,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr31ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 73 remaining) [2024-01-29 23:21:25,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr32ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 73 remaining) [2024-01-29 23:21:25,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr33ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 73 remaining) [2024-01-29 23:21:25,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr34ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 73 remaining) [2024-01-29 23:21:25,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 73 remaining) [2024-01-29 23:21:25,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 73 remaining) [2024-01-29 23:21:25,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 73 remaining) [2024-01-29 23:21:25,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 73 remaining) [2024-01-29 23:21:25,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 73 remaining) [2024-01-29 23:21:25,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 73 remaining) [2024-01-29 23:21:25,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 73 remaining) [2024-01-29 23:21:25,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 73 remaining) [2024-01-29 23:21:25,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 73 remaining) [2024-01-29 23:21:25,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 73 remaining) [2024-01-29 23:21:25,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 73 remaining) [2024-01-29 23:21:25,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 73 remaining) [2024-01-29 23:21:25,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 73 remaining) [2024-01-29 23:21:25,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 73 remaining) [2024-01-29 23:21:25,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 73 remaining) [2024-01-29 23:21:25,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 73 remaining) [2024-01-29 23:21:25,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 73 remaining) [2024-01-29 23:21:25,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 73 remaining) [2024-01-29 23:21:25,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 73 remaining) [2024-01-29 23:21:25,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 73 remaining) [2024-01-29 23:21:25,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 73 remaining) [2024-01-29 23:21:25,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr22ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 73 remaining) [2024-01-29 23:21:25,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr23ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 73 remaining) [2024-01-29 23:21:25,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr24ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 73 remaining) [2024-01-29 23:21:25,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr25ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 73 remaining) [2024-01-29 23:21:25,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr26ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 73 remaining) [2024-01-29 23:21:25,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr27ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 73 remaining) [2024-01-29 23:21:25,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr28ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 73 remaining) [2024-01-29 23:21:25,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr29ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 73 remaining) [2024-01-29 23:21:25,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr30ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 73 remaining) [2024-01-29 23:21:25,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr31ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 73 remaining) [2024-01-29 23:21:25,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr32ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 73 remaining) [2024-01-29 23:21:25,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr33ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 73 remaining) [2024-01-29 23:21:25,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr34ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 73 remaining) [2024-01-29 23:21:25,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 23:21:25,310 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:25,314 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 23:21:25,315 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 23:21:25,334 INFO L503 ceAbstractionStarter]: Automizer considered 36 witness invariants [2024-01-29 23:21:25,334 INFO L504 ceAbstractionStarter]: WitnessConsidered=36 [2024-01-29 23:21:25,334 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:21:25 BasicIcfg [2024-01-29 23:21:25,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 23:21:25,335 INFO L158 Benchmark]: Toolchain (without parser) took 4737.51ms. Allocated memory was 153.1MB in the beginning and 234.9MB in the end (delta: 81.8MB). Free memory was 78.7MB in the beginning and 144.8MB in the end (delta: -66.0MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-01-29 23:21:25,335 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:21:25,335 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 153.1MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:21:25,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.38ms. Allocated memory is still 153.1MB. Free memory was 78.3MB in the beginning and 117.4MB in the end (delta: -39.1MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-01-29 23:21:25,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.09ms. Allocated memory is still 153.1MB. Free memory was 117.4MB in the beginning and 115.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 23:21:25,336 INFO L158 Benchmark]: Boogie Preprocessor took 70.59ms. Allocated memory is still 153.1MB. Free memory was 115.3MB in the beginning and 112.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 23:21:25,336 INFO L158 Benchmark]: RCFGBuilder took 409.41ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 85.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-01-29 23:21:25,337 INFO L158 Benchmark]: TraceAbstraction took 3672.94ms. Allocated memory was 153.1MB in the beginning and 234.9MB in the end (delta: 81.8MB). Free memory was 84.6MB in the beginning and 144.8MB in the end (delta: -60.2MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-01-29 23:21:25,338 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.13ms. Allocated memory is still 113.2MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.17ms. Allocated memory is still 153.1MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.38ms. Allocated memory is still 153.1MB. Free memory was 78.3MB in the beginning and 117.4MB in the end (delta: -39.1MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.09ms. Allocated memory is still 153.1MB. Free memory was 117.4MB in the beginning and 115.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.59ms. Allocated memory is still 153.1MB. Free memory was 115.3MB in the beginning and 112.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.41ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 85.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3672.94ms. Allocated memory was 153.1MB in the beginning and 234.9MB in the end (delta: 81.8MB). Free memory was 84.6MB in the beginning and 144.8MB in the end (delta: -60.2MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int glob1 = 0; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L697] 0 pthread_t id; VAL [glob1=0, id={5:0}, mutex1={3:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] [L698] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [glob1=0, id={5:0}, mutex1={3:0}] [L685] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L685] 1 int t = __VERIFIER_nondet_int(); [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L687] COND TRUE 1 t == 42 VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[42]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[42]]]]] [L688] 1 glob1 = 1 VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]]]] [L690] 1 t = glob1 VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[t],IntegerLiteral[1]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L691] CALL 1 __VERIFIER_assert(t == 0) [L19] COND TRUE 1 !(cond) VAL [\old(cond)=0, cond=0, glob1=1, mutex1={3:0}] [L19] 1 reach_error() VAL [\old(cond)=0, cond=0, glob1=1, mutex1={3:0}] - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: 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: 685]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 173 locations, 73 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: 3.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2075 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1257 mSDsluCounter, 412 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 278 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2139 IncrementalHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 134 mSDtfsCounter, 2139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=4, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 949 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 23:21:25,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE