./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_47-refine-protected2_true.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_47-refine-protected2_true.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3d25acf6 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_47-refine-protected2_true.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_47-refine-protected2_true.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-3d25acf-m [2024-01-30 14:21:50,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:21:50,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:21:50,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:21:50,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:21:50,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:21:50,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:21:50,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:21:50,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:21:50,420 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:21:50,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:21:50,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:21:50,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:21:50,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:21:50,423 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:21:50,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:21:50,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:21:50,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:21:50,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:21:50,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:21:50,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:21:50,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:21:50,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:21:50,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:21:50,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:21:50,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:21:50,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:21:50,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:21:50,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:21:50,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:21:50,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:21:50,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:21:50,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:21:50,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:21:50,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:21:50,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:21:50,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:21:50,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:21:50,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:21:50,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:21:50,429 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:21:50,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:21:50,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:21:50,429 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-30 14:21:50,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:21:50,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:21:50,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:21:50,639 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:21:50,640 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:21:50,640 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_47-refine-protected2_true.yml/witness.yml [2024-01-30 14:21:50,717 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:21:50,718 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:21:50,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_47-refine-protected2_true.i [2024-01-30 14:21:51,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:21:52,053 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:21:52,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_47-refine-protected2_true.i [2024-01-30 14:21:52,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19de6fbaa/7a430182e9ba42eb941196b944369709/FLAGf0768910a [2024-01-30 14:21:52,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19de6fbaa/7a430182e9ba42eb941196b944369709 [2024-01-30 14:21:52,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:21:52,079 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:21:52,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:21:52,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:21:52,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:21:52,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:21:50" (1/2) ... [2024-01-30 14:21:52,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355354b8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:21:52, skipping insertion in model container [2024-01-30 14:21:52,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:21:50" (1/2) ... [2024-01-30 14:21:52,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@42babf4f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:21:52, skipping insertion in model container [2024-01-30 14:21:52,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:21:52" (2/2) ... [2024-01-30 14:21:52,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355354b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52, skipping insertion in model container [2024-01-30 14:21:52,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:21:52" (2/2) ... [2024-01-30 14:21:52,090 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:21:52,123 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:21:52,125 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] g == 1 [2024-01-30 14:21:52,125 INFO L98 nessWitnessExtractor]: Location invariant before [L685-L685] (((0 <= g) && (g <= 1)) && ((unsigned long )arg == 0UL)) && (g == 0 || g == 1) [2024-01-30 14:21:52,125 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (g == 1) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:52,125 INFO L98 nessWitnessExtractor]: Location invariant before [L684-L684] (unsigned long )arg == 0UL [2024-01-30 14:21:52,125 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] ((0 <= g) && (g <= 1)) && (g == 0 || g == 1) [2024-01-30 14:21:52,126 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] g == 0 [2024-01-30 14:21:52,126 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((((0 <= g) && (g <= 1)) && (g == 0 || g == 1)) && (0 <= g)) && (g <= 1)) && (g == 0 || g == 1) [2024-01-30 14:21:52,126 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L696] ((0 <= g) && (g <= 1)) && (g == 0 || g == 1) [2024-01-30 14:21:52,126 INFO L98 nessWitnessExtractor]: Location invariant after [L693-L696] g == 0 [2024-01-30 14:21:52,127 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (unsigned long )arg == 0UL [2024-01-30 14:21:52,164 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:21:52,307 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_47-refine-protected2_true.i[1094,1107] [2024-01-30 14:21:52,457 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:21:52,477 INFO L202 MainTranslator]: Completed pre-run [2024-01-30 14:21:52,488 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_47-refine-protected2_true.i[1094,1107] [2024-01-30 14:21:52,489 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 [2024-01-30 14:21:52,559 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:21:52,586 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:21:52,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52 WrapperNode [2024-01-30 14:21:52,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:21:52,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:21:52,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:21:52,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:21:52,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52" (1/1) ... [2024-01-30 14:21:52,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52" (1/1) ... [2024-01-30 14:21:52,619 INFO L138 Inliner]: procedures = 163, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2024-01-30 14:21:52,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:21:52,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:21:52,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:21:52,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:21:52,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52" (1/1) ... [2024-01-30 14:21:52,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52" (1/1) ... [2024-01-30 14:21:52,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52" (1/1) ... [2024-01-30 14:21:52,640 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 5, 1]. 63 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 1 writes are split as follows [0, 0, 1]. [2024-01-30 14:21:52,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52" (1/1) ... [2024-01-30 14:21:52,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52" (1/1) ... [2024-01-30 14:21:52,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52" (1/1) ... [2024-01-30 14:21:52,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52" (1/1) ... [2024-01-30 14:21:52,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52" (1/1) ... [2024-01-30 14:21:52,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52" (1/1) ... [2024-01-30 14:21:52,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:21:52,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:21:52,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:21:52,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:21:52,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52" (1/1) ... [2024-01-30 14:21:52,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:21:52,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:21:52,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-30 14:21:52,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-30 14:21:52,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:21:52,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:21:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:21:52,928 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-30 14:21:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:21:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:21:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-30 14:21:52,929 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-30 14:21:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:21:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:21:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:21:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:21:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-30 14:21:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:21:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:21:52,931 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-30 14:21:53,086 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:21:53,088 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:21:53,288 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:21:53,288 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:21:53,368 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:21:53,368 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-30 14:21:53,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:21:53 BoogieIcfgContainer [2024-01-30 14:21:53,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:21:53,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:21:53,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:21:53,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:21:53,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:21:50" (1/4) ... [2024-01-30 14:21:53,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edfc863 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:21:53, skipping insertion in model container [2024-01-30 14:21:53,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:21:52" (2/4) ... [2024-01-30 14:21:53,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edfc863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:21:53, skipping insertion in model container [2024-01-30 14:21:53,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:52" (3/4) ... [2024-01-30 14:21:53,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edfc863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:21:53, skipping insertion in model container [2024-01-30 14:21:53,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:21:53" (4/4) ... [2024-01-30 14:21:53,378 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_47-refine-protected2_true.i [2024-01-30 14:21:53,392 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:21:53,392 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-01-30 14:21:53,392 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:21:53,441 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-30 14:21:53,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 90 flow [2024-01-30 14:21:53,499 INFO L124 PetriNetUnfolderBase]: 3/42 cut-off events. [2024-01-30 14:21:53,499 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:21:53,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 42 events. 3/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 93 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-01-30 14:21:53,502 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 90 flow [2024-01-30 14:21:53,506 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 42 transitions, 87 flow [2024-01-30 14:21:53,517 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:21:53,523 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;@63ae631b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:21:53,524 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-01-30 14:21:53,526 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:21:53,526 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:21:53,526 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:21:53,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:53,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:21:53,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 13 more)] === [2024-01-30 14:21:53,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:53,531 INFO L85 PathProgramCache]: Analyzing trace with hash 6951, now seen corresponding path program 1 times [2024-01-30 14:21:53,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:53,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327737040] [2024-01-30 14:21:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:53,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:21:53,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:53,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327737040] [2024-01-30 14:21:53,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327737040] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:53,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:53,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:21:53,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296937646] [2024-01-30 14:21:53,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:53,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:21:53,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:53,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:21:53,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:21:53,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2024-01-30 14:21:53,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:53,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:53,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2024-01-30 14:21:53,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:53,785 INFO L124 PetriNetUnfolderBase]: 60/222 cut-off events. [2024-01-30 14:21:53,786 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:21:53,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 222 events. 60/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1151 event pairs, 22 based on Foata normal form. 27/227 useless extension candidates. Maximal degree in co-relation 366. Up to 92 conditions per place. [2024-01-30 14:21:53,788 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 26 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2024-01-30 14:21:53,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 159 flow [2024-01-30 14:21:53,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:21:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:21:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-01-30 14:21:53,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2024-01-30 14:21:53,799 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 87 flow. Second operand 3 states and 96 transitions. [2024-01-30 14:21:53,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 159 flow [2024-01-30 14:21:53,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:21:53,803 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 114 flow [2024-01-30 14:21:53,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, 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=114, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2024-01-30 14:21:53,806 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-01-30 14:21:53,807 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 114 flow [2024-01-30 14:21:53,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:53,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:53,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-30 14:21:53,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:21:53,807 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 13 more)] === [2024-01-30 14:21:53,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash 207313129, now seen corresponding path program 1 times [2024-01-30 14:21:53,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:53,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490876855] [2024-01-30 14:21:53,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:53,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:53,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:21:53,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:53,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490876855] [2024-01-30 14:21:53,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490876855] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:53,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:53,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:21:53,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3543404] [2024-01-30 14:21:53,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:53,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:21:53,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:53,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:21:53,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:21:53,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 43 [2024-01-30 14:21:53,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:53,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:53,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 43 [2024-01-30 14:21:53,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:54,013 INFO L124 PetriNetUnfolderBase]: 49/201 cut-off events. [2024-01-30 14:21:54,013 INFO L125 PetriNetUnfolderBase]: For 37/39 co-relation queries the response was YES. [2024-01-30 14:21:54,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 201 events. 49/201 cut-off events. For 37/39 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 992 event pairs, 27 based on Foata normal form. 7/196 useless extension candidates. Maximal degree in co-relation 362. Up to 101 conditions per place. [2024-01-30 14:21:54,017 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 21 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2024-01-30 14:21:54,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 170 flow [2024-01-30 14:21:54,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:21:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:21:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-01-30 14:21:54,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2024-01-30 14:21:54,022 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 114 flow. Second operand 4 states and 116 transitions. [2024-01-30 14:21:54,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 170 flow [2024-01-30 14:21:54,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:21:54,027 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 106 flow [2024-01-30 14:21:54,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=102, 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=106, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-01-30 14:21:54,034 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-01-30 14:21:54,034 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 106 flow [2024-01-30 14:21:54,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:54,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:54,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:54,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:21:54,035 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 13 more)] === [2024-01-30 14:21:54,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:54,035 INFO L85 PathProgramCache]: Analyzing trace with hash -97320164, now seen corresponding path program 1 times [2024-01-30 14:21:54,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:54,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369387799] [2024-01-30 14:21:54,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:54,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:21:54,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:54,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369387799] [2024-01-30 14:21:54,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369387799] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:54,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:54,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:21:54,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187867379] [2024-01-30 14:21:54,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:54,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:21:54,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:54,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:21:54,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:21:54,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-01-30 14:21:54,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:54,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:54,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-01-30 14:21:54,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:54,266 INFO L124 PetriNetUnfolderBase]: 73/252 cut-off events. [2024-01-30 14:21:54,267 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-01-30 14:21:54,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 252 events. 73/252 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1304 event pairs, 22 based on Foata normal form. 8/241 useless extension candidates. Maximal degree in co-relation 496. Up to 92 conditions per place. [2024-01-30 14:21:54,268 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 33 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2024-01-30 14:21:54,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 214 flow [2024-01-30 14:21:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:21:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:21:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-01-30 14:21:54,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-01-30 14:21:54,270 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 106 flow. Second operand 4 states and 96 transitions. [2024-01-30 14:21:54,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 214 flow [2024-01-30 14:21:54,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:21:54,271 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 122 flow [2024-01-30 14:21:54,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=101, 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=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2024-01-30 14:21:54,272 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-01-30 14:21:54,272 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 122 flow [2024-01-30 14:21:54,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:54,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:54,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:54,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:21:54,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 13 more)] === [2024-01-30 14:21:54,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1278042444, now seen corresponding path program 1 times [2024-01-30 14:21:54,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:54,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051224618] [2024-01-30 14:21:54,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:54,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:21:54,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:54,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051224618] [2024-01-30 14:21:54,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051224618] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:54,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:54,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:21:54,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038364791] [2024-01-30 14:21:54,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:54,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:21:54,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:54,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:21:54,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:21:54,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-01-30 14:21:54,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:54,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:54,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-01-30 14:21:54,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:54,394 INFO L124 PetriNetUnfolderBase]: 50/159 cut-off events. [2024-01-30 14:21:54,394 INFO L125 PetriNetUnfolderBase]: For 81/84 co-relation queries the response was YES. [2024-01-30 14:21:54,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 159 events. 50/159 cut-off events. For 81/84 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 626 event pairs, 12 based on Foata normal form. 25/177 useless extension candidates. Maximal degree in co-relation 345. Up to 65 conditions per place. [2024-01-30 14:21:54,395 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 21 selfloop transitions, 2 changer transitions 9/44 dead transitions. [2024-01-30 14:21:54,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 181 flow [2024-01-30 14:21:54,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:21:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:21:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-01-30 14:21:54,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.563953488372093 [2024-01-30 14:21:54,397 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 122 flow. Second operand 4 states and 97 transitions. [2024-01-30 14:21:54,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 181 flow [2024-01-30 14:21:54,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 171 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-30 14:21:54,398 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 75 flow [2024-01-30 14:21:54,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=75, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2024-01-30 14:21:54,399 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2024-01-30 14:21:54,399 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 75 flow [2024-01-30 14:21:54,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:54,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:54,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:54,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:21:54,400 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 13 more)] === [2024-01-30 14:21:54,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:54,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1212577191, now seen corresponding path program 1 times [2024-01-30 14:21:54,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:54,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743222906] [2024-01-30 14:21:54,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:54,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:21:54,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:54,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743222906] [2024-01-30 14:21:54,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743222906] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:54,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:54,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:21:54,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069102275] [2024-01-30 14:21:54,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:54,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:21:54,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:54,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:21:54,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:21:54,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-01-30 14:21:54,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:54,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:54,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-01-30 14:21:54,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:54,579 INFO L124 PetriNetUnfolderBase]: 37/105 cut-off events. [2024-01-30 14:21:54,582 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-01-30 14:21:54,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 105 events. 37/105 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 326 event pairs, 9 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 224. Up to 47 conditions per place. [2024-01-30 14:21:54,585 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 19 selfloop transitions, 8 changer transitions 0/33 dead transitions. [2024-01-30 14:21:54,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 33 transitions, 145 flow [2024-01-30 14:21:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:21:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:21:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-01-30 14:21:54,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2024-01-30 14:21:54,592 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 75 flow. Second operand 5 states and 105 transitions. [2024-01-30 14:21:54,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 33 transitions, 145 flow [2024-01-30 14:21:54,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 141 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:21:54,594 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 87 flow [2024-01-30 14:21:54,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2024-01-30 14:21:54,594 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -9 predicate places. [2024-01-30 14:21:54,596 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 87 flow [2024-01-30 14:21:54,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:54,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:54,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:54,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:21:54,597 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 13 more)] === [2024-01-30 14:21:54,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:54,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1081500617, now seen corresponding path program 1 times [2024-01-30 14:21:54,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:54,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057830597] [2024-01-30 14:21:54,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:54,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:21:54,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:54,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057830597] [2024-01-30 14:21:54,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057830597] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:54,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:54,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:21:54,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908260600] [2024-01-30 14:21:54,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:54,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:21:54,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:54,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:21:54,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:21:54,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 43 [2024-01-30 14:21:54,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:54,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:54,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 43 [2024-01-30 14:21:54,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:54,699 INFO L124 PetriNetUnfolderBase]: 7/48 cut-off events. [2024-01-30 14:21:54,700 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-30 14:21:54,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 48 events. 7/48 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 2 based on Foata normal form. 5/51 useless extension candidates. Maximal degree in co-relation 90. Up to 18 conditions per place. [2024-01-30 14:21:54,700 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 10 selfloop transitions, 3 changer transitions 3/26 dead transitions. [2024-01-30 14:21:54,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 110 flow [2024-01-30 14:21:54,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:21:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:21:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-01-30 14:21:54,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7364341085271318 [2024-01-30 14:21:54,703 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 87 flow. Second operand 3 states and 95 transitions. [2024-01-30 14:21:54,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 110 flow [2024-01-30 14:21:54,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 96 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-01-30 14:21:54,705 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2024-01-30 14:21:54,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2024-01-30 14:21:54,707 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -11 predicate places. [2024-01-30 14:21:54,708 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2024-01-30 14:21:54,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:54,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:54,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:54,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:21:54,708 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 13 more)] === [2024-01-30 14:21:54,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:54,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1357404471, now seen corresponding path program 1 times [2024-01-30 14:21:54,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:54,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116099775] [2024-01-30 14:21:54,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:54,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:21:54,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:21:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:21:54,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:21:54,761 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:21:54,761 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 16 remaining) [2024-01-30 14:21:54,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 16 remaining) [2024-01-30 14:21:54,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 16 remaining) [2024-01-30 14:21:54,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 16 remaining) [2024-01-30 14:21:54,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2024-01-30 14:21:54,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2024-01-30 14:21:54,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 16 remaining) [2024-01-30 14:21:54,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2024-01-30 14:21:54,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 16 remaining) [2024-01-30 14:21:54,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 16 remaining) [2024-01-30 14:21:54,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 16 remaining) [2024-01-30 14:21:54,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 16 remaining) [2024-01-30 14:21:54,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 16 remaining) [2024-01-30 14:21:54,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 16 remaining) [2024-01-30 14:21:54,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 16 remaining) [2024-01-30 14:21:54,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 16 remaining) [2024-01-30 14:21:54,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:21:54,767 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:54,774 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:21:54,774 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:21:54,806 INFO L503 ceAbstractionStarter]: Automizer considered 9 witness invariants [2024-01-30 14:21:54,806 INFO L504 ceAbstractionStarter]: WitnessConsidered=9 [2024-01-30 14:21:54,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:21:54 BasicIcfg [2024-01-30 14:21:54,807 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:21:54,809 INFO L158 Benchmark]: Toolchain (without parser) took 2728.58ms. Allocated memory is still 178.3MB. Free memory was 102.9MB in the beginning and 70.4MB in the end (delta: 32.5MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2024-01-30 14:21:54,810 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 115.3MB. Free memory was 77.9MB in the beginning and 77.8MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:21:54,810 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:21:54,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.50ms. Allocated memory is still 178.3MB. Free memory was 102.6MB in the beginning and 80.3MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-30 14:21:54,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.45ms. Allocated memory is still 178.3MB. Free memory was 80.3MB in the beginning and 78.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:21:54,811 INFO L158 Benchmark]: Boogie Preprocessor took 29.44ms. Allocated memory is still 178.3MB. Free memory was 78.3MB in the beginning and 76.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:21:54,811 INFO L158 Benchmark]: RCFGBuilder took 720.82ms. Allocated memory is still 178.3MB. Free memory was 76.2MB in the beginning and 136.9MB in the end (delta: -60.7MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-01-30 14:21:54,811 INFO L158 Benchmark]: TraceAbstraction took 1435.16ms. Allocated memory is still 178.3MB. Free memory was 136.5MB in the beginning and 70.4MB in the end (delta: 66.1MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2024-01-30 14:21:54,813 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 115.3MB. Free memory was 77.9MB in the beginning and 77.8MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 507.50ms. Allocated memory is still 178.3MB. Free memory was 102.6MB in the beginning and 80.3MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.45ms. Allocated memory is still 178.3MB. Free memory was 80.3MB in the beginning and 78.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.44ms. Allocated memory is still 178.3MB. Free memory was 78.3MB in the beginning and 76.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 720.82ms. Allocated memory is still 178.3MB. Free memory was 76.2MB in the beginning and 136.9MB in the end (delta: -60.7MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1435.16ms. Allocated memory is still 178.3MB. Free memory was 136.5MB in the beginning and 70.4MB in the end (delta: 66.1MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 693]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L681] 0 int g = 0; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L690] 0 pthread_t id; VAL [A={3:0}, g=0, id={5:0}] [L691] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]]]] [L691] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, arg={0:0}, g=0, id={5:0}] [L684] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [A={3:0}, arg={0:0}, arg={0:0}, g=0] [L685] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[1]]]]]] [L685] 1 g = 1 VAL [A={3:0}, arg={0:0}, arg={0:0}, g=1] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [A={3:0}, arg={0:0}, arg={0:0}, g=1] [L693] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[1]]]]]] VAL [A={3:0}, arg={0:0}, arg={0:0}, g=1, id={5:0}] [L693] COND TRUE 0 \read(g) VAL [A={3:0}, arg={0:0}, arg={0:0}, g=1, id={5:0}] [L694] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[1]]]] [L694] CALL 0 __VERIFIER_assert(g) [L19] COND FALSE 0 !(!(cond)) VAL [A={3:0}, \old(cond)=1, arg={0:0}, arg={0:0}, cond=1, g=1] [L694] RET 0 __VERIFIER_assert(g) [L693] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]]]] VAL [A={3:0}, arg={0:0}, arg={0:0}, g=1, id={5:0}] - 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: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 697]: 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 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: 684]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 56 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 237 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 313 IncrementalHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 28 mSDtfsCounter, 313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=3, InterpolantAutomatonStates: 23, 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.4s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 181 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-30 14:21:54,834 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