./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-1_3-join.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/race-1_3-join.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec 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/ldv-races/race-1_3-join.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/race-1_3-join.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-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:31:18,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:31:18,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:31:18,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:31:18,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:31:18,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:31:18,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:31:18,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:31:18,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:31:18,936 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:31:18,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:31:18,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:31:18,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:31:18,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:31:18,938 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:31:18,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:31:18,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:31:18,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:31:18,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:31:18,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:31:18,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:31:18,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:31:18,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:31:18,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:31:18,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:31:18,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:31:18,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:31:18,941 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:31:18,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:31:18,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:31:18,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:31:18,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:31:18,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:31:18,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:31:18,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:31:18,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:31:18,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:31:18,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:31:18,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:31:18,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:31:18,945 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:31:18,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:31:18,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:31:18,945 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-07 19:31:19,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:31:19,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:31:19,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:31:19,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:31:19,227 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:31:19,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-1_3-join.i [2024-02-07 19:31:20,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:31:20,508 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:31:20,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_3-join.i [2024-02-07 19:31:20,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af2de9f9/71c341e095d0410ca1abda2afa19f9cb/FLAG8a25f3f83 [2024-02-07 19:31:20,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af2de9f9/71c341e095d0410ca1abda2afa19f9cb [2024-02-07 19:31:20,538 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:31:20,538 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:31:20,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/race-1_3-join.yml/witness.yml [2024-02-07 19:31:20,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:31:20,606 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:31:20,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:31:20,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:31:20,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:31:20,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:31:20" (1/2) ... [2024-02-07 19:31:20,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed78ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:20, skipping insertion in model container [2024-02-07 19:31:20,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:31:20" (1/2) ... [2024-02-07 19:31:20,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5019c6d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:20, skipping insertion in model container [2024-02-07 19:31:20,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:31:20" (2/2) ... [2024-02-07 19:31:20,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed78ce5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:20, skipping insertion in model container [2024-02-07 19:31:20,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:31:20" (2/2) ... [2024-02-07 19:31:20,615 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:31:20,699 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:31:20,701 INFO L76 edCorrectnessWitness]: Location invariant before [L1716-L1716] pdev == 3 [2024-02-07 19:31:20,701 INFO L76 edCorrectnessWitness]: Location invariant before [L1726-L1726] (((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-02-07 19:31:20,701 INFO L76 edCorrectnessWitness]: Location invariant before [L1703-L1703] (((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-02-07 19:31:20,701 INFO L76 edCorrectnessWitness]: Location invariant before [L1724-L1724] (((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-02-07 19:31:20,701 INFO L76 edCorrectnessWitness]: Location invariant before [L1695-L1695] (expression == 1 || ((0 <= expression && expression <= 1) && (expression == 0 || expression == 1))) || ((0 <= expression && expression <= 1) && (expression == 0 || expression == 1)) [2024-02-07 19:31:20,702 INFO L76 edCorrectnessWitness]: Location invariant before [L1729-L1729] (unsigned long )status == 0UL [2024-02-07 19:31:20,702 INFO L76 edCorrectnessWitness]: Location invariant before [L1710-L1710] pdev == 1 [2024-02-07 19:31:20,702 INFO L76 edCorrectnessWitness]: Location invariant before [L1731-L1731] (((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-02-07 19:31:20,751 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:31:21,261 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_3-join.i[76153,76166] [2024-02-07 19:31:21,294 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:31:21,315 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:31:21,423 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_3-join.i[76153,76166] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:31:21,448 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:31:21,509 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:31:21,509 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:21 WrapperNode [2024-02-07 19:31:21,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:31:21,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:31:21,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:31:21,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:31:21,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:21" (1/1) ... [2024-02-07 19:31:21,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:21" (1/1) ... [2024-02-07 19:31:21,552 INFO L138 Inliner]: procedures = 483, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-02-07 19:31:21,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:31:21,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:31:21,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:31:21,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:31:21,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:21" (1/1) ... [2024-02-07 19:31:21,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:21" (1/1) ... [2024-02-07 19:31:21,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:21" (1/1) ... [2024-02-07 19:31:21,586 INFO L175 MemorySlicer]: Split 12 memory accesses to 4 slices as follows [2, 3, 5, 2]. 42 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 1, 5, 0]. The 2 writes are split as follows [0, 1, 0, 1]. [2024-02-07 19:31:21,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:21" (1/1) ... [2024-02-07 19:31:21,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:21" (1/1) ... [2024-02-07 19:31:21,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:21" (1/1) ... [2024-02-07 19:31:21,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:21" (1/1) ... [2024-02-07 19:31:21,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:21" (1/1) ... [2024-02-07 19:31:21,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:21" (1/1) ... [2024-02-07 19:31:21,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:31:21,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:31:21,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:31:21,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:31:21,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:21" (1/1) ... [2024-02-07 19:31:21,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:31:21,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:31:21,786 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-07 19:31:21,828 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-07 19:31:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:31:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:31:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:31:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 19:31:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 19:31:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 19:31:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 19:31:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-07 19:31:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:31:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-02-07 19:31:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-02-07 19:31:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-02-07 19:31:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-02-07 19:31:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:31:21,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:31:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:31:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-02-07 19:31:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-02-07 19:31:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-02-07 19:31:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-02-07 19:31:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-07 19:31:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 19:31:21,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 19:31:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:31:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:31:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:31:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:31:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:31:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:31:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:31:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:31:21,863 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 19:31:22,109 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:31:22,111 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:31:22,312 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:31:22,312 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:31:22,408 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:31:22,408 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 19:31:22,409 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:31:22 BoogieIcfgContainer [2024-02-07 19:31:22,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:31:22,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:31:22,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:31:22,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:31:22,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:31:20" (1/4) ... [2024-02-07 19:31:22,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fb46bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:31:22, skipping insertion in model container [2024-02-07 19:31:22,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:31:20" (2/4) ... [2024-02-07 19:31:22,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fb46bc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:31:22, skipping insertion in model container [2024-02-07 19:31:22,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:21" (3/4) ... [2024-02-07 19:31:22,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fb46bc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:31:22, skipping insertion in model container [2024-02-07 19:31:22,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:31:22" (4/4) ... [2024-02-07 19:31:22,418 INFO L112 eAbstractionObserver]: Analyzing ICFG race-1_3-join.i [2024-02-07 19:31:22,434 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:31:22,434 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-02-07 19:31:22,434 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:31:22,471 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-02-07 19:31:22,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 55 transitions, 117 flow [2024-02-07 19:31:22,531 INFO L124 PetriNetUnfolderBase]: 4/65 cut-off events. [2024-02-07 19:31:22,532 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-07 19:31:22,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 65 events. 4/65 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 140 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 32. Up to 3 conditions per place. [2024-02-07 19:31:22,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 55 transitions, 117 flow [2024-02-07 19:31:22,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 51 transitions, 108 flow [2024-02-07 19:31:22,547 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:31:22,554 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;@7bbf5869, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:31:22,554 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-02-07 19:31:22,556 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:31:22,556 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 19:31:22,556 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:31:22,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:22,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 19:31:22,557 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-07 19:31:22,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:22,562 INFO L85 PathProgramCache]: Analyzing trace with hash 10335, now seen corresponding path program 1 times [2024-02-07 19:31:22,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:22,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737546030] [2024-02-07 19:31:22,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:22,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:22,832 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-07 19:31:22,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:22,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737546030] [2024-02-07 19:31:22,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737546030] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:31:22,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:31:22,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:31:22,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118654451] [2024-02-07 19:31:22,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:31:22,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:31:22,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:22,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:31:22,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:31:22,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-02-07 19:31:22,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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-07 19:31:22,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:22,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-02-07 19:31:22,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:23,012 INFO L124 PetriNetUnfolderBase]: 36/130 cut-off events. [2024-02-07 19:31:23,012 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-07 19:31:23,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 130 events. 36/130 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 446 event pairs, 13 based on Foata normal form. 2/106 useless extension candidates. Maximal degree in co-relation 177. Up to 86 conditions per place. [2024-02-07 19:31:23,015 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 26 selfloop transitions, 4 changer transitions 4/53 dead transitions. [2024-02-07 19:31:23,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 180 flow [2024-02-07 19:31:23,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:31:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:31:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-02-07 19:31:23,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-02-07 19:31:23,027 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 108 flow. Second operand 3 states and 105 transitions. [2024-02-07 19:31:23,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 180 flow [2024-02-07 19:31:23,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:31:23,035 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 108 flow [2024-02-07 19:31:23,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2024-02-07 19:31:23,039 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-02-07 19:31:23,040 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 108 flow [2024-02-07 19:31:23,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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-07 19:31:23,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:23,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-07 19:31:23,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:31:23,041 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-07 19:31:23,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:23,042 INFO L85 PathProgramCache]: Analyzing trace with hash 320686, now seen corresponding path program 1 times [2024-02-07 19:31:23,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:23,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129969220] [2024-02-07 19:31:23,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:23,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:23,177 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-07 19:31:23,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:23,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129969220] [2024-02-07 19:31:23,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129969220] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:31:23,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:31:23,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:31:23,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503593636] [2024-02-07 19:31:23,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:31:23,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:31:23,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:23,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:31:23,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:31:23,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2024-02-07 19:31:23,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 108 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-02-07 19:31:23,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:23,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2024-02-07 19:31:23,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:23,273 INFO L124 PetriNetUnfolderBase]: 28/104 cut-off events. [2024-02-07 19:31:23,273 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-02-07 19:31:23,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 104 events. 28/104 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 322 event pairs, 11 based on Foata normal form. 4/94 useless extension candidates. Maximal degree in co-relation 67. Up to 73 conditions per place. [2024-02-07 19:31:23,274 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 24 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-02-07 19:31:23,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 168 flow [2024-02-07 19:31:23,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:31:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:31:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-02-07 19:31:23,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4036363636363636 [2024-02-07 19:31:23,276 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 108 flow. Second operand 5 states and 111 transitions. [2024-02-07 19:31:23,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 168 flow [2024-02-07 19:31:23,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:31:23,278 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 108 flow [2024-02-07 19:31:23,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-02-07 19:31:23,278 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -8 predicate places. [2024-02-07 19:31:23,279 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 108 flow [2024-02-07 19:31:23,279 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-02-07 19:31:23,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:23,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:31:23,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:31:23,280 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-07 19:31:23,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:23,280 INFO L85 PathProgramCache]: Analyzing trace with hash -183035071, now seen corresponding path program 1 times [2024-02-07 19:31:23,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:23,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450152267] [2024-02-07 19:31:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:23,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:23,316 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-07 19:31:23,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:23,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450152267] [2024-02-07 19:31:23,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450152267] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:31:23,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:31:23,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:31:23,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550279483] [2024-02-07 19:31:23,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:31:23,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:31:23,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:23,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:31:23,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:31:23,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-02-07 19:31:23,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-07 19:31:23,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:23,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-02-07 19:31:23,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:23,367 INFO L124 PetriNetUnfolderBase]: 28/103 cut-off events. [2024-02-07 19:31:23,367 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-02-07 19:31:23,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 103 events. 28/103 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 317 event pairs, 24 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 94. Up to 81 conditions per place. [2024-02-07 19:31:23,368 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2024-02-07 19:31:23,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 170 flow [2024-02-07 19:31:23,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:31:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:31:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-02-07 19:31:23,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5636363636363636 [2024-02-07 19:31:23,370 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 108 flow. Second operand 3 states and 93 transitions. [2024-02-07 19:31:23,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 170 flow [2024-02-07 19:31:23,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 156 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-07 19:31:23,372 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 104 flow [2024-02-07 19:31:23,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2024-02-07 19:31:23,372 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2024-02-07 19:31:23,373 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 104 flow [2024-02-07 19:31:23,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-07 19:31:23,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:23,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:31:23,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:31:23,373 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-07 19:31:23,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1569904211, now seen corresponding path program 1 times [2024-02-07 19:31:23,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:23,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274666667] [2024-02-07 19:31:23,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:23,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:23,448 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-07 19:31:23,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:23,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274666667] [2024-02-07 19:31:23,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274666667] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:31:23,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:31:23,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:31:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305718910] [2024-02-07 19:31:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:31:23,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:31:23,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:23,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:31:23,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:31:23,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-02-07 19:31:23,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-07 19:31:23,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:23,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-02-07 19:31:23,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:23,502 INFO L124 PetriNetUnfolderBase]: 26/104 cut-off events. [2024-02-07 19:31:23,502 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-02-07 19:31:23,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 104 events. 26/104 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 299 event pairs, 16 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 190. Up to 64 conditions per place. [2024-02-07 19:31:23,503 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 25 selfloop transitions, 5 changer transitions 6/46 dead transitions. [2024-02-07 19:31:23,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 187 flow [2024-02-07 19:31:23,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:31:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:31:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-02-07 19:31:23,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-02-07 19:31:23,505 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 104 flow. Second operand 3 states and 100 transitions. [2024-02-07 19:31:23,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 187 flow [2024-02-07 19:31:23,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 183 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 19:31:23,507 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 114 flow [2024-02-07 19:31:23,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-02-07 19:31:23,507 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2024-02-07 19:31:23,508 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 114 flow [2024-02-07 19:31:23,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-07 19:31:23,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:23,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:31:23,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:31:23,509 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-07 19:31:23,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1732883600, now seen corresponding path program 1 times [2024-02-07 19:31:23,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:23,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657062248] [2024-02-07 19:31:23,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:23,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:23,579 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-07 19:31:23,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:23,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657062248] [2024-02-07 19:31:23,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657062248] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:31:23,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:31:23,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:31:23,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451351233] [2024-02-07 19:31:23,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:31:23,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:31:23,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:23,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:31:23,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:31:23,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-02-07 19:31:23,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-07 19:31:23,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:23,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-02-07 19:31:23,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:23,636 INFO L124 PetriNetUnfolderBase]: 21/86 cut-off events. [2024-02-07 19:31:23,636 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-02-07 19:31:23,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 86 events. 21/86 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 215 event pairs, 7 based on Foata normal form. 3/86 useless extension candidates. Maximal degree in co-relation 144. Up to 38 conditions per place. [2024-02-07 19:31:23,637 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 26 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2024-02-07 19:31:23,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 179 flow [2024-02-07 19:31:23,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:31:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:31:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-02-07 19:31:23,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2024-02-07 19:31:23,639 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 114 flow. Second operand 3 states and 97 transitions. [2024-02-07 19:31:23,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 179 flow [2024-02-07 19:31:23,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 167 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-07 19:31:23,640 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 100 flow [2024-02-07 19:31:23,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=3, PETRI_FLOW=100, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2024-02-07 19:31:23,641 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -14 predicate places. [2024-02-07 19:31:23,641 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 100 flow [2024-02-07 19:31:23,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-07 19:31:23,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:23,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:31:23,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:31:23,642 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-07 19:31:23,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:23,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2117868852, now seen corresponding path program 1 times [2024-02-07 19:31:23,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:23,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221715243] [2024-02-07 19:31:23,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:23,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:31:23,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:31:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:31:23,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:31:23,686 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:31:23,687 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2024-02-07 19:31:23,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 17 remaining) [2024-02-07 19:31:23,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 17 remaining) [2024-02-07 19:31:23,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 17 remaining) [2024-02-07 19:31:23,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2024-02-07 19:31:23,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 17 remaining) [2024-02-07 19:31:23,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 17 remaining) [2024-02-07 19:31:23,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2024-02-07 19:31:23,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 17 remaining) [2024-02-07 19:31:23,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 17 remaining) [2024-02-07 19:31:23,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 17 remaining) [2024-02-07 19:31:23,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 17 remaining) [2024-02-07 19:31:23,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 17 remaining) [2024-02-07 19:31:23,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 17 remaining) [2024-02-07 19:31:23,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2024-02-07 19:31:23,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 17 remaining) [2024-02-07 19:31:23,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 17 remaining) [2024-02-07 19:31:23,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:31:23,692 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-02-07 19:31:23,696 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:31:23,696 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:31:23,713 INFO L503 ceAbstractionStarter]: Automizer considered 11 witness invariants [2024-02-07 19:31:23,714 INFO L504 ceAbstractionStarter]: WitnessConsidered=11 [2024-02-07 19:31:23,714 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:31:23 BasicIcfg [2024-02-07 19:31:23,714 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:31:23,715 INFO L158 Benchmark]: Toolchain (without parser) took 3108.66ms. Allocated memory was 172.0MB in the beginning and 295.7MB in the end (delta: 123.7MB). Free memory was 123.3MB in the beginning and 236.9MB in the end (delta: -113.6MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-02-07 19:31:23,715 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:31:23,715 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 172.0MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:31:23,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 902.93ms. Allocated memory is still 172.0MB. Free memory was 123.0MB in the beginning and 100.4MB in the end (delta: 22.5MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-02-07 19:31:23,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.43ms. Allocated memory is still 172.0MB. Free memory was 100.4MB in the beginning and 97.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:31:23,716 INFO L158 Benchmark]: Boogie Preprocessor took 122.24ms. Allocated memory is still 172.0MB. Free memory was 97.5MB in the beginning and 134.3MB in the end (delta: -36.8MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-02-07 19:31:23,716 INFO L158 Benchmark]: RCFGBuilder took 700.76ms. Allocated memory is still 172.0MB. Free memory was 134.0MB in the beginning and 94.5MB in the end (delta: 39.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-02-07 19:31:23,717 INFO L158 Benchmark]: TraceAbstraction took 1302.54ms. Allocated memory was 172.0MB in the beginning and 295.7MB in the end (delta: 123.7MB). Free memory was 94.5MB in the beginning and 236.9MB in the end (delta: -142.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:31:23,718 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 172.0MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 902.93ms. Allocated memory is still 172.0MB. Free memory was 123.0MB in the beginning and 100.4MB in the end (delta: 22.5MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.43ms. Allocated memory is still 172.0MB. Free memory was 100.4MB in the beginning and 97.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 122.24ms. Allocated memory is still 172.0MB. Free memory was 97.5MB in the beginning and 134.3MB in the end (delta: -36.8MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * RCFGBuilder took 700.76ms. Allocated memory is still 172.0MB. Free memory was 134.0MB in the beginning and 94.5MB in the end (delta: 39.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1302.54ms. Allocated memory was 172.0MB in the beginning and 295.7MB in the end (delta: 123.7MB). Free memory was 94.5MB in the beginning and 236.9MB in the end (delta: -142.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1695]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1696] 0 pthread_t t1; [L1696] 0 pthread_t t1; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1698] 0 int pdev; [L1734] CALL, EXPR 0 module_init() [L1709] 0 pdev = 1 VAL [mutex={4:0}, pdev=1, t1={3:0}] [L1710] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]]]] [L1710] CALL 0 ldv_assert(pdev==1) [L1695] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[1]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[expression]],BinaryExpression[COMPLEQ,IdentifierExpression[expression],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[1]]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[expression]],BinaryExpression[COMPLEQ,IdentifierExpression[expression],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[1]]]]]]] VAL [\old(expression)=1, expression=1, mutex={4:0}, pdev=1, t1={3:0}] [L1695] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, mutex={4:0}, pdev=1, t1={3:0}] [L1710] RET 0 ldv_assert(pdev==1) [L1711] COND TRUE 0 __VERIFIER_nondet_int() [L1712] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread1, ((void *)0)) VAL [arg={0:0}, mutex={4:0}, pdev=1, t1={3:0}] [L1713] 0 return 0; VAL [\result=0, arg={0:0}, arg={0:0}, mutex={4:0}, pdev=1, t1={3:0}] [L1734] RET, EXPR 0 module_init() [L1734] COND FALSE 0 !(module_init()!=0) [L1735] CALL 0 module_exit() [L1721] 0 void *status; VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=1, status={5:0}, t1={3:0}] [L1723] 0 pdev = 4 [L1724] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=4, status={5:0}, t1={3:0}] [L1702] 1 pdev = 6 [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=6, t1={3:0}] [L1726] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] [L1726] CALL 0 ldv_assert(pdev==4) [L1695] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[1]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[expression]],BinaryExpression[COMPLEQ,IdentifierExpression[expression],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[1]]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[expression]],BinaryExpression[COMPLEQ,IdentifierExpression[expression],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[1]]]]]]] [L1695] COND TRUE 0 !expression [L1695] 0 reach_error() VAL [\old(expression)=0, arg={0:0}, arg={0:0}, expression=0, mutex={4:0}, pdev=6, t1={3:0}] - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: 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: 1716]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: 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: 1724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1729]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1731]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: 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: 1712]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 60 locations, 17 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.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 301 IncrementalHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 2 mSDtfsCounter, 301 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=4, InterpolantAutomatonStates: 17, 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.3s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-07 19:31:23,753 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