/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:53:11,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:53:11,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:53:11,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:53:11,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:53:11,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:53:11,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:53:11,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:53:11,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:53:11,675 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:53:11,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:53:11,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:53:11,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:53:11,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:53:11,676 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:53:11,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:53:11,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:53:11,677 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:53:11,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:53:11,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:53:11,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:53:11,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:53:11,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:53:11,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:53:11,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:53:11,679 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:53:11,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:53:11,679 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:53:11,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:53:11,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:53:11,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:53:11,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:53:11,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:53:11,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:53:11,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:53:11,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:53:11,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:53:11,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:53:11,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:53:11,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:53:11,682 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:53:11,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:53:11,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:53:11,693 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: Use bitabs translation -> true [2023-12-15 21:53:11,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:53:11,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:53:11,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:53:11,904 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:53:11,905 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:53:11,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i [2023-12-15 21:53:13,018 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:53:13,207 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:53:13,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i [2023-12-15 21:53:13,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adb430a1e/b87aad4e5dda460eab2c7c50fc3e4294/FLAG3f1461062 [2023-12-15 21:53:13,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adb430a1e/b87aad4e5dda460eab2c7c50fc3e4294 [2023-12-15 21:53:13,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:53:13,237 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:53:13,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:53:13,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:53:13,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:53:13,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:53:13" (1/1) ... [2023-12-15 21:53:13,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7176f83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13, skipping insertion in model container [2023-12-15 21:53:13,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:53:13" (1/1) ... [2023-12-15 21:53:13,288 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:53:13,591 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-sets/test_mutex_unlock_at_exit.i[25842,25855] [2023-12-15 21:53:13,595 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-sets/test_mutex_unlock_at_exit.i[25967,25980] [2023-12-15 21:53:13,602 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-sets/test_mutex_unlock_at_exit.i[26082,26095] [2023-12-15 21:53:13,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:53:13,614 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:53:13,668 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-sets/test_mutex_unlock_at_exit.i[25842,25855] [2023-12-15 21:53:13,669 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-sets/test_mutex_unlock_at_exit.i[25967,25980] [2023-12-15 21:53:13,669 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-sets/test_mutex_unlock_at_exit.i[26082,26095] [2023-12-15 21:53:13,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:53:13,694 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:53:13,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13 WrapperNode [2023-12-15 21:53:13,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:53:13,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:53:13,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:53:13,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:53:13,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13" (1/1) ... [2023-12-15 21:53:13,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13" (1/1) ... [2023-12-15 21:53:13,731 INFO L138 Inliner]: procedures = 139, calls = 56, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 139 [2023-12-15 21:53:13,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:53:13,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:53:13,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:53:13,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:53:13,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13" (1/1) ... [2023-12-15 21:53:13,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13" (1/1) ... [2023-12-15 21:53:13,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13" (1/1) ... [2023-12-15 21:53:13,791 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 7 writes are split as follows [0, 7]. [2023-12-15 21:53:13,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13" (1/1) ... [2023-12-15 21:53:13,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13" (1/1) ... [2023-12-15 21:53:13,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13" (1/1) ... [2023-12-15 21:53:13,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13" (1/1) ... [2023-12-15 21:53:13,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13" (1/1) ... [2023-12-15 21:53:13,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13" (1/1) ... [2023-12-15 21:53:13,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:53:13,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:53:13,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:53:13,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:53:13,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13" (1/1) ... [2023-12-15 21:53:13,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:53:13,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:53:13,842 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) [2023-12-15 21:53:13,865 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 [2023-12-15 21:53:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-12-15 21:53:13,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-12-15 21:53:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:53:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-12-15 21:53:13,883 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-12-15 21:53:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:53:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:53:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:53:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-12-15 21:53:13,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-12-15 21:53:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:53:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:53:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:53:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-15 21:53:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-15 21:53:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:53:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:53:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-12-15 21:53:13,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-12-15 21:53:13,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:53:13,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:53:13,982 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:53:13,984 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:53:14,170 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:53:14,238 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:53:14,238 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-15 21:53:14,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:53:14 BoogieIcfgContainer [2023-12-15 21:53:14,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:53:14,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:53:14,240 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:53:14,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:53:14,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:53:13" (1/3) ... [2023-12-15 21:53:14,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fc5665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:53:14, skipping insertion in model container [2023-12-15 21:53:14,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:13" (2/3) ... [2023-12-15 21:53:14,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fc5665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:53:14, skipping insertion in model container [2023-12-15 21:53:14,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:53:14" (3/3) ... [2023-12-15 21:53:14,244 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unlock_at_exit.i [2023-12-15 21:53:14,257 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:53:14,257 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-12-15 21:53:14,298 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:53:14,304 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=true, 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;@e0f9656, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:53:14,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-15 21:53:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 37 states have internal predecessors, (48), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 21:53:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 21:53:14,314 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:53:14,314 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:53:14,315 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:53:14,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:53:14,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1726020281, now seen corresponding path program 1 times [2023-12-15 21:53:14,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:53:14,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920268984] [2023-12-15 21:53:14,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:14,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:53:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:14,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:53:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:14,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:53:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:14,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-15 21:53:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:53:14,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:53:14,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920268984] [2023-12-15 21:53:14,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920268984] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:53:14,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:53:14,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:53:14,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748160705] [2023-12-15 21:53:14,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:53:14,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:53:14,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:53:14,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:53:14,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:53:14,597 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 37 states have internal predecessors, (48), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 21:53:14,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:53:14,677 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2023-12-15 21:53:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:53:14,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-12-15 21:53:14,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:53:14,686 INFO L225 Difference]: With dead ends: 102 [2023-12-15 21:53:14,686 INFO L226 Difference]: Without dead ends: 51 [2023-12-15 21:53:14,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:53:14,693 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:53:14,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 61 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:53:14,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-15 21:53:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2023-12-15 21:53:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 21:53:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-12-15 21:53:14,728 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 24 [2023-12-15 21:53:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:53:14,728 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-12-15 21:53:14,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 21:53:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-12-15 21:53:14,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 21:53:14,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:53:14,730 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:53:14,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:53:14,731 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:53:14,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:53:14,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1711785163, now seen corresponding path program 1 times [2023-12-15 21:53:14,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:53:14,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855512703] [2023-12-15 21:53:14,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:14,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:53:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:14,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:53:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:14,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:53:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:14,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-15 21:53:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:53:15,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:53:15,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855512703] [2023-12-15 21:53:15,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855512703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:53:15,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:53:15,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:53:15,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894975035] [2023-12-15 21:53:15,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:53:15,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:53:15,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:53:15,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:53:15,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:53:15,022 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-15 21:53:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:53:15,394 INFO L93 Difference]: Finished difference Result 147 states and 184 transitions. [2023-12-15 21:53:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:53:15,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-12-15 21:53:15,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:53:15,396 INFO L225 Difference]: With dead ends: 147 [2023-12-15 21:53:15,396 INFO L226 Difference]: Without dead ends: 104 [2023-12-15 21:53:15,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:53:15,397 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 115 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:53:15,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 160 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:53:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-15 21:53:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2023-12-15 21:53:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 58 states have internal predecessors, (65), 14 states have call successors, (14), 7 states have call predecessors, (14), 9 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2023-12-15 21:53:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2023-12-15 21:53:15,408 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 24 [2023-12-15 21:53:15,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:53:15,408 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2023-12-15 21:53:15,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-15 21:53:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2023-12-15 21:53:15,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 21:53:15,409 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:53:15,409 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:53:15,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:53:15,409 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:53:15,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:53:15,410 INFO L85 PathProgramCache]: Analyzing trace with hash 137181858, now seen corresponding path program 1 times [2023-12-15 21:53:15,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:53:15,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615232304] [2023-12-15 21:53:15,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:15,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:53:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:53:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:53:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-15 21:53:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:53:15,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:53:15,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615232304] [2023-12-15 21:53:15,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615232304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:53:15,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:53:15,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:53:15,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009386633] [2023-12-15 21:53:15,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:53:15,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:53:15,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:53:15,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:53:15,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:53:15,467 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-15 21:53:15,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:53:15,556 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2023-12-15 21:53:15,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:53:15,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-12-15 21:53:15,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:53:15,558 INFO L225 Difference]: With dead ends: 87 [2023-12-15 21:53:15,558 INFO L226 Difference]: Without dead ends: 85 [2023-12-15 21:53:15,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:53:15,559 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:53:15,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 131 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:53:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-15 21:53:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2023-12-15 21:53:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 61 states have internal predecessors, (67), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21) [2023-12-15 21:53:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2023-12-15 21:53:15,567 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 24 [2023-12-15 21:53:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:53:15,568 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2023-12-15 21:53:15,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-15 21:53:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2023-12-15 21:53:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-15 21:53:15,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:53:15,569 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:53:15,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:53:15,569 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:53:15,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:53:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1808531088, now seen corresponding path program 1 times [2023-12-15 21:53:15,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:53:15,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834606534] [2023-12-15 21:53:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:53:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:53:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:53:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:53:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:53:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 21:53:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:53:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:53:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:53:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-15 21:53:15,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:53:15,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834606534] [2023-12-15 21:53:15,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834606534] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:53:15,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652043357] [2023-12-15 21:53:15,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:15,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:53:15,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:53:15,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:53:15,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:53:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:15,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 21:53:15,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:53:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 21:53:15,948 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:53:15,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652043357] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:53:15,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:53:15,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2023-12-15 21:53:15,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194082648] [2023-12-15 21:53:15,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:53:15,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:53:15,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:53:15,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:53:15,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:53:15,950 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:53:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:53:15,986 INFO L93 Difference]: Finished difference Result 143 states and 175 transitions. [2023-12-15 21:53:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:53:15,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2023-12-15 21:53:15,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:53:15,988 INFO L225 Difference]: With dead ends: 143 [2023-12-15 21:53:15,988 INFO L226 Difference]: Without dead ends: 89 [2023-12-15 21:53:15,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:53:15,989 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:53:15,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:53:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-15 21:53:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-15 21:53:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.180327868852459) internal successors, (72), 65 states have internal predecessors, (72), 14 states have call successors, (14), 7 states have call predecessors, (14), 11 states have return successors, (22), 16 states have call predecessors, (22), 14 states have call successors, (22) [2023-12-15 21:53:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2023-12-15 21:53:15,997 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 55 [2023-12-15 21:53:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:53:15,998 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2023-12-15 21:53:15,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:53:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2023-12-15 21:53:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-15 21:53:15,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:53:15,999 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:53:16,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:53:16,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:53:16,205 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:53:16,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:53:16,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1360828121, now seen corresponding path program 2 times [2023-12-15 21:53:16,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:53:16,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121471177] [2023-12-15 21:53:16,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:16,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:53:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:17,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:53:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:17,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:53:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:17,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:53:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:17,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:53:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:17,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 21:53:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:17,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:53:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:18,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:53:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:18,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:53:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 21:53:18,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:53:18,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121471177] [2023-12-15 21:53:18,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121471177] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:53:18,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451222533] [2023-12-15 21:53:18,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:53:18,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:53:18,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:53:18,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:53:18,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 21:53:18,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 21:53:18,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:53:18,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 148 conjunts are in the unsatisfiable core [2023-12-15 21:53:18,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:53:18,745 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:53:18,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-15 21:53:18,947 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-12-15 21:53:18,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-12-15 21:53:20,023 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-12-15 21:53:20,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2023-12-15 21:53:20,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-15 21:53:20,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-15 21:53:20,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-15 21:53:20,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-15 21:53:20,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:53:20,878 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:53:20,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 86 [2023-12-15 21:53:20,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-15 21:53:20,932 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-12-15 21:53:20,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 53 [2023-12-15 21:54:20,570 WARN L293 SmtUtils]: Spent 54.28s on a formula simplification. DAG size of input: 285 DAG size of output: 276 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-15 21:54:25,278 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_~#mutexes~0.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| 3))) (let ((.cse7 (select .cse5 0))) (let ((.cse8 (store (select |c_old(#memory_$Pointer$#1.base)| .cse7) 0 |c_mutex_lock_#in~m#1.base|))) (let ((.cse47 (store |c_old(#memory_$Pointer$#1.base)| .cse7 .cse8))) (let ((.cse45 (select (select .cse47 3) 0))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse7) 8)) (.cse11 (not (= .cse7 3))) (.cse12 (= (select |c_old(#valid)| .cse7) 0)) (.cse10 (= .cse45 3)) (.cse26 (= (select |c_old(#valid)| 3) 0)) (.cse43 (select |c_old(#memory_$Pointer$#1.base)| 3)) (.cse29 (select .cse5 8)) (.cse23 (= (select (select |c_#memory_$Pointer$#1.offset| 3) 0) 4)) (.cse25 (= |c_mutex_lock_#in~m#1.base| 3))) (or (and (or (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (let ((.cse2 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse3 (select .cse2 3))) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (exists ((__ldv_list_add_~next.offset Int)) (and (not (= __ldv_list_add_~next.offset 4)) (= (let ((.cse1 (let ((.cse4 (+ __ldv_list_add_~next.offset 4))) (store .cse3 .cse4 (select .cse5 .cse4))))) (let ((.cse0 (store (store (select (store .cse2 3 .cse1) |mutex_lock_ldv_list_add_~new#1.base|) 4 3) 8 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) 8)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse0) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse1) |mutex_lock_ldv_list_add_~new#1.base| .cse0) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))) |c_#memory_$Pointer$#1.base|))) (= (select .cse3 0) 3) (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)))))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse6 (store |c_old(#memory_$Pointer$#1.base)| .cse7 (store (store .cse8 4 3) 8 .cse9)))) (store .cse6 3 (store (select .cse6 3) 0 .cse7)))) .cse10 .cse11 .cse12) (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (let ((.cse16 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse13 (select .cse16 3))) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (= (select .cse13 0) 3) (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)) (exists ((__ldv_list_add_~next.offset Int)) (and (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)) (= (let ((.cse15 (let ((.cse17 (+ __ldv_list_add_~next.offset 4))) (store .cse13 .cse17 (select .cse5 .cse17))))) (let ((.cse14 (store (store (select (store .cse16 3 .cse15) |mutex_lock_ldv_list_add_~new#1.base|) 4 3) 8 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) 8)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse14) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse15) |mutex_lock_ldv_list_add_~new#1.base| .cse14) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))) |c_#memory_$Pointer$#1.base|))))))) (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (let ((.cse20 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse21 (select .cse20 3))) (and (exists ((__ldv_list_add_~next.offset Int)) (= (let ((.cse19 (let ((.cse22 (+ __ldv_list_add_~next.offset 4))) (store .cse21 .cse22 (select .cse5 .cse22))))) (let ((.cse18 (store (store (select (store .cse20 3 .cse19) |mutex_lock_ldv_list_add_~new#1.base|) 4 3) 8 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) 8)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse18) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse19) |mutex_lock_ldv_list_add_~new#1.base| .cse18) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))) |c_#memory_$Pointer$#1.base|)) (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (= (select .cse21 0) 3) (not (= |mutex_lock_ldv_list_add_~new#1.base| 3))))))) .cse23) (let ((.cse24 (select |c_#memory_$Pointer$#1.offset| |c_mutex_lock_#in~m#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse24 (select (store (store |c_#memory_$Pointer$#1.offset| |c_mutex_lock_#in~m#1.base| v_DerPreprocessor_4) 3 v_DerPreprocessor_5) |c_mutex_lock_#in~m#1.base|)) (= (select v_DerPreprocessor_5 0) 4))) (not .cse25) .cse26 .cse23 (exists ((v_DerPreprocessor_13 (Array Int Int))) (= (select (store (store |c_#memory_$Pointer$#1.offset| |c_mutex_lock_#in~m#1.base| v_DerPreprocessor_13) 3 (store .cse24 0 4)) |c_mutex_lock_#in~m#1.base|) .cse24)) (let ((.cse28 (store |c_old(#memory_$Pointer$#1.base)| 3 (store .cse43 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse30 (select .cse28 |c_mutex_lock_#in~m#1.base|)) (.cse32 (select |c_#memory_$Pointer$#1.base| |c_mutex_lock_#in~m#1.base|))) (or (exists ((__ldv_list_add_~next.offset Int)) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse27 (let ((.cse31 (+ __ldv_list_add_~next.offset 4))) (store .cse30 .cse31 (select .cse32 .cse31))))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse27) 3 (store (store (store (select (store .cse28 |c_mutex_lock_#in~m#1.base| .cse27) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse29) 0 3)))) (not (= __ldv_list_add_~next.offset 4)))) (exists ((__ldv_list_add_~next.offset Int)) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse33 (let ((.cse34 (+ __ldv_list_add_~next.offset 4))) (store .cse30 .cse34 (select .cse32 .cse34))))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse33) 3 (store (store (store (select (store .cse28 |c_mutex_lock_#in~m#1.base| .cse33) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse29) 0 3)))) (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)))) (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse36 (+ __ldv_list_add_~next.offset 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse35 (store .cse30 .cse36 (select .cse32 .cse36)))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse35) 3 (store (store (store (select (store .cse28 |c_mutex_lock_#in~m#1.base| .cse35) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse29) 0 3)))) (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)) (not (= .cse36 0))))) (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse38 (+ __ldv_list_add_~next.offset 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse37 (store .cse30 .cse38 (select .cse32 .cse38)))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse37) 3 (store (store (store (select (store .cse28 |c_mutex_lock_#in~m#1.base| .cse37) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse29) 0 3)))) (not (= __ldv_list_add_~next.offset 4)) (not (= .cse38 0))))) (exists ((__ldv_list_add_~next.offset Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse39 (let ((.cse40 (+ __ldv_list_add_~next.offset 4))) (store .cse30 .cse40 (select .cse32 .cse40))))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse39) 3 (store (store (store (select (store .cse28 |c_mutex_lock_#in~m#1.base| .cse39) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse29) 0 3))))) (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse42 (+ __ldv_list_add_~next.offset 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse41 (store .cse30 .cse42 (select .cse32 .cse42)))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse41) 3 (store (store (store (select (store .cse28 |c_mutex_lock_#in~m#1.base| .cse41) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse29) 0 3)))) (not (= .cse42 0)))))))))) (and (let ((.cse76 (select |c_#memory_$Pointer$#1.offset| .cse7))) (let ((.cse71 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse80 (store (store (store |c_#memory_$Pointer$#1.offset| .cse45 v_DerPreprocessor_10) .cse7 v_DerPreprocessor_11) 3 v_DerPreprocessor_12))) (and (= (select v_DerPreprocessor_12 0) 4) (= v_DerPreprocessor_10 (select .cse80 .cse45)) (= .cse76 (select .cse80 .cse7)))))) (.cse70 (select |c_#memory_$Pointer$#1.offset| .cse45)) (.cse68 (= .cse45 .cse7))) (let ((.cse51 (not .cse68)) (.cse53 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse79 (store (store (store |c_#memory_$Pointer$#1.offset| .cse45 v_DerPreprocessor_10) .cse7 v_DerPreprocessor_11) 3 v_DerPreprocessor_12))) (let ((.cse78 (select .cse79 .cse45))) (and (= v_DerPreprocessor_12 (store .cse78 0 4)) (= .cse78 .cse70) (= .cse76 (select .cse79 .cse7))))))) (.cse48 (select .cse47 .cse45)) (.cse50 (select |c_#memory_$Pointer$#1.base| .cse45)) (.cse57 (or (and .cse71 .cse68) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse77 (store (store (store |c_#memory_$Pointer$#1.offset| .cse45 v_DerPreprocessor_10) .cse7 v_DerPreprocessor_11) 3 v_DerPreprocessor_12))) (let ((.cse75 (select .cse77 .cse45))) (and (= v_DerPreprocessor_12 (store .cse75 0 4)) (= v_DerPreprocessor_10 .cse75) (= .cse75 .cse70) (= .cse76 (select .cse77 .cse7)))))))) (.cse52 (not .cse10))) (or (and (exists ((__ldv_list_add_~next.offset Int)) (and (not (= __ldv_list_add_~next.offset 4)) (= |c_#memory_$Pointer$#1.base| (let ((.cse44 (let ((.cse46 (let ((.cse49 (+ __ldv_list_add_~next.offset 4))) (store .cse48 .cse49 (select .cse50 .cse49))))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse46) .cse7 (store (store (select (store .cse47 .cse45 .cse46) .cse7) 4 .cse45) 8 .cse9))))) (store .cse44 3 (store (select .cse44 3) 0 .cse7)))))) .cse11 .cse51 .cse52 .cse12 .cse53) (and (exists ((__ldv_list_add_~next.offset Int)) (and (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)) (= |c_#memory_$Pointer$#1.base| (let ((.cse54 (let ((.cse55 (let ((.cse56 (+ __ldv_list_add_~next.offset 4))) (store .cse48 .cse56 (select .cse50 .cse56))))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse55) .cse7 (store (store (select (store .cse47 .cse45 .cse55) .cse7) 4 .cse45) 8 .cse9))))) (store .cse54 3 (store (select .cse54 3) 0 .cse7)))))) .cse11 .cse57 .cse52 .cse12) (and .cse11 .cse51 .cse52 (exists ((__ldv_list_add_~next.offset Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse58 (let ((.cse59 (let ((.cse60 (+ __ldv_list_add_~next.offset 4))) (store .cse48 .cse60 (select .cse50 .cse60))))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse59) .cse7 (store (store (select (store .cse47 .cse45 .cse59) .cse7) 4 .cse45) 8 .cse9))))) (store .cse58 3 (store (select .cse58 3) 0 .cse7))))) .cse12 .cse53) (and (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse63 (+ __ldv_list_add_~next.offset 4))) (and (not (= __ldv_list_add_~next.offset 4)) (= |c_#memory_$Pointer$#1.base| (let ((.cse61 (let ((.cse62 (store .cse48 .cse63 (select .cse50 .cse63)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse62) .cse7 (store (store (select (store .cse47 .cse45 .cse62) .cse7) 4 .cse45) 8 .cse9))))) (store .cse61 3 (store (select .cse61 3) 0 .cse7)))) (not (= .cse63 0))))) .cse11 .cse51 .cse52 .cse12 .cse53) (and (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse66 (+ __ldv_list_add_~next.offset 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse64 (let ((.cse65 (store .cse48 .cse66 (select .cse50 .cse66)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse65) .cse7 (store (store (select (store .cse47 .cse45 .cse65) .cse7) 4 .cse45) 8 .cse9))))) (store .cse64 3 (store (select .cse64 3) 0 .cse7)))) (not (= .cse66 0))))) .cse11 .cse51 .cse52 .cse12 .cse53) (and (= (let ((.cse67 (store |c_old(#memory_$Pointer$#1.base)| .cse7 (store (store .cse8 4 .cse45) 8 .cse9)))) (store .cse67 3 (store (select .cse67 3) 0 .cse7))) |c_#memory_$Pointer$#1.base|) .cse11 .cse68 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse69 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse45 v_DerPreprocessor_10) .cse7 v_DerPreprocessor_11) 3 v_DerPreprocessor_12) .cse45))) (and (= v_DerPreprocessor_12 (store .cse69 0 4)) (= v_DerPreprocessor_10 .cse69) (= .cse69 .cse70)))) .cse71) .cse12) (and (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse74 (+ __ldv_list_add_~next.offset 4))) (and (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)) (= |c_#memory_$Pointer$#1.base| (let ((.cse72 (let ((.cse73 (store .cse48 .cse74 (select .cse50 .cse74)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse73) .cse7 (store (store (select (store .cse47 .cse45 .cse73) .cse7) 4 .cse45) 8 .cse9))))) (store .cse72 3 (store (select .cse72 3) 0 .cse7)))) (not (= .cse74 0))))) .cse11 .cse57 .cse52 .cse12))))) .cse23) (and .cse26 (or (exists ((__ldv_list_add_~next.offset Int)) (= (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store (let ((.cse81 (+ __ldv_list_add_~next.offset 4))) (store .cse43 .cse81 (select .cse5 .cse81))) 4 3) 8 .cse29) 0 3)) |c_#memory_$Pointer$#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store .cse43 4 3) 8 .cse29) 0 3)))) .cse23 .cse25)))))))) (= 3 |c_~#mutexes~0.base|)) is different from false Received shutdown request... [2023-12-15 21:54:27,462 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:54:27,475 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:54:28,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 21:54:28,663 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-15 21:54:28,667 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 137 [2023-12-15 21:54:28,669 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-15 21:54:28,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:54:28,670 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 56 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-15 21:54:28,671 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-12-15 21:54:28,671 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-12-15 21:54:28,673 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-12-15 21:54:28,674 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:54:28,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:54:28 BoogieIcfgContainer [2023-12-15 21:54:28,680 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:54:28,681 INFO L158 Benchmark]: Toolchain (without parser) took 75443.87ms. Allocated memory was 238.0MB in the beginning and 448.8MB in the end (delta: 210.8MB). Free memory was 184.5MB in the beginning and 319.4MB in the end (delta: -134.8MB). Peak memory consumption was 77.0MB. Max. memory is 8.0GB. [2023-12-15 21:54:28,681 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 162.5MB. Free memory was 112.4MB in the beginning and 112.3MB in the end (delta: 155.2kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:54:28,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.08ms. Allocated memory is still 238.0MB. Free memory was 184.0MB in the beginning and 164.0MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-15 21:54:28,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.66ms. Allocated memory is still 238.0MB. Free memory was 164.0MB in the beginning and 161.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:54:28,681 INFO L158 Benchmark]: Boogie Preprocessor took 73.92ms. Allocated memory is still 238.0MB. Free memory was 161.5MB in the beginning and 156.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:54:28,682 INFO L158 Benchmark]: RCFGBuilder took 431.72ms. Allocated memory is still 238.0MB. Free memory was 156.2MB in the beginning and 130.0MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-15 21:54:28,682 INFO L158 Benchmark]: TraceAbstraction took 74440.20ms. Allocated memory was 238.0MB in the beginning and 448.8MB in the end (delta: 210.8MB). Free memory was 129.5MB in the beginning and 319.4MB in the end (delta: -189.9MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. [2023-12-15 21:54:28,683 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.12ms. Allocated memory is still 162.5MB. Free memory was 112.4MB in the beginning and 112.3MB in the end (delta: 155.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 457.08ms. Allocated memory is still 238.0MB. Free memory was 184.0MB in the beginning and 164.0MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.66ms. Allocated memory is still 238.0MB. Free memory was 164.0MB in the beginning and 161.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.92ms. Allocated memory is still 238.0MB. Free memory was 161.5MB in the beginning and 156.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 431.72ms. Allocated memory is still 238.0MB. Free memory was 156.2MB in the beginning and 130.0MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 74440.20ms. Allocated memory was 238.0MB in the beginning and 448.8MB in the end (delta: 210.8MB). Free memory was 129.5MB in the beginning and 319.4MB in the end (delta: -189.9MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 669). Cancelled while NwaCegarLoop was analyzing trace of length 56 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 673). Cancelled while NwaCegarLoop was analyzing trace of length 56 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 677). Cancelled while NwaCegarLoop was analyzing trace of length 56 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 51 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 74.4s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 495 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 314 IncrementalHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 179 mSDtfsCounter, 314 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=4, 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: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 29 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 417 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 68/70 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 could not prove your program: Timeout Completed graceful shutdown