./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_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_18-first-reads_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_18-first-reads_unknown_2_neg.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_18-first-reads_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:05,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:36:05,664 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:05,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:36:05,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:36:05,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:36:05,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:36:05,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:36:05,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:36:05,695 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:36:05,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:36:05,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:36:05,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:36:05,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:36:05,697 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:36:05,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:36:05,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:36:05,698 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:36:05,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:36:05,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:36:05,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:36:05,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:36:05,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:36:05,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:36:05,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:36:05,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:36:05,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:36:05,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:36:05,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:36:05,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:36:05,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:36:05,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:36:05,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:36:05,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:36:05,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:36:05,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:36:05,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:36:05,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:36:05,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:36:05,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:36:05,703 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:36:05,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:36:05,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:36:05,704 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:05,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:36:05,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:36:05,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:36:05,923 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:36:05,924 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:36:05,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_18-first-reads_unknown_2_neg.yml/witness.yml [2024-02-02 09:36:06,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:36:06,036 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:36:06,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i [2024-02-02 09:36:06,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:36:07,172 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:36:07,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i [2024-02-02 09:36:07,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59290f2e7/22bbd57a1dc147c4b69e1924a74b02a0/FLAG3960b9f5b [2024-02-02 09:36:07,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59290f2e7/22bbd57a1dc147c4b69e1924a74b02a0 [2024-02-02 09:36:07,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:36:07,235 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:36:07,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:36:07,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:36:07,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:36:07,243 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:06" (1/2) ... [2024-02-02 09:36:07,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa7d3f1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:07, skipping insertion in model container [2024-02-02 09:36:07,244 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:06" (1/2) ... [2024-02-02 09:36:07,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7195d9c5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:07, skipping insertion in model container [2024-02-02 09:36:07,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:36:07" (2/2) ... [2024-02-02 09:36:07,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa7d3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:07, skipping insertion in model container [2024-02-02 09:36:07,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:36:07" (2/2) ... [2024-02-02 09:36:07,247 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:36:07,289 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:36:07,291 INFO L101 nessWitnessExtractor]: Location invariant before [L19-L19] ((((((((0 <= glob1) && (glob1 <= 1)) && (glob1 == 0 || glob1 == 1)) && (0 <= glob1)) && (glob1 <= 1)) && (glob1 == 0 || glob1 == 1)) && (0 <= glob1)) && (glob1 <= 1)) && (glob1 == 0 || glob1 == 1) [2024-02-02 09:36:07,291 INFO L101 nessWitnessExtractor]: Location invariant before [L693-L693] ((((0 <= t) && (t <= 1)) && (glob1 == 0)) && ((unsigned long )arg == 0UL)) && (t == 0 || t == 1) [2024-02-02 09:36:07,291 INFO L101 nessWitnessExtractor]: Location invariant before [L698-L698] glob1 == 0 [2024-02-02 09:36:07,291 INFO L101 nessWitnessExtractor]: Location invariant before [L700-L700] glob1 == 0 [2024-02-02 09:36:07,291 INFO L101 nessWitnessExtractor]: Location invariant before [L685-L685] (unsigned long )arg == 0UL [2024-02-02 09:36:07,292 INFO L101 nessWitnessExtractor]: Location invariant before [L690-L690] (((0 <= glob1) && (glob1 <= 1)) && ((unsigned long )arg == 0UL)) && (glob1 == 0 || glob1 == 1) [2024-02-02 09:36:07,292 INFO L101 nessWitnessExtractor]: Location invariant before [L688-L688] ((glob1 == 0) && (t == 42)) && ((unsigned long )arg == 0UL) [2024-02-02 09:36:07,292 INFO L101 nessWitnessExtractor]: Location invariant before [L694-L694] (((0 <= t) && (t <= 1)) && ((unsigned long )arg == 0UL)) && (t == 0 || t == 1) [2024-02-02 09:36:07,292 INFO L101 nessWitnessExtractor]: Location invariant before [L691-L691] ((((((0 <= glob1) && (0 <= t)) && (glob1 <= 1)) && (t <= 1)) && ((unsigned long )arg == 0UL)) && (glob1 == 0 || glob1 == 1)) && (t == 0 || t == 1) [2024-02-02 09:36:07,292 INFO L101 nessWitnessExtractor]: Location invariant before [L692-L692] ((((((0 <= glob1) && (0 <= t)) && (glob1 <= 1)) && (t <= 1)) && ((unsigned long )arg == 0UL)) && (glob1 == 0 || glob1 == 1)) && (t == 0 || t == 1) [2024-02-02 09:36:07,293 INFO L101 nessWitnessExtractor]: Location invariant before [L687-L689] (glob1 == 0) && ((unsigned long )arg == 0UL) [2024-02-02 09:36:07,293 INFO L101 nessWitnessExtractor]: Location invariant before [L686-L686] (unsigned long )arg == 0UL [2024-02-02 09:36:07,342 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:36:07,470 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i[1097,1110] [2024-02-02 09:36:07,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:36:07,623 INFO L202 MainTranslator]: Completed pre-run [2024-02-02 09:36:07,635 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i[1097,1110] [2024-02-02 09:36:07,636 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 [2024-02-02 09:36:07,720 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:36:07,747 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:36:07,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:07 WrapperNode [2024-02-02 09:36:07,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:36:07,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:36:07,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:36:07,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:36:07,755 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:07" (1/1) ... [2024-02-02 09:36:07,768 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:07" (1/1) ... [2024-02-02 09:36:07,788 INFO L138 Inliner]: procedures = 164, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-02-02 09:36:07,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:36:07,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:36:07,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:36:07,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:36:07,798 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:07" (1/1) ... [2024-02-02 09:36:07,798 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:07" (1/1) ... [2024-02-02 09:36:07,800 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:07" (1/1) ... [2024-02-02 09:36:07,811 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 5, 2]. 56 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 1 writes are split as follows [0, 0, 1]. [2024-02-02 09:36:07,811 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:07" (1/1) ... [2024-02-02 09:36:07,812 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:07" (1/1) ... [2024-02-02 09:36:07,820 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:07" (1/1) ... [2024-02-02 09:36:07,822 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:07" (1/1) ... [2024-02-02 09:36:07,829 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:07" (1/1) ... [2024-02-02 09:36:07,829 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:07" (1/1) ... [2024-02-02 09:36:07,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:36:07,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:36:07,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:36:07,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:36:07,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:07" (1/1) ... [2024-02-02 09:36:07,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:36:07,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:36:07,866 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:07,867 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:07,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:36:07,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:36:07,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:36:07,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:36:07,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:36:07,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:36:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-02 09:36:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:36:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:36:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-02-02 09:36:07,892 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-02-02 09:36:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:36:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:36:07,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:36:07,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:36:07,893 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-02 09:36:07,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:36:07,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:36:07,894 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:07,998 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:36:08,000 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:36:08,176 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:36:08,176 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:36:08,284 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:36:08,284 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-02 09:36:08,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:36:08 BoogieIcfgContainer [2024-02-02 09:36:08,285 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:36:08,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:36:08,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:36:08,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:36:08,290 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:06" (1/4) ... [2024-02-02 09:36:08,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e26c87 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:36:08, skipping insertion in model container [2024-02-02 09:36:08,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:36:07" (2/4) ... [2024-02-02 09:36:08,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e26c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:36:08, skipping insertion in model container [2024-02-02 09:36:08,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:07" (3/4) ... [2024-02-02 09:36:08,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e26c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:36:08, skipping insertion in model container [2024-02-02 09:36:08,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:36:08" (4/4) ... [2024-02-02 09:36:08,293 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_18-first-reads_unknown_2_neg.i [2024-02-02 09:36:08,307 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:36:08,308 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-02-02 09:36:08,308 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:36:08,366 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-02-02 09:36:08,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 44 transitions, 95 flow [2024-02-02 09:36:08,413 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-02-02 09:36:08,413 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-02 09:36:08,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 43 events. 2/43 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-02-02 09:36:08,417 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 44 transitions, 95 flow [2024-02-02 09:36:08,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 41 transitions, 85 flow [2024-02-02 09:36:08,434 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:36:08,440 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;@2e04ee15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:36:08,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-02-02 09:36:08,443 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:36:08,443 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:36:08,443 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:36:08,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:08,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:36:08,445 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-02-02 09:36:08,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash 6990, now seen corresponding path program 1 times [2024-02-02 09:36:08,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:08,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371468249] [2024-02-02 09:36:08,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:08,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:08,669 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:08,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:08,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371468249] [2024-02-02 09:36:08,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371468249] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:08,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:08,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:36:08,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562304407] [2024-02-02 09:36:08,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:08,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:36:08,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:08,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:36:08,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:36:08,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2024-02-02 09:36:08,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:08,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:08,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2024-02-02 09:36:08,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:08,844 INFO L124 PetriNetUnfolderBase]: 81/281 cut-off events. [2024-02-02 09:36:08,844 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:36:08,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 281 events. 81/281 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1413 event pairs, 53 based on Foata normal form. 13/271 useless extension candidates. Maximal degree in co-relation 459. Up to 137 conditions per place. [2024-02-02 09:36:08,847 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 25 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2024-02-02 09:36:08,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 157 flow [2024-02-02 09:36:08,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:36:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:36:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-02-02 09:36:08,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2024-02-02 09:36:08,866 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 85 flow. Second operand 3 states and 93 transitions. [2024-02-02 09:36:08,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 157 flow [2024-02-02 09:36:08,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:36:08,874 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 106 flow [2024-02-02 09:36:08,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2024-02-02 09:36:08,879 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-02-02 09:36:08,879 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 106 flow [2024-02-02 09:36:08,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:08,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:08,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-02 09:36:08,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:36:08,881 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-02-02 09:36:08,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:08,881 INFO L85 PathProgramCache]: Analyzing trace with hash 208492308, now seen corresponding path program 1 times [2024-02-02 09:36:08,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:08,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924149204] [2024-02-02 09:36:08,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:08,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:09,061 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:09,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:09,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924149204] [2024-02-02 09:36:09,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924149204] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:09,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:09,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:36:09,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20967147] [2024-02-02 09:36:09,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:09,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:36:09,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:09,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:36:09,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:36:09,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 44 [2024-02-02 09:36:09,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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:09,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:09,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 44 [2024-02-02 09:36:09,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:09,201 INFO L124 PetriNetUnfolderBase]: 64/259 cut-off events. [2024-02-02 09:36:09,201 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-02-02 09:36:09,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 259 events. 64/259 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1295 event pairs, 25 based on Foata normal form. 5/234 useless extension candidates. Maximal degree in co-relation 434. Up to 136 conditions per place. [2024-02-02 09:36:09,206 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 20 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2024-02-02 09:36:09,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 154 flow [2024-02-02 09:36:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:36:09,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:36:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-02-02 09:36:09,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6306818181818182 [2024-02-02 09:36:09,217 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 106 flow. Second operand 4 states and 111 transitions. [2024-02-02 09:36:09,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 154 flow [2024-02-02 09:36:09,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:36:09,220 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 98 flow [2024-02-02 09:36:09,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-02-02 09:36:09,221 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-02-02 09:36:09,221 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 98 flow [2024-02-02 09:36:09,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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:09,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:09,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:09,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:36:09,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-02-02 09:36:09,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:09,223 INFO L85 PathProgramCache]: Analyzing trace with hash -647019945, now seen corresponding path program 1 times [2024-02-02 09:36:09,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:09,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326554792] [2024-02-02 09:36:09,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:09,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:09,292 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:09,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:09,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326554792] [2024-02-02 09:36:09,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326554792] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:09,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:09,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:36:09,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806132333] [2024-02-02 09:36:09,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:09,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:36:09,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:09,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:36:09,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:36:09,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-02-02 09:36:09,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:09,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:09,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-02-02 09:36:09,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:09,401 INFO L124 PetriNetUnfolderBase]: 105/346 cut-off events. [2024-02-02 09:36:09,402 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-02-02 09:36:09,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 346 events. 105/346 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1798 event pairs, 9 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 630. Up to 140 conditions per place. [2024-02-02 09:36:09,404 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 34 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2024-02-02 09:36:09,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 218 flow [2024-02-02 09:36:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:36:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:36:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-02-02 09:36:09,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-02-02 09:36:09,409 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 98 flow. Second operand 4 states and 100 transitions. [2024-02-02 09:36:09,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 218 flow [2024-02-02 09:36:09,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:36:09,411 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 137 flow [2024-02-02 09:36:09,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-02-02 09:36:09,412 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-02-02 09:36:09,412 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 137 flow [2024-02-02 09:36:09,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:09,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:09,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:09,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:36:09,413 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-02-02 09:36:09,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:09,414 INFO L85 PathProgramCache]: Analyzing trace with hash 984098266, now seen corresponding path program 1 times [2024-02-02 09:36:09,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:09,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689612280] [2024-02-02 09:36:09,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:09,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:09,503 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:09,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:09,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689612280] [2024-02-02 09:36:09,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689612280] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:09,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:09,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:36:09,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461119555] [2024-02-02 09:36:09,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:09,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:36:09,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:09,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:36:09,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:36:09,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-02-02 09:36:09,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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:09,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:09,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-02-02 09:36:09,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:09,696 INFO L124 PetriNetUnfolderBase]: 115/350 cut-off events. [2024-02-02 09:36:09,696 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-02-02 09:36:09,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 350 events. 115/350 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1759 event pairs, 9 based on Foata normal form. 6/338 useless extension candidates. Maximal degree in co-relation 754. Up to 151 conditions per place. [2024-02-02 09:36:09,698 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 40 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2024-02-02 09:36:09,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 281 flow [2024-02-02 09:36:09,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:36:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:36:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-02-02 09:36:09,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-02-02 09:36:09,699 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 137 flow. Second operand 5 states and 105 transitions. [2024-02-02 09:36:09,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 281 flow [2024-02-02 09:36:09,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:36:09,701 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 143 flow [2024-02-02 09:36:09,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-02-02 09:36:09,701 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-02-02 09:36:09,701 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 143 flow [2024-02-02 09:36:09,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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:09,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:09,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:09,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:36:09,702 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-02-02 09:36:09,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:09,702 INFO L85 PathProgramCache]: Analyzing trace with hash 442276438, now seen corresponding path program 1 times [2024-02-02 09:36:09,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:09,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54243533] [2024-02-02 09:36:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:09,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:09,829 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:09,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:09,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54243533] [2024-02-02 09:36:09,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54243533] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:09,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:09,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:36:09,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361326413] [2024-02-02 09:36:09,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:09,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:36:09,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:09,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:36:09,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:36:09,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-02-02 09:36:09,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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:09,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:09,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-02-02 09:36:09,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:09,960 INFO L124 PetriNetUnfolderBase]: 156/435 cut-off events. [2024-02-02 09:36:09,961 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2024-02-02 09:36:09,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 435 events. 156/435 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2230 event pairs, 11 based on Foata normal form. 12/418 useless extension candidates. Maximal degree in co-relation 971. Up to 148 conditions per place. [2024-02-02 09:36:09,964 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 46 selfloop transitions, 9 changer transitions 5/67 dead transitions. [2024-02-02 09:36:09,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 331 flow [2024-02-02 09:36:09,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:36:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:36:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-02-02 09:36:09,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954545454545455 [2024-02-02 09:36:09,965 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 143 flow. Second operand 5 states and 109 transitions. [2024-02-02 09:36:09,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 331 flow [2024-02-02 09:36:09,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 313 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 09:36:09,969 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 165 flow [2024-02-02 09:36:09,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2024-02-02 09:36:09,971 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2024-02-02 09:36:09,971 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 165 flow [2024-02-02 09:36:09,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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:09,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:09,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:09,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:36:09,972 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-02-02 09:36:09,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash 442275413, now seen corresponding path program 1 times [2024-02-02 09:36:09,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:09,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050703186] [2024-02-02 09:36:09,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:10,038 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:10,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:10,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050703186] [2024-02-02 09:36:10,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050703186] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:10,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:10,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:36:10,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676181201] [2024-02-02 09:36:10,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:10,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:36:10,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:10,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:36:10,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:36:10,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-02-02 09:36:10,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:10,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:10,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-02-02 09:36:10,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:10,128 INFO L124 PetriNetUnfolderBase]: 96/324 cut-off events. [2024-02-02 09:36:10,129 INFO L125 PetriNetUnfolderBase]: For 185/187 co-relation queries the response was YES. [2024-02-02 09:36:10,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 324 events. 96/324 cut-off events. For 185/187 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1568 event pairs, 5 based on Foata normal form. 10/315 useless extension candidates. Maximal degree in co-relation 700. Up to 169 conditions per place. [2024-02-02 09:36:10,130 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 29 selfloop transitions, 3 changer transitions 2/47 dead transitions. [2024-02-02 09:36:10,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 221 flow [2024-02-02 09:36:10,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:36:10,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:36:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-02-02 09:36:10,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-02-02 09:36:10,131 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 165 flow. Second operand 4 states and 104 transitions. [2024-02-02 09:36:10,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 221 flow [2024-02-02 09:36:10,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 199 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-02-02 09:36:10,134 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 109 flow [2024-02-02 09:36:10,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-02-02 09:36:10,136 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-02-02 09:36:10,137 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 109 flow [2024-02-02 09:36:10,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:10,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:10,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:10,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:36:10,137 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-02-02 09:36:10,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:10,138 INFO L85 PathProgramCache]: Analyzing trace with hash 825636156, now seen corresponding path program 1 times [2024-02-02 09:36:10,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:10,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600610672] [2024-02-02 09:36:10,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:10,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:10,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:10,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600610672] [2024-02-02 09:36:10,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600610672] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:10,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:10,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 09:36:10,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035561640] [2024-02-02 09:36:10,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:10,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:36:10,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:10,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:36:10,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:36:10,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-02-02 09:36:10,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:10,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:10,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-02-02 09:36:10,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:10,326 INFO L124 PetriNetUnfolderBase]: 86/272 cut-off events. [2024-02-02 09:36:10,326 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-02-02 09:36:10,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 272 events. 86/272 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1166 event pairs, 5 based on Foata normal form. 12/271 useless extension candidates. Maximal degree in co-relation 578. Up to 148 conditions per place. [2024-02-02 09:36:10,327 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 34 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2024-02-02 09:36:10,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 211 flow [2024-02-02 09:36:10,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:36:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:36:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-02-02 09:36:10,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4818181818181818 [2024-02-02 09:36:10,329 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 109 flow. Second operand 5 states and 106 transitions. [2024-02-02 09:36:10,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 211 flow [2024-02-02 09:36:10,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 202 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-02 09:36:10,330 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 100 flow [2024-02-02 09:36:10,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2024-02-02 09:36:10,331 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-02-02 09:36:10,331 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 100 flow [2024-02-02 09:36:10,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:10,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:10,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:10,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:36:10,332 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-02-02 09:36:10,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:10,332 INFO L85 PathProgramCache]: Analyzing trace with hash -174097639, now seen corresponding path program 1 times [2024-02-02 09:36:10,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:10,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421355160] [2024-02-02 09:36:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:10,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:10,383 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:10,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:10,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421355160] [2024-02-02 09:36:10,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421355160] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:10,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:10,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 09:36:10,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001676418] [2024-02-02 09:36:10,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:10,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:36:10,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:10,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:36:10,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:36:10,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-02-02 09:36:10,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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:10,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:10,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-02-02 09:36:10,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:10,500 INFO L124 PetriNetUnfolderBase]: 89/251 cut-off events. [2024-02-02 09:36:10,500 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-02-02 09:36:10,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 251 events. 89/251 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1032 event pairs, 44 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 563. Up to 100 conditions per place. [2024-02-02 09:36:10,501 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 27 selfloop transitions, 5 changer transitions 15/55 dead transitions. [2024-02-02 09:36:10,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 242 flow [2024-02-02 09:36:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 09:36:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 09:36:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-02-02 09:36:10,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2024-02-02 09:36:10,503 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 100 flow. Second operand 6 states and 149 transitions. [2024-02-02 09:36:10,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 242 flow [2024-02-02 09:36:10,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 230 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-02-02 09:36:10,504 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 96 flow [2024-02-02 09:36:10,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2024-02-02 09:36:10,505 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2024-02-02 09:36:10,505 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 96 flow [2024-02-02 09:36:10,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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:10,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:10,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:10,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 09:36:10,506 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-02-02 09:36:10,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1635145435, now seen corresponding path program 1 times [2024-02-02 09:36:10,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:10,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818585801] [2024-02-02 09:36:10,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:10,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:10,544 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:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:10,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818585801] [2024-02-02 09:36:10,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818585801] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:10,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:10,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:36:10,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431029562] [2024-02-02 09:36:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:10,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:36:10,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:10,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:36:10,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:36:10,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 44 [2024-02-02 09:36:10,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:10,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:10,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 44 [2024-02-02 09:36:10,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:10,573 INFO L124 PetriNetUnfolderBase]: 23/113 cut-off events. [2024-02-02 09:36:10,573 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-02-02 09:36:10,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 113 events. 23/113 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs, 9 based on Foata normal form. 7/113 useless extension candidates. Maximal degree in co-relation 230. Up to 42 conditions per place. [2024-02-02 09:36:10,574 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 14 selfloop transitions, 4 changer transitions 2/34 dead transitions. [2024-02-02 09:36:10,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 141 flow [2024-02-02 09:36:10,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:36:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:36:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-02-02 09:36:10,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2024-02-02 09:36:10,575 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 96 flow. Second operand 3 states and 97 transitions. [2024-02-02 09:36:10,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 141 flow [2024-02-02 09:36:10,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 111 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-02-02 09:36:10,576 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 69 flow [2024-02-02 09:36:10,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-02-02 09:36:10,577 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2024-02-02 09:36:10,577 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 69 flow [2024-02-02 09:36:10,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:10,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:10,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:10,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-02 09:36:10,578 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-02-02 09:36:10,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:10,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1132596097, now seen corresponding path program 1 times [2024-02-02 09:36:10,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:10,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290452545] [2024-02-02 09:36:10,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:10,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:36:10,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:36:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:36:10,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:36:10,635 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:36:10,636 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr6ASSERT_VIOLATIONERROR_FUNCTION (22 of 23 remaining) [2024-02-02 09:36:10,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 23 remaining) [2024-02-02 09:36:10,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 23 remaining) [2024-02-02 09:36:10,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 23 remaining) [2024-02-02 09:36:10,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 23 remaining) [2024-02-02 09:36:10,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 23 remaining) [2024-02-02 09:36:10,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 23 remaining) [2024-02-02 09:36:10,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 23 remaining) [2024-02-02 09:36:10,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 23 remaining) [2024-02-02 09:36:10,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 23 remaining) [2024-02-02 09:36:10,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONERROR_FUNCTION (12 of 23 remaining) [2024-02-02 09:36:10,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 23 remaining) [2024-02-02 09:36:10,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 23 remaining) [2024-02-02 09:36:10,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 23 remaining) [2024-02-02 09:36:10,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 23 remaining) [2024-02-02 09:36:10,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 23 remaining) [2024-02-02 09:36:10,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 23 remaining) [2024-02-02 09:36:10,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 23 remaining) [2024-02-02 09:36:10,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 23 remaining) [2024-02-02 09:36:10,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 23 remaining) [2024-02-02 09:36:10,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 23 remaining) [2024-02-02 09:36:10,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 23 remaining) [2024-02-02 09:36:10,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 23 remaining) [2024-02-02 09:36:10,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-02 09:36:10,641 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:36:10,646 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:36:10,646 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:36:10,669 INFO L503 ceAbstractionStarter]: Automizer considered 11 witness invariants [2024-02-02 09:36:10,669 INFO L504 ceAbstractionStarter]: WitnessConsidered=11 [2024-02-02 09:36:10,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:36:10 BasicIcfg [2024-02-02 09:36:10,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:36:10,671 INFO L158 Benchmark]: Toolchain (without parser) took 3436.43ms. Allocated memory was 136.3MB in the beginning and 199.2MB in the end (delta: 62.9MB). Free memory was 107.7MB in the beginning and 79.2MB in the end (delta: 28.5MB). Peak memory consumption was 89.7MB. Max. memory is 16.1GB. [2024-02-02 09:36:10,671 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:36:10,671 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 136.3MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:36:10,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.83ms. Allocated memory was 136.3MB in the beginning and 199.2MB in the end (delta: 62.9MB). Free memory was 107.4MB in the beginning and 150.4MB in the end (delta: -43.0MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-02-02 09:36:10,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.22ms. Allocated memory is still 199.2MB. Free memory was 150.4MB in the beginning and 148.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:36:10,673 INFO L158 Benchmark]: Boogie Preprocessor took 41.91ms. Allocated memory is still 199.2MB. Free memory was 148.3MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:36:10,673 INFO L158 Benchmark]: RCFGBuilder took 453.16ms. Allocated memory is still 199.2MB. Free memory was 146.2MB in the beginning and 120.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-02-02 09:36:10,673 INFO L158 Benchmark]: TraceAbstraction took 2383.60ms. Allocated memory is still 199.2MB. Free memory was 120.0MB in the beginning and 79.2MB in the end (delta: 40.8MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2024-02-02 09:36:10,674 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.14ms. Allocated memory is still 136.3MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.11ms. Allocated memory is still 136.3MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 509.83ms. Allocated memory was 136.3MB in the beginning and 199.2MB in the end (delta: 62.9MB). Free memory was 107.4MB in the beginning and 150.4MB in the end (delta: -43.0MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.22ms. Allocated memory is still 199.2MB. Free memory was 150.4MB in the beginning and 148.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.91ms. Allocated memory is still 199.2MB. Free memory was 148.3MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 453.16ms. Allocated memory is still 199.2MB. Free memory was 146.2MB in the beginning and 120.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2383.60ms. Allocated memory is still 199.2MB. Free memory was 120.0MB in the beginning and 79.2MB in the end (delta: 40.8MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int glob1 = 0; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L697] 0 pthread_t id; VAL [glob1=0, id={5:0}, mutex1={3:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] [L698] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [glob1=0, id={5:0}, mutex1={3:0}] [L685] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L685] 1 int t = __VERIFIER_nondet_int(); [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L687] COND TRUE 1 t == 42 VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[42]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L688] 1 glob1 = 1 VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]]] [L690] 1 t = glob1 VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[1]]],BinaryExpression[COMPLEQ,IdentifierExpression[t],IntegerLiteral[1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[1]]]]]] [L691] CALL 1 __VERIFIER_assert(!(t == 1)) [L19] COND TRUE 1 !(cond) VAL [\old(cond)=0, cond=0, glob1=1, mutex1={3:0}] [L19] 1 reach_error() VAL [\old(cond)=0, cond=0, glob1=1, mutex1={3:0}] - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 685]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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. - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 73 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: 2.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 524 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 748 IncrementalHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 41 mSDtfsCounter, 748 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=5, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:10,696 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