./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_unknown_2_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/13-privatized_19-publish-precision_unknown_2_neg.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 59af5db6 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_unknown_2_neg.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_19-publish-precision_unknown_2_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-59af5db-m [2024-02-02 09:36:14,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:36:14,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:36:14,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:36:14,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:36:14,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:36:14,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:36:14,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:36:14,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:36:14,728 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:36:14,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:36:14,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:36:14,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:36:14,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:36:14,730 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:36:14,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:36:14,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:36:14,731 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:36:14,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:36:14,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:36:14,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:36:14,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:36:14,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:36:14,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:36:14,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:36:14,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:36:14,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:36:14,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:36:14,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:36:14,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:36:14,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:36:14,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:36:14,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:36:14,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:36:14,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:36:14,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:36:14,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:36:14,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:36:14,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:36:14,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:36:14,737 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:36:14,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:36:14,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:36:14,737 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-02 09:36:14,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:36:14,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:36:14,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:36:14,981 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:36:14,981 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:36:14,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_19-publish-precision_unknown_2_neg.yml/witness.yml [2024-02-02 09:36:15,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:36:15,063 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:36:15,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_unknown_2_neg.i [2024-02-02 09:36:16,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:36:16,460 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:36:16,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_unknown_2_neg.i [2024-02-02 09:36:16,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d950f2b0f/2fd99c777b874e589e06f0b9f2dfd2bf/FLAG12388036a [2024-02-02 09:36:16,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d950f2b0f/2fd99c777b874e589e06f0b9f2dfd2bf [2024-02-02 09:36:16,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:36:16,500 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:36:16,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:36:16,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:36:16,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:36:16,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:36:15" (1/2) ... [2024-02-02 09:36:16,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1684e5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:16, skipping insertion in model container [2024-02-02 09:36:16,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:36:15" (1/2) ... [2024-02-02 09:36:16,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1a536f7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:16, skipping insertion in model container [2024-02-02 09:36:16,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:36:16" (2/2) ... [2024-02-02 09:36:16,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1684e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16, skipping insertion in model container [2024-02-02 09:36:16,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:36:16" (2/2) ... [2024-02-02 09:36:16,511 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:36:16,559 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:36:16,560 INFO L101 nessWitnessExtractor]: Location invariant before [L685-L685] (unsigned long )arg == 0UL [2024-02-02 09:36:16,560 INFO L101 nessWitnessExtractor]: Location invariant before [L697-L697] glob1 == 0 [2024-02-02 09:36:16,561 INFO L101 nessWitnessExtractor]: Location invariant before [L690-L690] (glob1 == 5) && ((unsigned long )arg == 0UL) [2024-02-02 09:36:16,561 INFO L101 nessWitnessExtractor]: Location invariant before [L686-L686] (((((0 <= glob1) && (glob1 <= 5)) && (glob1 <= 127)) && (glob1 % 5 == 0)) && ((unsigned long )arg == 0UL)) && (glob1 == 0 || glob1 == 5) [2024-02-02 09:36:16,561 INFO L101 nessWitnessExtractor]: Location invariant before [L691-L691] (glob1 == 0) && ((unsigned long )arg == 0UL) [2024-02-02 09:36:16,561 INFO L101 nessWitnessExtractor]: Location invariant before [L700-L700] ((((0 <= glob1) && (glob1 <= 5)) && (glob1 <= 127)) && (glob1 % 5 == 0)) && (glob1 == 0 || glob1 == 5) [2024-02-02 09:36:16,562 INFO L101 nessWitnessExtractor]: Location invariant before [L688-L688] (glob1 == 5) && ((unsigned long )arg == 0UL) [2024-02-02 09:36:16,562 INFO L101 nessWitnessExtractor]: Location invariant before [L693-L693] (unsigned long )arg == 0UL [2024-02-02 09:36:16,562 INFO L101 nessWitnessExtractor]: Location invariant before [L699-L699] ((((0 <= glob1) && (glob1 <= 5)) && (glob1 <= 127)) && (glob1 % 5 == 0)) && (glob1 == 0 || glob1 == 5) [2024-02-02 09:36:16,562 INFO L101 nessWitnessExtractor]: Location invariant before [L687-L687] (((((0 <= glob1) && (glob1 <= 5)) && (glob1 <= 127)) && (glob1 % 5 == 0)) && ((unsigned long )arg == 0UL)) && (glob1 == 0 || glob1 == 5) [2024-02-02 09:36:16,562 INFO L101 nessWitnessExtractor]: Location invariant before [L692-L692] (glob1 == 0) && ((unsigned long )arg == 0UL) [2024-02-02 09:36:16,562 INFO L101 nessWitnessExtractor]: Location invariant before [L689-L689] (glob1 == 5) && ((unsigned long )arg == 0UL) [2024-02-02 09:36:16,562 INFO L101 nessWitnessExtractor]: Location invariant before [L19-L19] ((((((((((((((0 <= glob1) && (glob1 <= 5)) && (glob1 <= 127)) && (glob1 % 5 == 0)) && (glob1 == 0 || glob1 == 5)) && (0 <= glob1)) && (glob1 <= 5)) && (glob1 <= 127)) && (glob1 % 5 == 0)) && (glob1 == 0 || glob1 == 5)) && (0 <= glob1)) && (glob1 <= 5)) && (glob1 <= 127)) && (glob1 % 5 == 0)) && (glob1 == 0 || glob1 == 5) [2024-02-02 09:36:16,598 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:36:16,730 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_unknown_2_neg.i[1103,1116] [2024-02-02 09:36:16,867 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:36:16,876 INFO L202 MainTranslator]: Completed pre-run [2024-02-02 09:36:16,884 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_unknown_2_neg.i[1103,1116] [2024-02-02 09:36:16,885 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: {reach_error();abort();} } } with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-02 09:36:16,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:36:16,995 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:36:16,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16 WrapperNode [2024-02-02 09:36:16,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:36:16,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:36:16,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:36:16,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:36:17,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16" (1/1) ... [2024-02-02 09:36:17,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16" (1/1) ... [2024-02-02 09:36:17,034 INFO L138 Inliner]: procedures = 163, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2024-02-02 09:36:17,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:36:17,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:36:17,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:36:17,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:36:17,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16" (1/1) ... [2024-02-02 09:36:17,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16" (1/1) ... [2024-02-02 09:36:17,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16" (1/1) ... [2024-02-02 09:36:17,063 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2024-02-02 09:36:17,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16" (1/1) ... [2024-02-02 09:36:17,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16" (1/1) ... [2024-02-02 09:36:17,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16" (1/1) ... [2024-02-02 09:36:17,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16" (1/1) ... [2024-02-02 09:36:17,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16" (1/1) ... [2024-02-02 09:36:17,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16" (1/1) ... [2024-02-02 09:36:17,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:36:17,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:36:17,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:36:17,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:36:17,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16" (1/1) ... [2024-02-02 09:36:17,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:36:17,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:36:17,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-02 09:36:17,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-02 09:36:17,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:36:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:36:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:36:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-02 09:36:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:36:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:36:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:36:17,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 09:36:17,203 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-02 09:36:17,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:36:17,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:36:17,203 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-02-02 09:36:17,203 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-02-02 09:36:17,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:36:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:36:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:36:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:36:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 09:36:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-02 09:36:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:36:17,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:36:17,221 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 09:36:17,322 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:36:17,324 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:36:17,558 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:36:17,559 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:36:17,681 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:36:17,681 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-02 09:36:17,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:36:17 BoogieIcfgContainer [2024-02-02 09:36:17,683 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:36:17,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:36:17,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:36:17,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:36:17,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:36:15" (1/4) ... [2024-02-02 09:36:17,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4522b7d9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:36:17, skipping insertion in model container [2024-02-02 09:36:17,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:36:16" (2/4) ... [2024-02-02 09:36:17,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4522b7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:36:17, skipping insertion in model container [2024-02-02 09:36:17,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:16" (3/4) ... [2024-02-02 09:36:17,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4522b7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:36:17, skipping insertion in model container [2024-02-02 09:36:17,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:36:17" (4/4) ... [2024-02-02 09:36:17,691 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_19-publish-precision_unknown_2_neg.i [2024-02-02 09:36:17,704 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:36:17,705 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-02-02 09:36:17,705 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:36:17,794 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-02-02 09:36:17,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 52 transitions, 111 flow [2024-02-02 09:36:17,857 INFO L124 PetriNetUnfolderBase]: 1/51 cut-off events. [2024-02-02 09:36:17,857 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-02 09:36:17,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 51 events. 1/51 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-02-02 09:36:17,860 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 52 transitions, 111 flow [2024-02-02 09:36:17,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 49 transitions, 101 flow [2024-02-02 09:36:17,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:36:17,873 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;@2b7826f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:36:17,873 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-02-02 09:36:17,875 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:36:17,875 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:36:17,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:36:17,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:17,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:36:17,876 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2024-02-02 09:36:17,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:17,880 INFO L85 PathProgramCache]: Analyzing trace with hash 7461, now seen corresponding path program 1 times [2024-02-02 09:36:17,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:17,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110449998] [2024-02-02 09:36:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:17,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:18,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:18,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110449998] [2024-02-02 09:36:18,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110449998] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:18,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:18,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:36:18,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169224925] [2024-02-02 09:36:18,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:18,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:36:18,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:18,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:36:18,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:36:18,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 52 [2024-02-02 09:36:18,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:18,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:18,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 52 [2024-02-02 09:36:18,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:18,305 INFO L124 PetriNetUnfolderBase]: 86/312 cut-off events. [2024-02-02 09:36:18,306 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:36:18,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 312 events. 86/312 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1480 event pairs, 56 based on Foata normal form. 23/319 useless extension candidates. Maximal degree in co-relation 514. Up to 125 conditions per place. [2024-02-02 09:36:18,311 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 27 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2024-02-02 09:36:18,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 169 flow [2024-02-02 09:36:18,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:36:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:36:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-02-02 09:36:18,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6858974358974359 [2024-02-02 09:36:18,323 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 101 flow. Second operand 3 states and 107 transitions. [2024-02-02 09:36:18,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 169 flow [2024-02-02 09:36:18,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:36:18,329 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 109 flow [2024-02-02 09:36:18,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-02-02 09:36:18,335 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-02-02 09:36:18,336 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 109 flow [2024-02-02 09:36:18,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:18,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:18,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-02 09:36:18,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:36:18,337 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2024-02-02 09:36:18,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:18,339 INFO L85 PathProgramCache]: Analyzing trace with hash 222556606, now seen corresponding path program 1 times [2024-02-02 09:36:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:18,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275793914] [2024-02-02 09:36:18,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:18,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:18,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275793914] [2024-02-02 09:36:18,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275793914] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:18,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:18,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:36:18,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102558137] [2024-02-02 09:36:18,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:18,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:36:18,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:18,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:36:18,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:36:18,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 52 [2024-02-02 09:36:18,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:18,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:18,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 52 [2024-02-02 09:36:18,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:18,649 INFO L124 PetriNetUnfolderBase]: 60/265 cut-off events. [2024-02-02 09:36:18,649 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-02-02 09:36:18,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 265 events. 60/265 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1220 event pairs, 36 based on Foata normal form. 7/238 useless extension candidates. Maximal degree in co-relation 433. Up to 138 conditions per place. [2024-02-02 09:36:18,653 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 23 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-02-02 09:36:18,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 167 flow [2024-02-02 09:36:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:36:18,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:36:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-02-02 09:36:18,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6682692307692307 [2024-02-02 09:36:18,662 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 109 flow. Second operand 4 states and 139 transitions. [2024-02-02 09:36:18,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 167 flow [2024-02-02 09:36:18,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:36:18,665 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 103 flow [2024-02-02 09:36:18,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2024-02-02 09:36:18,666 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-02-02 09:36:18,666 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 103 flow [2024-02-02 09:36:18,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:18,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:18,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:18,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:36:18,667 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2024-02-02 09:36:18,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:18,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1245397464, now seen corresponding path program 1 times [2024-02-02 09:36:18,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:18,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347127353] [2024-02-02 09:36:18,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:18,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:18,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:18,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347127353] [2024-02-02 09:36:18,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347127353] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:18,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:18,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:36:18,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105849998] [2024-02-02 09:36:18,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:18,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:36:18,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:18,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:36:18,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:36:18,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 52 [2024-02-02 09:36:18,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:18,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:18,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 52 [2024-02-02 09:36:18,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:18,952 INFO L124 PetriNetUnfolderBase]: 104/326 cut-off events. [2024-02-02 09:36:18,952 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-02-02 09:36:18,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 326 events. 104/326 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1444 event pairs, 14 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 591. Up to 142 conditions per place. [2024-02-02 09:36:18,954 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 35 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2024-02-02 09:36:18,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 197 flow [2024-02-02 09:36:18,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:36:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:36:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-02-02 09:36:18,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4951923076923077 [2024-02-02 09:36:18,955 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 103 flow. Second operand 4 states and 103 transitions. [2024-02-02 09:36:18,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 197 flow [2024-02-02 09:36:18,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:36:18,956 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 100 flow [2024-02-02 09:36:18,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2024-02-02 09:36:18,957 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-02-02 09:36:18,957 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 100 flow [2024-02-02 09:36:18,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:18,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:18,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:18,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:36:18,958 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2024-02-02 09:36:18,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:18,959 INFO L85 PathProgramCache]: Analyzing trace with hash -808830339, now seen corresponding path program 1 times [2024-02-02 09:36:18,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:18,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128802600] [2024-02-02 09:36:18,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:18,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:19,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:19,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128802600] [2024-02-02 09:36:19,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128802600] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:19,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:19,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:36:19,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759627409] [2024-02-02 09:36:19,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:19,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:36:19,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:19,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:36:19,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:36:19,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2024-02-02 09:36:19,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:19,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:19,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2024-02-02 09:36:19,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:19,105 INFO L124 PetriNetUnfolderBase]: 115/338 cut-off events. [2024-02-02 09:36:19,106 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-02-02 09:36:19,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 338 events. 115/338 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1512 event pairs, 48 based on Foata normal form. 6/328 useless extension candidates. Maximal degree in co-relation 631. Up to 128 conditions per place. [2024-02-02 09:36:19,107 INFO L140 encePairwiseOnDemand]: 41/52 looper letters, 34 selfloop transitions, 10 changer transitions 7/66 dead transitions. [2024-02-02 09:36:19,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 258 flow [2024-02-02 09:36:19,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:36:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:36:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2024-02-02 09:36:19,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6576923076923077 [2024-02-02 09:36:19,109 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 100 flow. Second operand 5 states and 171 transitions. [2024-02-02 09:36:19,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 258 flow [2024-02-02 09:36:19,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 246 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-02 09:36:19,110 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 155 flow [2024-02-02 09:36:19,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-02-02 09:36:19,111 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2024-02-02 09:36:19,111 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 155 flow [2024-02-02 09:36:19,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:19,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:19,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:19,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:36:19,112 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2024-02-02 09:36:19,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:19,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1411026869, now seen corresponding path program 1 times [2024-02-02 09:36:19,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:19,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327707263] [2024-02-02 09:36:19,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:19,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:19,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:19,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:19,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327707263] [2024-02-02 09:36:19,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327707263] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:19,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:19,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:36:19,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102480432] [2024-02-02 09:36:19,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:19,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:36:19,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:19,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:36:19,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:36:19,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 52 [2024-02-02 09:36:19,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:19,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:19,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 52 [2024-02-02 09:36:19,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:19,235 INFO L124 PetriNetUnfolderBase]: 100/296 cut-off events. [2024-02-02 09:36:19,235 INFO L125 PetriNetUnfolderBase]: For 198/209 co-relation queries the response was YES. [2024-02-02 09:36:19,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 296 events. 100/296 cut-off events. For 198/209 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1206 event pairs, 17 based on Foata normal form. 34/328 useless extension candidates. Maximal degree in co-relation 673. Up to 135 conditions per place. [2024-02-02 09:36:19,237 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 23 selfloop transitions, 3 changer transitions 14/50 dead transitions. [2024-02-02 09:36:19,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 237 flow [2024-02-02 09:36:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:36:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:36:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-02-02 09:36:19,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49038461538461536 [2024-02-02 09:36:19,238 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 155 flow. Second operand 4 states and 102 transitions. [2024-02-02 09:36:19,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 237 flow [2024-02-02 09:36:19,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:36:19,240 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 99 flow [2024-02-02 09:36:19,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2024-02-02 09:36:19,240 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-02-02 09:36:19,241 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 99 flow [2024-02-02 09:36:19,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:19,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:19,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:19,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:36:19,241 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2024-02-02 09:36:19,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:19,242 INFO L85 PathProgramCache]: Analyzing trace with hash 633960501, now seen corresponding path program 1 times [2024-02-02 09:36:19,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:19,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529894347] [2024-02-02 09:36:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:19,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:19,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:19,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529894347] [2024-02-02 09:36:19,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529894347] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:19,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:19,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 09:36:19,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678074160] [2024-02-02 09:36:19,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:19,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:36:19,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:19,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:36:19,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:36:19,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 52 [2024-02-02 09:36:19,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:19,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:19,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 52 [2024-02-02 09:36:19,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:19,377 INFO L124 PetriNetUnfolderBase]: 13/69 cut-off events. [2024-02-02 09:36:19,377 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-02-02 09:36:19,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 69 events. 13/69 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 112 event pairs, 6 based on Foata normal form. 7/70 useless extension candidates. Maximal degree in co-relation 135. Up to 23 conditions per place. [2024-02-02 09:36:19,378 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 7 selfloop transitions, 4 changer transitions 14/36 dead transitions. [2024-02-02 09:36:19,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 145 flow [2024-02-02 09:36:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:36:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:36:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-02-02 09:36:19,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7019230769230769 [2024-02-02 09:36:19,379 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 99 flow. Second operand 4 states and 146 transitions. [2024-02-02 09:36:19,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 145 flow [2024-02-02 09:36:19,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 121 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-02-02 09:36:19,381 INFO L231 Difference]: Finished difference. Result has 41 places, 21 transitions, 59 flow [2024-02-02 09:36:19,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=59, PETRI_PLACES=41, PETRI_TRANSITIONS=21} [2024-02-02 09:36:19,382 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2024-02-02 09:36:19,382 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 21 transitions, 59 flow [2024-02-02 09:36:19,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:19,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:19,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:19,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:36:19,383 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2024-02-02 09:36:19,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:19,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1747438276, now seen corresponding path program 1 times [2024-02-02 09:36:19,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:19,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003288256] [2024-02-02 09:36:19,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:19,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:36:19,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:36:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:36:19,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:36:19,420 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:36:19,421 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (22 of 23 remaining) [2024-02-02 09:36:19,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 23 remaining) [2024-02-02 09:36:19,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 23 remaining) [2024-02-02 09:36:19,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 23 remaining) [2024-02-02 09:36:19,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 23 remaining) [2024-02-02 09:36:19,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 23 remaining) [2024-02-02 09:36:19,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 23 remaining) [2024-02-02 09:36:19,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 23 remaining) [2024-02-02 09:36:19,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 23 remaining) [2024-02-02 09:36:19,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 23 remaining) [2024-02-02 09:36:19,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 23 remaining) [2024-02-02 09:36:19,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 23 remaining) [2024-02-02 09:36:19,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 23 remaining) [2024-02-02 09:36:19,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 23 remaining) [2024-02-02 09:36:19,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 23 remaining) [2024-02-02 09:36:19,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 23 remaining) [2024-02-02 09:36:19,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 23 remaining) [2024-02-02 09:36:19,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 23 remaining) [2024-02-02 09:36:19,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 23 remaining) [2024-02-02 09:36:19,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 23 remaining) [2024-02-02 09:36:19,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 23 remaining) [2024-02-02 09:36:19,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 23 remaining) [2024-02-02 09:36:19,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 23 remaining) [2024-02-02 09:36:19,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:36:19,428 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:19,432 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:36:19,433 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:36:19,465 INFO L503 ceAbstractionStarter]: Automizer considered 12 witness invariants [2024-02-02 09:36:19,465 INFO L504 ceAbstractionStarter]: WitnessConsidered=12 [2024-02-02 09:36:19,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:36:19 BasicIcfg [2024-02-02 09:36:19,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:36:19,468 INFO L158 Benchmark]: Toolchain (without parser) took 2966.64ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 115.3MB in the beginning and 191.4MB in the end (delta: -76.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-02-02 09:36:19,468 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 176.2MB. Free memory was 142.5MB in the beginning and 142.4MB in the end (delta: 94.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:36:19,468 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:36:19,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.62ms. Allocated memory is still 176.2MB. Free memory was 114.9MB in the beginning and 91.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-02-02 09:36:19,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.62ms. Allocated memory is still 176.2MB. Free memory was 91.8MB in the beginning and 89.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:36:19,470 INFO L158 Benchmark]: Boogie Preprocessor took 47.75ms. Allocated memory is still 176.2MB. Free memory was 89.6MB in the beginning and 87.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:36:19,470 INFO L158 Benchmark]: RCFGBuilder took 598.86ms. Allocated memory is still 176.2MB. Free memory was 87.6MB in the beginning and 57.7MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-02-02 09:36:19,471 INFO L158 Benchmark]: TraceAbstraction took 1781.35ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 57.1MB in the beginning and 191.4MB in the end (delta: -134.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:36:19,473 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.15ms. Allocated memory is still 176.2MB. Free memory was 142.5MB in the beginning and 142.4MB in the end (delta: 94.0kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.62ms. Allocated memory is still 176.2MB. Free memory was 114.9MB in the beginning and 91.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.62ms. Allocated memory is still 176.2MB. Free memory was 91.8MB in the beginning and 89.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.75ms. Allocated memory is still 176.2MB. Free memory was 89.6MB in the beginning and 87.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 598.86ms. Allocated memory is still 176.2MB. Free memory was 87.6MB in the beginning and 57.7MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1781.35ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 57.1MB in the beginning and 191.4MB in the end (delta: -134.3MB). There was no memory consumed. 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: [L681] 0 int glob1 = 0; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L696] 0 pthread_t id; VAL [glob1=0, id={5:0}, mutex1={3:0}, mutex2={4:0}] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] [L697] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, glob1=0, id={5:0}, mutex1={3:0}, mutex2={4:0}] [L685] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, mutex2={4:0}] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[5]]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[glob1],IntegerLiteral[5]],IntegerLiteral[0]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[5]]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, mutex2={4:0}] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[5]]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[glob1],IntegerLiteral[5]],IntegerLiteral[0]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[5]]]]]] [L687] 1 glob1 = 5 VAL [arg={0:0}, arg={0:0}, glob1=5, mutex1={3:0}, mutex2={4:0}] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[5]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=5, mutex1={3:0}, mutex2={4:0}] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[5]]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[glob1],IntegerLiteral[5]],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[5]]]]]] [L699] CALL 0 __VERIFIER_assert(!(glob1 == 5)) [L19] COND TRUE 0 !(cond) VAL [\old(cond)=0, arg={0:0}, arg={0:0}, cond=0, glob1=5, mutex1={3:0}, mutex2={4:0}] [L19] 0 reach_error() VAL [\old(cond)=0, arg={0:0}, arg={0:0}, cond=0, glob1=5, mutex1={3:0}, mutex2={4:0}] - 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: 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: 685]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 85 locations, 23 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: 1.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 422 IncrementalHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 16 mSDtfsCounter, 422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 261 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-02 09:36:19,498 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