./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.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/36-apron_17-traces-rpb-litmus_unknown_1_neg.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3d25acf6 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/36-apron_17-traces-rpb-litmus_unknown_1_neg.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/36-apron_17-traces-rpb-litmus_unknown_1_neg.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-3d25acf-m [2024-01-30 14:40:56,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:40:56,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:40:56,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:40:56,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:40:56,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:40:56,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:40:56,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:40:56,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:40:56,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:40:56,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:40:56,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:40:56,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:40:56,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:40:56,693 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:40:56,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:40:56,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:40:56,694 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:40:56,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:40:56,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:40:56,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:40:56,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:40:56,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:40:56,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:40:56,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:40:56,696 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:40:56,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:40:56,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:40:56,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:40:56,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:40:56,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:40:56,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:40:56,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:40:56,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:40:56,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:40:56,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:40:56,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:40:56,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:40:56,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:40:56,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:40:56,700 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:40:56,701 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:40:56,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:40:56,701 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-30 14:40:56,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:40:56,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:40:56,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:40:56,957 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:40:56,958 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:40:56,959 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/36-apron_17-traces-rpb-litmus_unknown_1_neg.yml/witness.yml [2024-01-30 14:40:57,134 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:40:57,134 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:40:57,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2024-01-30 14:40:58,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:40:58,499 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:40:58,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2024-01-30 14:40:58,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c85dec73/476cde2642154c9cabb2cc57202abde9/FLAGb47853f4f [2024-01-30 14:40:58,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c85dec73/476cde2642154c9cabb2cc57202abde9 [2024-01-30 14:40:58,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:40:58,538 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:40:58,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:40:58,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:40:58,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:40:58,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:40:57" (1/2) ... [2024-01-30 14:40:58,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57936024 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:40:58, skipping insertion in model container [2024-01-30 14:40:58,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:40:57" (1/2) ... [2024-01-30 14:40:58,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@189bd85a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:40:58, skipping insertion in model container [2024-01-30 14:40:58,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:40:58" (2/2) ... [2024-01-30 14:40:58,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57936024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:58, skipping insertion in model container [2024-01-30 14:40:58,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:40:58" (2/2) ... [2024-01-30 14:40:58,553 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:40:58,683 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:40:58,685 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((((((((((((((((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (g != 0)) && (g == 17 || g == 42)) && (0 <= g)) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (g != 0)) && (g == 17 || g == 42)) && (0 <= g)) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (g != 0)) && (g == 17 || g == 42) [2024-01-30 14:40:58,685 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] ((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (g != 0)) && (g == 17 || g == 42) [2024-01-30 14:40:58,685 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] (((((((((((((0 <= g) && (0 <= t)) && (17 <= g)) && (17 <= t)) && (g <= 42)) && (g <= 127)) && (t <= 42)) && (t <= 127)) && (g % 25 == 17)) && (t % 25 == 17)) && (g != 0)) && (t != 0)) && (g == 17 || g == 42)) && (t == 17 || t == 42) [2024-01-30 14:40:58,685 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (unsigned long )arg == 0UL [2024-01-30 14:40:58,686 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L22] g == 42 [2024-01-30 14:40:58,686 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && ((unsigned long )arg == 0UL)) && (g != 0)) && (g == 17 || g == 42) [2024-01-30 14:40:58,687 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] ((((((0 <= t) && (17 <= t)) && (t <= 42)) && (t <= 127)) && (t % 25 == 17)) && (t != 0)) && (t == 17 || t == 42) [2024-01-30 14:40:58,687 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] ((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (g != 0)) && (g == 17 || g == 42) [2024-01-30 14:40:58,687 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] (g == 17) && (r != 0) [2024-01-30 14:40:58,687 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] ((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (g != 0)) && (g == 17 || g == 42) [2024-01-30 14:40:58,687 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] (((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (g != 0)) && (r != 0)) && (g == 17 || g == 42) [2024-01-30 14:40:58,687 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && ((unsigned long )arg == 0UL)) && (g != 0)) && (g == 17 || g == 42) [2024-01-30 14:40:58,688 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] (unsigned long )arg == 0UL [2024-01-30 14:40:58,688 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] (g == 42) && ((unsigned long )arg == 0UL) [2024-01-30 14:40:58,688 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] (((((((((((((0 <= g) && (0 <= t)) && (17 <= g)) && (17 <= t)) && (g <= 42)) && (g <= 127)) && (t <= 42)) && (t <= 127)) && (g % 25 == 17)) && (t % 25 == 17)) && (g != 0)) && (t != 0)) && (g == 17 || g == 42)) && (t == 17 || t == 42) [2024-01-30 14:40:58,688 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] g == 42 [2024-01-30 14:40:58,688 INFO L98 nessWitnessExtractor]: Location invariant before [L703-L703] (g == 17) && (r != 0) [2024-01-30 14:40:58,688 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] (((((((((((((0 <= g) && (0 <= t)) && (17 <= g)) && (17 <= t)) && (g <= 42)) && (g <= 127)) && (t <= 42)) && (t <= 127)) && (g % 25 == 17)) && (t % 25 == 17)) && (g != 0)) && (t != 0)) && (g == 17 || g == 42)) && (t == 17 || t == 42) [2024-01-30 14:40:58,689 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (g == 42) && ((unsigned long )arg == 0UL) [2024-01-30 14:40:58,689 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] g == 42 [2024-01-30 14:40:58,736 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:40:58,922 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/36-apron_17-traces-rpb-litmus_unknown_1_neg.i[1098,1111] [2024-01-30 14:40:59,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:40:59,132 INFO L202 MainTranslator]: Completed pre-run [2024-01-30 14:40:59,146 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/36-apron_17-traces-rpb-litmus_unknown_1_neg.i[1098,1111] [2024-01-30 14:40:59,147 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: {reach_error();abort();} } } with a witness entry [2024-01-30 14:40:59,147 WARN L424 MainDispatcher]: Unable to annotate typedef unsigned short int __u_short; 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 [2024-01-30 14:40:59,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:40:59,362 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:40:59,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:59 WrapperNode [2024-01-30 14:40:59,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:40:59,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:40:59,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:40:59,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:40:59,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:59" (1/1) ... [2024-01-30 14:40:59,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:59" (1/1) ... [2024-01-30 14:40:59,428 INFO L138 Inliner]: procedures = 164, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2024-01-30 14:40:59,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:40:59,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:40:59,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:40:59,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:40:59,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:59" (1/1) ... [2024-01-30 14:40:59,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:59" (1/1) ... [2024-01-30 14:40:59,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:59" (1/1) ... [2024-01-30 14:40:59,455 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 1, 5, 5]. 38 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 5, 5]. The 1 writes are split as follows [0, 1, 0, 0]. [2024-01-30 14:40:59,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:59" (1/1) ... [2024-01-30 14:40:59,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:59" (1/1) ... [2024-01-30 14:40:59,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:59" (1/1) ... [2024-01-30 14:40:59,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:59" (1/1) ... [2024-01-30 14:40:59,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:59" (1/1) ... [2024-01-30 14:40:59,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:59" (1/1) ... [2024-01-30 14:40:59,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:40:59,488 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:40:59,488 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:40:59,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:40:59,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:59" (1/1) ... [2024-01-30 14:40:59,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:40:59,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:40:59,533 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-30 14:40:59,550 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-30 14:40:59,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:40:59,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:40:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:40:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-30 14:40:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-30 14:40:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:40:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:40:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-30 14:40:59,571 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-30 14:40:59,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:40:59,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:40:59,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:40:59,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:40:59,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-30 14:40:59,572 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-30 14:40:59,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:40:59,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:40:59,574 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-30 14:40:59,684 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:40:59,686 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:40:59,975 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:40:59,976 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:41:00,080 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:41:00,084 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-30 14:41:00,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:41:00 BoogieIcfgContainer [2024-01-30 14:41:00,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:41:00,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:41:00,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:41:00,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:41:00,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:40:57" (1/4) ... [2024-01-30 14:41:00,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c61659d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:41:00, skipping insertion in model container [2024-01-30 14:41:00,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:40:58" (2/4) ... [2024-01-30 14:41:00,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c61659d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:41:00, skipping insertion in model container [2024-01-30 14:41:00,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:59" (3/4) ... [2024-01-30 14:41:00,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c61659d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:41:00, skipping insertion in model container [2024-01-30 14:41:00,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:41:00" (4/4) ... [2024-01-30 14:41:00,096 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2024-01-30 14:41:00,113 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:41:00,113 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2024-01-30 14:41:00,113 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:41:00,169 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-30 14:41:00,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 68 transitions, 140 flow [2024-01-30 14:41:00,251 INFO L124 PetriNetUnfolderBase]: 2/67 cut-off events. [2024-01-30 14:41:00,251 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:41:00,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 67 events. 2/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 146 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2024-01-30 14:41:00,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 68 transitions, 140 flow [2024-01-30 14:41:00,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 67 transitions, 137 flow [2024-01-30 14:41:00,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:41:00,280 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;@653e3618, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:41:00,280 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-01-30 14:41:00,282 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:41:00,282 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:41:00,282 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:41:00,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:41:00,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:41:00,283 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 23 more)] === [2024-01-30 14:41:00,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:41:00,287 INFO L85 PathProgramCache]: Analyzing trace with hash 8816, now seen corresponding path program 1 times [2024-01-30 14:41:00,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:41:00,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299947107] [2024-01-30 14:41:00,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:41:00,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:41:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:41:00,476 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-30 14:41:00,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:41:00,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299947107] [2024-01-30 14:41:00,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299947107] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:41:00,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:41:00,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:41:00,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135513137] [2024-01-30 14:41:00,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:41:00,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:41:00,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:41:00,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:41:00,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:41:00,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 68 [2024-01-30 14:41:00,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-30 14:41:00,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:41:00,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 68 [2024-01-30 14:41:00,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:41:00,903 INFO L124 PetriNetUnfolderBase]: 180/723 cut-off events. [2024-01-30 14:41:00,903 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:41:00,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 723 events. 180/723 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4703 event pairs, 72 based on Foata normal form. 48/695 useless extension candidates. Maximal degree in co-relation 1132. Up to 249 conditions per place. [2024-01-30 14:41:00,910 INFO L140 encePairwiseOnDemand]: 55/68 looper letters, 38 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-01-30 14:41:00,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 245 flow [2024-01-30 14:41:00,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:41:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:41:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2024-01-30 14:41:00,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2024-01-30 14:41:00,938 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 137 flow. Second operand 3 states and 160 transitions. [2024-01-30 14:41:00,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 245 flow [2024-01-30 14:41:00,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:41:00,949 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 164 flow [2024-01-30 14:41:00,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-01-30 14:41:00,955 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -1 predicate places. [2024-01-30 14:41:00,955 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 164 flow [2024-01-30 14:41:00,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-30 14:41:00,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:41:00,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-30 14:41:00,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:41:00,957 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 23 more)] === [2024-01-30 14:41:00,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:41:00,959 INFO L85 PathProgramCache]: Analyzing trace with hash -439412636, now seen corresponding path program 1 times [2024-01-30 14:41:00,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:41:00,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11965028] [2024-01-30 14:41:00,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:41:00,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:41:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:41:01,197 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-30 14:41:01,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:41:01,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11965028] [2024-01-30 14:41:01,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11965028] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:41:01,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:41:01,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:41:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318610588] [2024-01-30 14:41:01,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:41:01,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:41:01,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:41:01,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:41:01,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:41:01,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 68 [2024-01-30 14:41:01,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-30 14:41:01,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:41:01,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 68 [2024-01-30 14:41:01,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:41:01,400 INFO L124 PetriNetUnfolderBase]: 157/734 cut-off events. [2024-01-30 14:41:01,400 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-01-30 14:41:01,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 734 events. 157/734 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4838 event pairs, 95 based on Foata normal form. 19/681 useless extension candidates. Maximal degree in co-relation 1185. Up to 321 conditions per place. [2024-01-30 14:41:01,409 INFO L140 encePairwiseOnDemand]: 64/68 looper letters, 34 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2024-01-30 14:41:01,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 75 transitions, 260 flow [2024-01-30 14:41:01,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:41:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:41:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2024-01-30 14:41:01,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7536764705882353 [2024-01-30 14:41:01,416 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 164 flow. Second operand 4 states and 205 transitions. [2024-01-30 14:41:01,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 75 transitions, 260 flow [2024-01-30 14:41:01,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:41:01,420 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 154 flow [2024-01-30 14:41:01,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-01-30 14:41:01,421 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -2 predicate places. [2024-01-30 14:41:01,422 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 154 flow [2024-01-30 14:41:01,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-30 14:41:01,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:41:01,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:41:01,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:41:01,423 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 23 more)] === [2024-01-30 14:41:01,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:41:01,426 INFO L85 PathProgramCache]: Analyzing trace with hash 518790968, now seen corresponding path program 1 times [2024-01-30 14:41:01,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:41:01,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287743366] [2024-01-30 14:41:01,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:41:01,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:41:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:41:01,679 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-30 14:41:01,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:41:01,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287743366] [2024-01-30 14:41:01,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287743366] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:41:01,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:41:01,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:41:01,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101840376] [2024-01-30 14:41:01,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:41:01,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:41:01,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:41:01,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:41:01,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:41:01,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 68 [2024-01-30 14:41:01,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-30 14:41:01,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:41:01,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 68 [2024-01-30 14:41:01,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:41:01,914 INFO L124 PetriNetUnfolderBase]: 287/928 cut-off events. [2024-01-30 14:41:01,914 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-01-30 14:41:01,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 928 events. 287/928 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6012 event pairs, 53 based on Foata normal form. 42/901 useless extension candidates. Maximal degree in co-relation 1718. Up to 333 conditions per place. [2024-01-30 14:41:01,920 INFO L140 encePairwiseOnDemand]: 58/68 looper letters, 54 selfloop transitions, 7 changer transitions 2/89 dead transitions. [2024-01-30 14:41:01,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 336 flow [2024-01-30 14:41:01,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:41:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:41:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2024-01-30 14:41:01,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6433823529411765 [2024-01-30 14:41:01,923 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 154 flow. Second operand 4 states and 175 transitions. [2024-01-30 14:41:01,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 336 flow [2024-01-30 14:41:01,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:41:01,928 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 189 flow [2024-01-30 14:41:01,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2024-01-30 14:41:01,929 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 1 predicate places. [2024-01-30 14:41:01,929 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 189 flow [2024-01-30 14:41:01,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-30 14:41:01,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:41:01,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:41:01,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:41:01,936 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 23 more)] === [2024-01-30 14:41:01,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:41:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1843500743, now seen corresponding path program 1 times [2024-01-30 14:41:01,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:41:01,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916963848] [2024-01-30 14:41:01,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:41:01,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:41:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:41:02,072 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-30 14:41:02,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:41:02,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916963848] [2024-01-30 14:41:02,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916963848] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:41:02,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:41:02,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:41:02,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441210327] [2024-01-30 14:41:02,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:41:02,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:41:02,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:41:02,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:41:02,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:41:02,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 68 [2024-01-30 14:41:02,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-30 14:41:02,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:41:02,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 68 [2024-01-30 14:41:02,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:41:02,295 INFO L124 PetriNetUnfolderBase]: 197/743 cut-off events. [2024-01-30 14:41:02,296 INFO L125 PetriNetUnfolderBase]: For 347/376 co-relation queries the response was YES. [2024-01-30 14:41:02,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1404 conditions, 743 events. 197/743 cut-off events. For 347/376 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4751 event pairs, 80 based on Foata normal form. 9/682 useless extension candidates. Maximal degree in co-relation 1386. Up to 266 conditions per place. [2024-01-30 14:41:02,300 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 46 selfloop transitions, 7 changer transitions 1/85 dead transitions. [2024-01-30 14:41:02,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 343 flow [2024-01-30 14:41:02,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:41:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:41:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2024-01-30 14:41:02,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6838235294117647 [2024-01-30 14:41:02,302 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 189 flow. Second operand 4 states and 186 transitions. [2024-01-30 14:41:02,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 343 flow [2024-01-30 14:41:02,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 85 transitions, 337 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:41:02,305 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 195 flow [2024-01-30 14:41:02,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2024-01-30 14:41:02,306 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 2 predicate places. [2024-01-30 14:41:02,307 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 195 flow [2024-01-30 14:41:02,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-30 14:41:02,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:41:02,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:41:02,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:41:02,308 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 23 more)] === [2024-01-30 14:41:02,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:41:02,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1313948450, now seen corresponding path program 1 times [2024-01-30 14:41:02,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:41:02,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285223700] [2024-01-30 14:41:02,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:41:02,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:41:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:41:02,349 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-30 14:41:02,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:41:02,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285223700] [2024-01-30 14:41:02,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285223700] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:41:02,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:41:02,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:41:02,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889896245] [2024-01-30 14:41:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:41:02,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:41:02,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:41:02,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:41:02,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:41:02,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 68 [2024-01-30 14:41:02,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-30 14:41:02,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:41:02,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 68 [2024-01-30 14:41:02,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:41:02,567 INFO L124 PetriNetUnfolderBase]: 205/770 cut-off events. [2024-01-30 14:41:02,567 INFO L125 PetriNetUnfolderBase]: For 342/367 co-relation queries the response was YES. [2024-01-30 14:41:02,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 770 events. 205/770 cut-off events. For 342/367 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5032 event pairs, 95 based on Foata normal form. 50/758 useless extension candidates. Maximal degree in co-relation 1426. Up to 207 conditions per place. [2024-01-30 14:41:02,571 INFO L140 encePairwiseOnDemand]: 59/68 looper letters, 52 selfloop transitions, 5 changer transitions 5/91 dead transitions. [2024-01-30 14:41:02,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 91 transitions, 383 flow [2024-01-30 14:41:02,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:41:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:41:02,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2024-01-30 14:41:02,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7169117647058824 [2024-01-30 14:41:02,573 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 195 flow. Second operand 4 states and 195 transitions. [2024-01-30 14:41:02,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 91 transitions, 383 flow [2024-01-30 14:41:02,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 367 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-30 14:41:02,577 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 183 flow [2024-01-30 14:41:02,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=67, 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=4, PETRI_FLOW=183, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2024-01-30 14:41:02,578 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 2 predicate places. [2024-01-30 14:41:02,578 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 183 flow [2024-01-30 14:41:02,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-30 14:41:02,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:41:02,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:41:02,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:41:02,579 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 23 more)] === [2024-01-30 14:41:02,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:41:02,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1313948721, now seen corresponding path program 1 times [2024-01-30 14:41:02,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:41:02,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395047346] [2024-01-30 14:41:02,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:41:02,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:41:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:41:02,868 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-30 14:41:02,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:41:02,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395047346] [2024-01-30 14:41:02,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395047346] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:41:02,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:41:02,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:41:02,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908496806] [2024-01-30 14:41:02,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:41:02,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:41:02,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:41:02,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:41:02,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:41:02,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 68 [2024-01-30 14:41:02,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 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-30 14:41:02,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:41:02,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 68 [2024-01-30 14:41:02,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:41:03,070 INFO L124 PetriNetUnfolderBase]: 225/839 cut-off events. [2024-01-30 14:41:03,070 INFO L125 PetriNetUnfolderBase]: For 257/272 co-relation queries the response was YES. [2024-01-30 14:41:03,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627 conditions, 839 events. 225/839 cut-off events. For 257/272 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5585 event pairs, 24 based on Foata normal form. 45/834 useless extension candidates. Maximal degree in co-relation 1608. Up to 226 conditions per place. [2024-01-30 14:41:03,074 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 52 selfloop transitions, 5 changer transitions 3/89 dead transitions. [2024-01-30 14:41:03,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 365 flow [2024-01-30 14:41:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:41:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:41:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2024-01-30 14:41:03,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7022058823529411 [2024-01-30 14:41:03,075 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 183 flow. Second operand 4 states and 191 transitions. [2024-01-30 14:41:03,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 365 flow [2024-01-30 14:41:03,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 89 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:41:03,078 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 205 flow [2024-01-30 14:41:03,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2024-01-30 14:41:03,079 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places. [2024-01-30 14:41:03,079 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 205 flow [2024-01-30 14:41:03,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 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-30 14:41:03,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:41:03,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:41:03,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:41:03,080 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 23 more)] === [2024-01-30 14:41:03,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:41:03,080 INFO L85 PathProgramCache]: Analyzing trace with hash -15655772, now seen corresponding path program 1 times [2024-01-30 14:41:03,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:41:03,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677914929] [2024-01-30 14:41:03,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:41:03,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:41:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:41:03,159 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-30 14:41:03,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:41:03,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677914929] [2024-01-30 14:41:03,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677914929] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:41:03,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:41:03,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:41:03,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837207340] [2024-01-30 14:41:03,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:41:03,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-30 14:41:03,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:41:03,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-30 14:41:03,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-30 14:41:03,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 68 [2024-01-30 14:41:03,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-30 14:41:03,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:41:03,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 68 [2024-01-30 14:41:03,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:41:03,425 INFO L124 PetriNetUnfolderBase]: 192/698 cut-off events. [2024-01-30 14:41:03,425 INFO L125 PetriNetUnfolderBase]: For 464/477 co-relation queries the response was YES. [2024-01-30 14:41:03,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 698 events. 192/698 cut-off events. For 464/477 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4337 event pairs, 24 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 1448. Up to 181 conditions per place. [2024-01-30 14:41:03,429 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 44 selfloop transitions, 9 changer transitions 23/107 dead transitions. [2024-01-30 14:41:03,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 107 transitions, 472 flow [2024-01-30 14:41:03,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-30 14:41:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-30 14:41:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 349 transitions. [2024-01-30 14:41:03,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7331932773109243 [2024-01-30 14:41:03,431 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 205 flow. Second operand 7 states and 349 transitions. [2024-01-30 14:41:03,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 107 transitions, 472 flow [2024-01-30 14:41:03,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 107 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:41:03,435 INFO L231 Difference]: Finished difference. Result has 81 places, 64 transitions, 231 flow [2024-01-30 14:41:03,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=231, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2024-01-30 14:41:03,437 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 12 predicate places. [2024-01-30 14:41:03,437 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 231 flow [2024-01-30 14:41:03,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-30 14:41:03,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:41:03,437 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-30 14:41:03,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:41:03,438 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 23 more)] === [2024-01-30 14:41:03,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:41:03,438 INFO L85 PathProgramCache]: Analyzing trace with hash 531193913, now seen corresponding path program 1 times [2024-01-30 14:41:03,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:41:03,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438934651] [2024-01-30 14:41:03,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:41:03,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:41:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:41:03,524 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-30 14:41:03,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:41:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438934651] [2024-01-30 14:41:03,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438934651] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:41:03,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:41:03,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:41:03,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658316075] [2024-01-30 14:41:03,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:41:03,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:41:03,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:41:03,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:41:03,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:41:03,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 68 [2024-01-30 14:41:03,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-30 14:41:03,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:41:03,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 68 [2024-01-30 14:41:03,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:41:03,607 INFO L124 PetriNetUnfolderBase]: 74/445 cut-off events. [2024-01-30 14:41:03,608 INFO L125 PetriNetUnfolderBase]: For 336/338 co-relation queries the response was YES. [2024-01-30 14:41:03,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 445 events. 74/445 cut-off events. For 336/338 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2591 event pairs, 31 based on Foata normal form. 6/441 useless extension candidates. Maximal degree in co-relation 893. Up to 151 conditions per place. [2024-01-30 14:41:03,610 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 36 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2024-01-30 14:41:03,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 79 transitions, 373 flow [2024-01-30 14:41:03,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:41:03,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:41:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2024-01-30 14:41:03,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8578431372549019 [2024-01-30 14:41:03,612 INFO L175 Difference]: Start difference. First operand has 81 places, 64 transitions, 231 flow. Second operand 3 states and 175 transitions. [2024-01-30 14:41:03,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 79 transitions, 373 flow [2024-01-30 14:41:03,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 79 transitions, 342 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-01-30 14:41:03,616 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 239 flow [2024-01-30 14:41:03,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=239, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2024-01-30 14:41:03,619 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places. [2024-01-30 14:41:03,619 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 239 flow [2024-01-30 14:41:03,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-30 14:41:03,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:41:03,620 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-30 14:41:03,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-30 14:41:03,620 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 23 more)] === [2024-01-30 14:41:03,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:41:03,621 INFO L85 PathProgramCache]: Analyzing trace with hash -531068371, now seen corresponding path program 1 times [2024-01-30 14:41:03,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:41:03,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922859308] [2024-01-30 14:41:03,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:41:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:41:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:41:03,805 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-30 14:41:03,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:41:03,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922859308] [2024-01-30 14:41:03,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922859308] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:41:03,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:41:03,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:41:03,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541519850] [2024-01-30 14:41:03,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:41:03,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-30 14:41:03,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:41:03,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-30 14:41:03,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-30 14:41:03,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 68 [2024-01-30 14:41:03,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 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-30 14:41:03,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:41:03,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 68 [2024-01-30 14:41:03,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:41:03,865 INFO L124 PetriNetUnfolderBase]: 20/194 cut-off events. [2024-01-30 14:41:03,865 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-01-30 14:41:03,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 194 events. 20/194 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 631 event pairs, 4 based on Foata normal form. 7/188 useless extension candidates. Maximal degree in co-relation 359. Up to 63 conditions per place. [2024-01-30 14:41:03,867 INFO L140 encePairwiseOnDemand]: 63/68 looper letters, 22 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2024-01-30 14:41:03,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 60 transitions, 253 flow [2024-01-30 14:41:03,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:41:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:41:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2024-01-30 14:41:03,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7610294117647058 [2024-01-30 14:41:03,868 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 239 flow. Second operand 4 states and 207 transitions. [2024-01-30 14:41:03,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 60 transitions, 253 flow [2024-01-30 14:41:03,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 60 transitions, 226 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-01-30 14:41:03,871 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 175 flow [2024-01-30 14:41:03,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2024-01-30 14:41:03,872 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 1 predicate places. [2024-01-30 14:41:03,872 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 175 flow [2024-01-30 14:41:03,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 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-30 14:41:03,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:41:03,872 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] [2024-01-30 14:41:03,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-30 14:41:03,873 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 23 more)] === [2024-01-30 14:41:03,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:41:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1087791416, now seen corresponding path program 1 times [2024-01-30 14:41:03,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:41:03,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638614795] [2024-01-30 14:41:03,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:41:03,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:41:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:41:04,140 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-30 14:41:04,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:41:04,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638614795] [2024-01-30 14:41:04,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638614795] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:41:04,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:41:04,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:41:04,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701618087] [2024-01-30 14:41:04,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:41:04,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:41:04,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:41:04,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:41:04,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:41:04,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 68 [2024-01-30 14:41:04,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-30 14:41:04,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:41:04,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 68 [2024-01-30 14:41:04,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:41:04,255 INFO L124 PetriNetUnfolderBase]: 29/186 cut-off events. [2024-01-30 14:41:04,255 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-01-30 14:41:04,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 186 events. 29/186 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 582 event pairs, 15 based on Foata normal form. 14/193 useless extension candidates. Maximal degree in co-relation 354. Up to 55 conditions per place. [2024-01-30 14:41:04,256 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 30 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2024-01-30 14:41:04,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 60 transitions, 257 flow [2024-01-30 14:41:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:41:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:41:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2024-01-30 14:41:04,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6397058823529411 [2024-01-30 14:41:04,258 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 175 flow. Second operand 4 states and 174 transitions. [2024-01-30 14:41:04,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 60 transitions, 257 flow [2024-01-30 14:41:04,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 240 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-30 14:41:04,260 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 171 flow [2024-01-30 14:41:04,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-01-30 14:41:04,262 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -2 predicate places. [2024-01-30 14:41:04,262 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 171 flow [2024-01-30 14:41:04,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-30 14:41:04,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:41:04,263 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] [2024-01-30 14:41:04,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-30 14:41:04,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 23 more)] === [2024-01-30 14:41:04,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:41:04,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1690489477, now seen corresponding path program 1 times [2024-01-30 14:41:04,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:41:04,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284161022] [2024-01-30 14:41:04,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:41:04,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:41:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:41:04,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:41:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:41:04,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:41:04,318 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:41:04,318 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (25 of 26 remaining) [2024-01-30 14:41:04,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 26 remaining) [2024-01-30 14:41:04,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 26 remaining) [2024-01-30 14:41:04,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 26 remaining) [2024-01-30 14:41:04,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 26 remaining) [2024-01-30 14:41:04,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 26 remaining) [2024-01-30 14:41:04,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 26 remaining) [2024-01-30 14:41:04,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 26 remaining) [2024-01-30 14:41:04,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 26 remaining) [2024-01-30 14:41:04,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 26 remaining) [2024-01-30 14:41:04,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 26 remaining) [2024-01-30 14:41:04,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 26 remaining) [2024-01-30 14:41:04,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 26 remaining) [2024-01-30 14:41:04,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 26 remaining) [2024-01-30 14:41:04,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 26 remaining) [2024-01-30 14:41:04,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 26 remaining) [2024-01-30 14:41:04,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 26 remaining) [2024-01-30 14:41:04,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 26 remaining) [2024-01-30 14:41:04,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 26 remaining) [2024-01-30 14:41:04,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 26 remaining) [2024-01-30 14:41:04,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 26 remaining) [2024-01-30 14:41:04,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 26 remaining) [2024-01-30 14:41:04,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 26 remaining) [2024-01-30 14:41:04,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 26 remaining) [2024-01-30 14:41:04,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 26 remaining) [2024-01-30 14:41:04,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 26 remaining) [2024-01-30 14:41:04,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-30 14:41:04,325 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:41:04,333 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:41:04,333 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:41:04,371 INFO L503 ceAbstractionStarter]: Automizer considered 18 witness invariants [2024-01-30 14:41:04,371 INFO L504 ceAbstractionStarter]: WitnessConsidered=18 [2024-01-30 14:41:04,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:41:04 BasicIcfg [2024-01-30 14:41:04,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:41:04,373 INFO L158 Benchmark]: Toolchain (without parser) took 5835.18ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 105.4MB in the beginning and 103.2MB in the end (delta: 2.2MB). Peak memory consumption was 96.2MB. Max. memory is 16.1GB. [2024-01-30 14:41:04,373 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:41:04,374 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 182.5MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:41:04,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 822.04ms. Allocated memory is still 182.5MB. Free memory was 105.2MB in the beginning and 148.8MB in the end (delta: -43.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-01-30 14:41:04,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.01ms. Allocated memory is still 182.5MB. Free memory was 148.8MB in the beginning and 146.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:41:04,376 INFO L158 Benchmark]: Boogie Preprocessor took 57.53ms. Allocated memory is still 182.5MB. Free memory was 146.5MB in the beginning and 143.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-30 14:41:04,376 INFO L158 Benchmark]: RCFGBuilder took 597.72ms. Allocated memory is still 182.5MB. Free memory was 143.5MB in the beginning and 107.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-01-30 14:41:04,377 INFO L158 Benchmark]: TraceAbstraction took 4284.92ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 106.9MB in the beginning and 103.2MB in the end (delta: 3.7MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. [2024-01-30 14:41:04,378 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 182.5MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 822.04ms. Allocated memory is still 182.5MB. Free memory was 105.2MB in the beginning and 148.8MB in the end (delta: -43.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.01ms. Allocated memory is still 182.5MB. Free memory was 148.8MB in the beginning and 146.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.53ms. Allocated memory is still 182.5MB. Free memory was 146.5MB in the beginning and 143.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 597.72ms. Allocated memory is still 182.5MB. Free memory was 143.5MB in the beginning and 107.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4284.92ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 106.9MB in the beginning and 103.2MB in the end (delta: 3.7MB). Peak memory consumption was 97.9MB. 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 g = 42; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L694] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]] [L694] 0 int r = __VERIFIER_nondet_int(); [L695] 0 int t; [L696] 0 pthread_t id; VAL [A={3:0}, B={4:0}, g=42, id={5:0}, r=1] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]] [L697] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]],BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]],BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] COND TRUE 0 \read(r) VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]],BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[r],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]]]] [L701] 0 g = 17 VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L702] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPNEQ,IdentifierExpression[r],IntegerLiteral[0]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L703] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPNEQ,IdentifierExpression[r],IntegerLiteral[0]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]],BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]]]] [L705] 0 t = g VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[t]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPLEQ,IdentifierExpression[t],IntegerLiteral[42]]],BinaryExpression[COMPLEQ,IdentifierExpression[t],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[t],IntegerLiteral[25]],IntegerLiteral[17]]],BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[t],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[42]]]]]] [L706] CALL 0 __VERIFIER_assert(!(t == 17)) [L19] COND TRUE 0 !(cond) VAL [A={3:0}, B={4:0}, \old(cond)=0, arg={0:0}, cond=0, g=17] [L19] 0 reach_error() VAL [A={3:0}, B={4:0}, \old(cond)=0, arg={0:0}, cond=0, g=17] - 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: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: 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: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: 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: 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: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 689]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 90 locations, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 846 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 565 mSDsluCounter, 171 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1125 IncrementalHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 97 mSDtfsCounter, 1125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=8, InterpolantAutomatonStates: 41, 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, 1.4s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 467 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-30 14:41:04,416 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