./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:25:10,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:25:10,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:25:10,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:25:10,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:25:10,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:25:10,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:25:10,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:25:10,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:25:10,357 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:25:10,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:25:10,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:25:10,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:25:10,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:25:10,357 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:25:10,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:25:10,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:25:10,358 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:25:10,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:25:10,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:25:10,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:25:10,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:25:10,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:25:10,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:25:10,358 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:25:10,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:25:10,359 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:25:10,359 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:25:10,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:25:10,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:25:10,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:25:10,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:25:10,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:25:10,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:25:10,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:25:10,359 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:25:10,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:25:10,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:25:10,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:25:10,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:25:10,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:25:10,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:25:10,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:25:10,360 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 [2025-03-08 04:25:10,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:25:10,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:25:10,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:25:10,588 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:25:10,588 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:25:10,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2025-03-08 04:25:11,695 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a19419e63/2a54fb50cfb44da99ef5c5576eff246f/FLAG77ac26c0b [2025-03-08 04:25:11,921 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:25:11,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2025-03-08 04:25:11,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a19419e63/2a54fb50cfb44da99ef5c5576eff246f/FLAG77ac26c0b [2025-03-08 04:25:12,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a19419e63/2a54fb50cfb44da99ef5c5576eff246f [2025-03-08 04:25:12,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:25:12,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:25:12,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:25:12,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:25:12,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:25:12,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:25:12" (1/1) ... [2025-03-08 04:25:12,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3c5206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12, skipping insertion in model container [2025-03-08 04:25:12,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:25:12" (1/1) ... [2025-03-08 04:25:12,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:25:12,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2025-03-08 04:25:12,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2025-03-08 04:25:12,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2025-03-08 04:25:12,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:25:12,476 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:25:12,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2025-03-08 04:25:12,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2025-03-08 04:25:12,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2025-03-08 04:25:12,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:25:12,540 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:25:12,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12 WrapperNode [2025-03-08 04:25:12,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:25:12,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:25:12,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:25:12,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:25:12,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12" (1/1) ... [2025-03-08 04:25:12,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12" (1/1) ... [2025-03-08 04:25:12,568 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 137 [2025-03-08 04:25:12,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:25:12,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:25:12,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:25:12,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:25:12,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12" (1/1) ... [2025-03-08 04:25:12,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12" (1/1) ... [2025-03-08 04:25:12,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12" (1/1) ... [2025-03-08 04:25:12,601 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]. [2025-03-08 04:25:12,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12" (1/1) ... [2025-03-08 04:25:12,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12" (1/1) ... [2025-03-08 04:25:12,608 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12" (1/1) ... [2025-03-08 04:25:12,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12" (1/1) ... [2025-03-08 04:25:12,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12" (1/1) ... [2025-03-08 04:25:12,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12" (1/1) ... [2025-03-08 04:25:12,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:25:12,612 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:25:12,612 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:25:12,612 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:25:12,613 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12" (1/1) ... [2025-03-08 04:25:12,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:25:12,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:25:12,637 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) [2025-03-08 04:25:12,639 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 [2025-03-08 04:25:12,654 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-03-08 04:25:12,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-03-08 04:25:12,654 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-08 04:25:12,654 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-08 04:25:12,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:25:12,654 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-08 04:25:12,655 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-08 04:25:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:25:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:25:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:25:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2025-03-08 04:25:12,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2025-03-08 04:25:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:25:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:25:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:25:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 04:25:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 04:25:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:25:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:25:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2025-03-08 04:25:12,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2025-03-08 04:25:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:25:12,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:25:12,743 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:25:12,745 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:25:12,923 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L663: havoc ldv_set_empty_#t~ret31#1; [2025-03-08 04:25:12,924 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L620: havoc ldv_list_empty_#t~mem10#1.base, ldv_list_empty_#t~mem10#1.offset; [2025-03-08 04:25:12,981 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-03-08 04:25:12,981 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:25:12,990 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:25:12,991 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:25:12,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:25:12 BoogieIcfgContainer [2025-03-08 04:25:12,991 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:25:12,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:25:12,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:25:12,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:25:12,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:25:12" (1/3) ... [2025-03-08 04:25:13,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae833b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:25:12, skipping insertion in model container [2025-03-08 04:25:13,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:25:12" (2/3) ... [2025-03-08 04:25:13,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae833b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:25:13, skipping insertion in model container [2025-03-08 04:25:13,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:25:12" (3/3) ... [2025-03-08 04:25:13,002 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2025-03-08 04:25:13,013 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:25:13,015 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex_double_unlock.i that has 6 procedures, 68 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-08 04:25:13,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:25:13,076 INFO L333 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, 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;@8000a10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:25:13,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 04:25:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.25) internal successors, (60), 51 states have internal predecessors, (60), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 04:25:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:25:13,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:25:13,087 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:25:13,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:25:13,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:25:13,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1577892343, now seen corresponding path program 1 times [2025-03-08 04:25:13,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:25:13,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29176124] [2025-03-08 04:25:13,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:13,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:25:13,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:25:13,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:25:13,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:13,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:25:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:25:13,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:25:13,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29176124] [2025-03-08 04:25:13,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29176124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:25:13,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108782451] [2025-03-08 04:25:13,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:13,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:25:13,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:25:13,238 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) [2025-03-08 04:25:13,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:25:13,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:25:13,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:25:13,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:13,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:25:13,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 04:25:13,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:25:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:25:13,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:25:13,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108782451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:25:13,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:25:13,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 04:25:13,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907139781] [2025-03-08 04:25:13,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:25:13,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:25:13,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:25:13,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:25:13,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:25:13,383 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.25) internal successors, (60), 51 states have internal predecessors, (60), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 04:25:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:25:13,402 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2025-03-08 04:25:13,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:25:13,404 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-08 04:25:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:25:13,407 INFO L225 Difference]: With dead ends: 132 [2025-03-08 04:25:13,408 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 04:25:13,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:25:13,411 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:25:13,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:25:13,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 04:25:13,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-08 04:25:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 46 states have internal predecessors, (51), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 04:25:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2025-03-08 04:25:13,437 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 27 [2025-03-08 04:25:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:25:13,438 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2025-03-08 04:25:13,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 04:25:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2025-03-08 04:25:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:25:13,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:25:13,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:25:13,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:25:13,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 04:25:13,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:25:13,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:25:13,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1047387863, now seen corresponding path program 1 times [2025-03-08 04:25:13,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:25:13,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111709569] [2025-03-08 04:25:13,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:13,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:25:13,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:25:13,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:25:13,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:13,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:25:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:25:13,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:25:13,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111709569] [2025-03-08 04:25:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111709569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:25:13,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:25:13,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:25:13,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465394978] [2025-03-08 04:25:13,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:25:13,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:25:13,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:25:13,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:25:13,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:25:13,792 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 04:25:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:25:13,811 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2025-03-08 04:25:13,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:25:13,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 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 27 [2025-03-08 04:25:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:25:13,817 INFO L225 Difference]: With dead ends: 69 [2025-03-08 04:25:13,817 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 04:25:13,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:25:13,817 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:25:13,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:25:13,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 04:25:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 04:25:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2025-03-08 04:25:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2025-03-08 04:25:13,830 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 27 [2025-03-08 04:25:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:25:13,831 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2025-03-08 04:25:13,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 04:25:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2025-03-08 04:25:13,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 04:25:13,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:25:13,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:25:13,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:25:13,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:25:13,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:25:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1899112514, now seen corresponding path program 1 times [2025-03-08 04:25:13,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:25:13,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041694815] [2025-03-08 04:25:13,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:13,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:25:13,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 04:25:13,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 04:25:13,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:13,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:25:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:25:14,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:25:14,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041694815] [2025-03-08 04:25:14,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041694815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:25:14,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:25:14,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:25:14,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685242624] [2025-03-08 04:25:14,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:25:14,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:25:14,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:25:14,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:25:14,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:25:14,117 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2025-03-08 04:25:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:25:14,413 INFO L93 Difference]: Finished difference Result 185 states and 235 transitions. [2025-03-08 04:25:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 04:25:14,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 28 [2025-03-08 04:25:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:25:14,417 INFO L225 Difference]: With dead ends: 185 [2025-03-08 04:25:14,417 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 04:25:14,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:25:14,418 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 70 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:25:14,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 207 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:25:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 04:25:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2025-03-08 04:25:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 78 states have internal predecessors, (88), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (26), 18 states have call predecessors, (26), 18 states have call successors, (26) [2025-03-08 04:25:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2025-03-08 04:25:14,436 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 132 transitions. Word has length 28 [2025-03-08 04:25:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:25:14,436 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 132 transitions. [2025-03-08 04:25:14,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2025-03-08 04:25:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 132 transitions. [2025-03-08 04:25:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 04:25:14,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:25:14,438 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 04:25:14,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:25:14,438 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:25:14,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:25:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1606189501, now seen corresponding path program 1 times [2025-03-08 04:25:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:25:14,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386743495] [2025-03-08 04:25:14,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:14,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:25:14,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 04:25:14,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 04:25:14,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:14,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:25:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 04:25:14,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:25:14,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386743495] [2025-03-08 04:25:14,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386743495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:25:14,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454411806] [2025-03-08 04:25:14,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:14,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:25:14,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:25:14,527 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) [2025-03-08 04:25:14,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:25:14,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 04:25:14,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 04:25:14,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:14,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:25:14,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:25:14,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:25:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 04:25:14,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:25:14,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454411806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:25:14,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:25:14,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-08 04:25:14,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663298776] [2025-03-08 04:25:14,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:25:14,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:25:14,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:25:14,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:25:14,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:25:14,686 INFO L87 Difference]: Start difference. First operand 106 states and 132 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 04:25:14,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:25:14,704 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2025-03-08 04:25:14,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:25:14,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2025-03-08 04:25:14,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:25:14,706 INFO L225 Difference]: With dead ends: 191 [2025-03-08 04:25:14,706 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 04:25:14,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:25:14,707 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:25:14,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:25:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 04:25:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 04:25:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 82 states have internal predecessors, (93), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (27), 20 states have call predecessors, (27), 18 states have call successors, (27) [2025-03-08 04:25:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2025-03-08 04:25:14,722 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 67 [2025-03-08 04:25:14,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:25:14,722 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2025-03-08 04:25:14,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 04:25:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2025-03-08 04:25:14,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 04:25:14,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:25:14,724 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2025-03-08 04:25:14,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:25:14,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 04:25:14,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:25:14,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:25:14,932 INFO L85 PathProgramCache]: Analyzing trace with hash 626081900, now seen corresponding path program 1 times [2025-03-08 04:25:14,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:25:14,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690098462] [2025-03-08 04:25:14,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:14,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:25:14,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 04:25:15,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 04:25:15,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:15,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:25:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 04:25:17,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:25:17,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690098462] [2025-03-08 04:25:17,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690098462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:25:17,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477664705] [2025-03-08 04:25:17,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:25:17,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:25:17,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:25:17,560 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:25:17,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:25:17,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 04:25:17,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 04:25:17,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:25:17,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:25:17,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 141 conjuncts are in the unsatisfiable core [2025-03-08 04:25:17,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:25:17,741 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 6 treesize of output 5 [2025-03-08 04:25:18,035 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:25:18,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 04:25:18,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-03-08 04:25:18,565 INFO L349 Elim1Store]: treesize reduction 65, result has 12.2 percent of original size [2025-03-08 04:25:18,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 26 [2025-03-08 04:25:18,685 INFO L349 Elim1Store]: treesize reduction 212, result has 24.8 percent of original size [2025-03-08 04:25:18,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 77 [2025-03-08 04:25:19,217 INFO L349 Elim1Store]: treesize reduction 378, result has 21.9 percent of original size [2025-03-08 04:25:19,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 233 treesize of output 120 [2025-03-08 04:25:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:25:20,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:25:21,358 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2025-03-08 04:25:21,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 311 treesize of output 298 [2025-03-08 04:25:21,423 INFO L349 Elim1Store]: treesize reduction 38, result has 56.8 percent of original size [2025-03-08 04:25:21,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 165 treesize of output 190 [2025-03-08 04:25:21,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:25:21,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 404 treesize of output 364 [2025-03-08 04:25:21,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 102 treesize of output 94 [2025-03-08 04:25:21,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-08 04:25:21,611 INFO L349 Elim1Store]: treesize reduction 16, result has 66.7 percent of original size [2025-03-08 04:25:21,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 195 [2025-03-08 04:25:21,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:25:21,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:25:21,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 25 treesize of output 4 [2025-03-08 04:25:21,664 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-08 04:25:21,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 4 [2025-03-08 04:25:21,742 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:25:21,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-03-08 04:25:21,756 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:25:21,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-03-08 04:25:21,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:25:21,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 150 [2025-03-08 04:25:22,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:25:22,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 511547 treesize of output 477441