./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-551b009-m [2025-01-09 02:38:42,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:38:42,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:38:42,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:38:42,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:38:42,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:38:42,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:38:42,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:38:42,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:38:42,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:38:42,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:38:42,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:38:42,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:38:42,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:38:42,692 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:38:42,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:38:42,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:38:42,692 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:38:42,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:38:42,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:38:42,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:38:42,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:38:42,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:38:42,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:38:42,693 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:38:42,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:38:42,693 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:38:42,693 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:38:42,693 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:38:42,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:38:42,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:38:42,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:38:42,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:42,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:38:42,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:38:42,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:38:42,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:38:42,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:42,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:38:42,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:38:42,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:38:42,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:38:42,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:38:42,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:38:42,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:38:42,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:38:42,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:38:42,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:38:42,696 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-jdk21/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-01-09 02:38:42,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:38:42,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:38:42,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:38:42,926 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:38:42,927 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:38:42,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2025-01-09 02:38:44,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9755cde2f/5cee9bf51f7c41f48ad32f70a4227322/FLAG85027d2d9 [2025-01-09 02:38:44,349 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:38:44,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2025-01-09 02:38:44,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9755cde2f/5cee9bf51f7c41f48ad32f70a4227322/FLAG85027d2d9 [2025-01-09 02:38:44,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9755cde2f/5cee9bf51f7c41f48ad32f70a4227322 [2025-01-09 02:38:44,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:38:44,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:38:44,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:38:44,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:38:44,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:38:44,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:44,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b9403f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44, skipping insertion in model container [2025-01-09 02:38:44,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:44,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:38:44,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2025-01-09 02:38:44,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2025-01-09 02:38:44,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2025-01-09 02:38:44,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:38:44,874 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:38:44,917 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2025-01-09 02:38:44,922 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2025-01-09 02:38:44,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2025-01-09 02:38:44,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:38:44,946 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:38:44,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44 WrapperNode [2025-01-09 02:38:44,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:38:44,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:38:44,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:38:44,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:38:44,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:44,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:44,974 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 137 [2025-01-09 02:38:44,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:38:44,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:38:44,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:38:44,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:38:44,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:44,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:44,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:45,001 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-01-09 02:38:45,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:45,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:45,013 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:45,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:45,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:45,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:45,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:45,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:38:45,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:38:45,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:38:45,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:38:45,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44" (1/1) ... [2025-01-09 02:38:45,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:45,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:45,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:38:45,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:38:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-01-09 02:38:45,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-01-09 02:38:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-01-09 02:38:45,071 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-01-09 02:38:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:38:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-01-09 02:38:45,071 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-01-09 02:38:45,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:38:45,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:38:45,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:38:45,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2025-01-09 02:38:45,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2025-01-09 02:38:45,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:38:45,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:38:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:38:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:38:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:38:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:38:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:38:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2025-01-09 02:38:45,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2025-01-09 02:38:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:38:45,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:38:45,172 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:38:45,173 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:38:45,385 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-01-09 02:38:45,385 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:38:45,393 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:38:45,394 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:38:45,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:38:45 BoogieIcfgContainer [2025-01-09 02:38:45,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:38:45,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:38:45,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:38:45,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:38:45,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:38:44" (1/3) ... [2025-01-09 02:38:45,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdbcec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:38:45, skipping insertion in model container [2025-01-09 02:38:45,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:44" (2/3) ... [2025-01-09 02:38:45,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdbcec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:38:45, skipping insertion in model container [2025-01-09 02:38:45,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:38:45" (3/3) ... [2025-01-09 02:38:45,401 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2025-01-09 02:38:45,411 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:38:45,412 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-01-09 02:38:45,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:38:45,464 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;@16421fb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:38:45,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 02:38:45,470 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-01-09 02:38:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 02:38:45,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:45,476 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-01-09 02:38:45,476 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:45,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1350777473, now seen corresponding path program 1 times [2025-01-09 02:38:45,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:45,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516280062] [2025-01-09 02:38:45,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:45,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:45,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:38:45,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 02:38:45,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:45,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 02:38:45,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:45,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516280062] [2025-01-09 02:38:45,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516280062] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:45,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396524705] [2025-01-09 02:38:45,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:45,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:45,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:45,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:38:45,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:38:45,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:38:45,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 02:38:45,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:45,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:45,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 02:38:45,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:38:45,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:38:45,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396524705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:45,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:38:45,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 02:38:45,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587217949] [2025-01-09 02:38:45,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:45,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:38:45,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:45,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:38:45,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:38:45,744 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-01-09 02:38:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:45,759 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2025-01-09 02:38:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:38:45,760 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-01-09 02:38:45,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:45,764 INFO L225 Difference]: With dead ends: 132 [2025-01-09 02:38:45,765 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 02:38:45,767 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-01-09 02:38:45,769 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-01-09 02:38:45,769 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-01-09 02:38:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 02:38:45,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-09 02:38:45,789 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-01-09 02:38:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2025-01-09 02:38:45,794 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 27 [2025-01-09 02:38:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:45,794 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2025-01-09 02:38:45,794 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-01-09 02:38:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2025-01-09 02:38:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 02:38:45,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:45,795 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-01-09 02:38:45,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 02:38:45,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 02:38:45,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:45,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:45,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1883180863, now seen corresponding path program 1 times [2025-01-09 02:38:45,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:45,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968248599] [2025-01-09 02:38:45,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:45,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:46,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:38:46,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 02:38:46,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:46,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:38:46,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:46,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968248599] [2025-01-09 02:38:46,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968248599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:46,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:38:46,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:38:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448469114] [2025-01-09 02:38:46,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:46,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:38:46,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:46,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:38:46,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:38:46,126 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-01-09 02:38:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:46,145 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2025-01-09 02:38:46,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:38:46,146 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-01-09 02:38:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:46,147 INFO L225 Difference]: With dead ends: 69 [2025-01-09 02:38:46,148 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 02:38:46,148 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-01-09 02:38:46,148 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-01-09 02:38:46,149 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-01-09 02:38:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 02:38:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 02:38:46,158 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-01-09 02:38:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2025-01-09 02:38:46,160 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 27 [2025-01-09 02:38:46,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:46,161 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2025-01-09 02:38:46,161 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-01-09 02:38:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2025-01-09 02:38:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 02:38:46,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:46,162 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-01-09 02:38:46,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:38:46,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:46,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1397938305, now seen corresponding path program 1 times [2025-01-09 02:38:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:46,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613756784] [2025-01-09 02:38:46,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:46,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:46,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 02:38:46,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 02:38:46,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:46,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:38:46,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:46,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613756784] [2025-01-09 02:38:46,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613756784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:46,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:38:46,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:38:46,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601922422] [2025-01-09 02:38:46,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:46,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:38:46,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:46,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:38:46,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:38:46,500 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-01-09 02:38:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:46,746 INFO L93 Difference]: Finished difference Result 185 states and 235 transitions. [2025-01-09 02:38:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 02:38:46,747 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-01-09 02:38:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:46,748 INFO L225 Difference]: With dead ends: 185 [2025-01-09 02:38:46,748 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 02:38:46,749 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-01-09 02:38:46,749 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-01-09 02:38:46,749 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-01-09 02:38:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 02:38:46,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2025-01-09 02:38:46,764 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-01-09 02:38:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2025-01-09 02:38:46,765 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 132 transitions. Word has length 28 [2025-01-09 02:38:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:46,765 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 132 transitions. [2025-01-09 02:38:46,765 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-01-09 02:38:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 132 transitions. [2025-01-09 02:38:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 02:38:46,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:46,767 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-01-09 02:38:46,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:38:46,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:46,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash -959988023, now seen corresponding path program 1 times [2025-01-09 02:38:46,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:46,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834401254] [2025-01-09 02:38:46,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:46,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:46,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 02:38:46,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 02:38:46,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:46,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:46,863 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 02:38:46,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:46,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834401254] [2025-01-09 02:38:46,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834401254] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:46,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563650828] [2025-01-09 02:38:46,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:46,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:46,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:46,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:38:46,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:38:46,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 02:38:46,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 02:38:46,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:46,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:46,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:38:46,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 02:38:46,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:38:46,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563650828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:46,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:38:46,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-01-09 02:38:46,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845506630] [2025-01-09 02:38:46,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:46,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:38:46,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:46,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:38:46,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:38:47,000 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-01-09 02:38:47,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:47,016 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2025-01-09 02:38:47,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:38:47,017 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-01-09 02:38:47,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:47,018 INFO L225 Difference]: With dead ends: 191 [2025-01-09 02:38:47,018 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 02:38:47,019 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-01-09 02:38:47,019 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-01-09 02:38:47,019 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-01-09 02:38:47,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 02:38:47,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 02:38:47,046 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-01-09 02:38:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2025-01-09 02:38:47,049 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 67 [2025-01-09 02:38:47,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:47,049 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2025-01-09 02:38:47,050 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-01-09 02:38:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2025-01-09 02:38:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 02:38:47,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:47,052 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-01-09 02:38:47,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 02:38:47,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:47,256 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:47,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:47,257 INFO L85 PathProgramCache]: Analyzing trace with hash 138435622, now seen corresponding path program 1 times [2025-01-09 02:38:47,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:47,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472600405] [2025-01-09 02:38:47,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:47,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:47,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 02:38:47,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 02:38:47,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:47,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 02:38:51,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:51,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472600405] [2025-01-09 02:38:51,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472600405] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:51,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419137517] [2025-01-09 02:38:51,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:51,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:51,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:51,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:38:51,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:38:51,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 02:38:51,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 02:38:51,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:51,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:51,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 158 conjuncts are in the unsatisfiable core [2025-01-09 02:38:51,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:51,798 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:38:51,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2025-01-09 02:38:52,085 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-01-09 02:38:52,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2025-01-09 02:38:52,984 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2025-01-09 02:38:52,984 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 194 treesize of output 236 [2025-01-09 02:38:52,995 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 [2025-01-09 02:38:53,023 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 [2025-01-09 02:38:53,031 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 [2025-01-09 02:38:53,067 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 [2025-01-09 02:38:53,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:53,508 INFO L349 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2025-01-09 02:38:53,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 420 treesize of output 419 [2025-01-09 02:38:53,603 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 [2025-01-09 02:38:53,764 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:38:53,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 33 treesize of output 11 [2025-01-09 02:38:55,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:55,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2025-01-09 02:38:55,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:55,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2025-01-09 02:38:55,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:55,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:55,866 INFO L349 Elim1Store]: treesize reduction 203, result has 0.5 percent of original size [2025-01-09 02:38:55,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 315 treesize of output 257 [2025-01-09 02:38:55,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:55,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:55,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 90 treesize of output 61 [2025-01-09 02:38:55,895 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2025-01-09 02:38:55,896 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 1 case distinctions, treesize of input 27 treesize of output 17 [2025-01-09 02:38:55,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2025-01-09 02:38:55,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:55,915 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2025-01-09 02:38:55,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2025-01-09 02:38:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:38:56,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:38:57,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419137517] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:57,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:38:57,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2025-01-09 02:38:57,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766710060] [2025-01-09 02:38:57,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:38:57,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-01-09 02:38:57,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:57,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-01-09 02:38:57,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=4293, Unknown=7, NotChecked=0, Total=4556 [2025-01-09 02:38:57,509 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand has 60 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 43 states have internal predecessors, (82), 17 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-01-09 02:39:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:01,750 INFO L93 Difference]: Finished difference Result 249 states and 305 transitions. [2025-01-09 02:39:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 02:39:01,750 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 43 states have internal predecessors, (82), 17 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 61 [2025-01-09 02:39:01,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:01,752 INFO L225 Difference]: With dead ends: 249 [2025-01-09 02:39:01,752 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 02:39:01,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=722, Invalid=9983, Unknown=7, NotChecked=0, Total=10712 [2025-01-09 02:39:01,759 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 532 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 3632 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 3796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:39:01,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 2308 Invalid, 3796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3632 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 02:39:01,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 02:39:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 143. [2025-01-09 02:39:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 102 states have (on average 1.2156862745098038) internal successors, (124), 108 states have internal predecessors, (124), 21 states have call successors, (21), 11 states have call predecessors, (21), 17 states have return successors, (36), 23 states have call predecessors, (36), 21 states have call successors, (36) [2025-01-09 02:39:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions. [2025-01-09 02:39:01,785 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 61 [2025-01-09 02:39:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:01,786 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions. [2025-01-09 02:39:01,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 43 states have internal predecessors, (82), 17 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-01-09 02:39:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2025-01-09 02:39:01,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 02:39:01,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:01,787 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 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-01-09 02:39:01,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 02:39:01,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:01,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:39:01,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:01,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1411936029, now seen corresponding path program 1 times [2025-01-09 02:39:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:39:01,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590434586] [2025-01-09 02:39:01,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:01,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:39:01,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 02:39:02,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 02:39:02,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:02,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 02:39:02,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:39:02,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590434586] [2025-01-09 02:39:02,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590434586] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:39:02,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310611707] [2025-01-09 02:39:02,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:02,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:02,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:02,176 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:39:02,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 02:39:02,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 02:39:02,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 02:39:02,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:02,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:02,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 02:39:02,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:02,651 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 02:39:02,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:39:02,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310611707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:39:02,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:39:02,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-01-09 02:39:02,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379412138] [2025-01-09 02:39:02,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:39:02,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:39:02,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:39:02,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:39:02,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-09 02:39:02,652 INFO L87 Difference]: Start difference. First operand 143 states and 181 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 02:39:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:03,103 INFO L93 Difference]: Finished difference Result 291 states and 361 transitions. [2025-01-09 02:39:03,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 02:39:03,104 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2025-01-09 02:39:03,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:03,105 INFO L225 Difference]: With dead ends: 291 [2025-01-09 02:39:03,105 INFO L226 Difference]: Without dead ends: 145 [2025-01-09 02:39:03,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2025-01-09 02:39:03,107 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 134 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:39:03,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 246 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:39:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-09 02:39:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 127. [2025-01-09 02:39:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 92 states have (on average 1.184782608695652) internal successors, (109), 97 states have internal predecessors, (109), 17 states have call successors, (17), 11 states have call predecessors, (17), 15 states have return successors, (26), 18 states have call predecessors, (26), 17 states have call successors, (26) [2025-01-09 02:39:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2025-01-09 02:39:03,121 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 69 [2025-01-09 02:39:03,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:03,121 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2025-01-09 02:39:03,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 02:39:03,122 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2025-01-09 02:39:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 02:39:03,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:03,122 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2025-01-09 02:39:03,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 02:39:03,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 02:39:03,327 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:39:03,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:03,328 INFO L85 PathProgramCache]: Analyzing trace with hash -445328766, now seen corresponding path program 1 times [2025-01-09 02:39:03,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:39:03,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486002175] [2025-01-09 02:39:03,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:03,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:39:03,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 02:39:03,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 02:39:03,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:03,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:04,992 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:39:04,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:39:04,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486002175] [2025-01-09 02:39:04,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486002175] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:39:04,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940873712] [2025-01-09 02:39:04,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:04,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:04,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:04,994 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:39:04,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 02:39:05,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 02:39:05,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 02:39:05,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:05,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:05,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 141 conjuncts are in the unsatisfiable core [2025-01-09 02:39:05,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:05,317 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 02:39:05,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 02:39:05,505 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 02:39:05,505 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 19 treesize of output 16 [2025-01-09 02:39:05,994 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2025-01-09 02:39:05,995 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 71 [2025-01-09 02:39:06,000 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-01-09 02:39:06,000 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 67 [2025-01-09 02:39:06,012 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 31 treesize of output 28 [2025-01-09 02:39:06,055 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2025-01-09 02:39:06,055 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 2 case distinctions, treesize of input 49 treesize of output 15 [2025-01-09 02:39:06,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,066 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 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 02:39:06,079 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52 [2025-01-09 02:39:06,086 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,087 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,087 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2025-01-09 02:39:06,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,109 INFO L349 Elim1Store]: treesize reduction 21, result has 52.3 percent of original size [2025-01-09 02:39:06,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 48 [2025-01-09 02:39:06,113 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,114 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 54 [2025-01-09 02:39:06,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,122 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,141 INFO L349 Elim1Store]: treesize reduction 26, result has 58.1 percent of original size [2025-01-09 02:39:06,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 72 [2025-01-09 02:39:06,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,167 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2025-01-09 02:39:06,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 19 [2025-01-09 02:39:06,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,178 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 0 case distinctions, treesize of input 31 treesize of output 17 [2025-01-09 02:39:06,186 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 56 [2025-01-09 02:39:06,190 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,191 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,191 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2025-01-09 02:39:06,195 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,196 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2025-01-09 02:39:06,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,204 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 22 treesize of output 21 [2025-01-09 02:39:06,242 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-01-09 02:39:06,242 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2025-01-09 02:39:06,264 INFO L349 Elim1Store]: treesize reduction 65, result has 14.5 percent of original size [2025-01-09 02:39:06,264 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 2 case distinctions, treesize of input 73 treesize of output 19 [2025-01-09 02:39:06,280 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,291 INFO L349 Elim1Store]: treesize reduction 51, result has 8.9 percent of original size [2025-01-09 02:39:06,292 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 92 [2025-01-09 02:39:06,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-01-09 02:39:06,310 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 14 treesize of output 13 [2025-01-09 02:39:06,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,335 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 0 case distinctions, treesize of input 31 treesize of output 17 [2025-01-09 02:39:06,344 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 56 [2025-01-09 02:39:06,349 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,349 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2025-01-09 02:39:06,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2025-01-09 02:39:06,415 INFO L349 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2025-01-09 02:39:06,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 23 [2025-01-09 02:39:06,433 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2025-01-09 02:39:06,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 71 [2025-01-09 02:39:06,452 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 14 treesize of output 13 [2025-01-09 02:39:06,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2025-01-09 02:39:06,520 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2025-01-09 02:39:06,526 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 12 treesize of output 11 [2025-01-09 02:39:06,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,537 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 22 treesize of output 35 [2025-01-09 02:39:06,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 17 [2025-01-09 02:39:06,604 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2025-01-09 02:39:06,605 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 71 [2025-01-09 02:39:06,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,651 INFO L349 Elim1Store]: treesize reduction 95, result has 12.0 percent of original size [2025-01-09 02:39:06,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 21 [2025-01-09 02:39:06,659 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,663 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 02:39:06,663 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 135 [2025-01-09 02:39:06,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2025-01-09 02:39:06,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 17 [2025-01-09 02:39:06,758 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 56 [2025-01-09 02:39:06,762 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,763 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,763 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2025-01-09 02:39:06,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2025-01-09 02:39:06,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 17 [2025-01-09 02:39:06,822 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 56 [2025-01-09 02:39:06,825 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,825 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,826 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2025-01-09 02:39:06,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 55 [2025-01-09 02:39:06,888 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2025-01-09 02:39:06,888 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 71 [2025-01-09 02:39:06,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:06,935 INFO L349 Elim1Store]: treesize reduction 150, result has 8.0 percent of original size [2025-01-09 02:39:06,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 21 [2025-01-09 02:39:06,942 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:06,958 INFO L349 Elim1Store]: treesize reduction 38, result has 32.1 percent of original size [2025-01-09 02:39:06,958 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 169 treesize of output 162 [2025-01-09 02:39:06,973 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 12 treesize of output 1 [2025-01-09 02:39:07,011 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 151 treesize of output 98 [2025-01-09 02:39:07,096 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-01-09 02:39:07,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 02:39:07,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:07,297 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-01-09 02:39:07,302 INFO L158 Benchmark]: Toolchain (without parser) took 22663.09ms. Allocated memory was 201.3MB in the beginning and 478.2MB in the end (delta: 276.8MB). Free memory was 153.8MB in the beginning and 247.2MB in the end (delta: -93.4MB). Peak memory consumption was 276.6MB. Max. memory is 16.1GB. [2025-01-09 02:39:07,302 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:39:07,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.86ms. Allocated memory is still 201.3MB. Free memory was 153.8MB in the beginning and 134.3MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:39:07,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.32ms. Allocated memory is still 201.3MB. Free memory was 134.3MB in the beginning and 132.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:39:07,302 INFO L158 Benchmark]: Boogie Preprocessor took 47.25ms. Allocated memory is still 201.3MB. Free memory was 132.2MB in the beginning and 128.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:39:07,303 INFO L158 Benchmark]: RCFGBuilder took 371.28ms. Allocated memory is still 201.3MB. Free memory was 127.7MB in the beginning and 107.0MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 02:39:07,303 INFO L158 Benchmark]: TraceAbstraction took 21905.46ms. Allocated memory was 201.3MB in the beginning and 478.2MB in the end (delta: 276.8MB). Free memory was 106.5MB in the beginning and 247.2MB in the end (delta: -140.8MB). Peak memory consumption was 226.3MB. Max. memory is 16.1GB. [2025-01-09 02:39:07,304 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.21ms. Allocated memory is still 201.3MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.86ms. Allocated memory is still 201.3MB. Free memory was 153.8MB in the beginning and 134.3MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.32ms. Allocated memory is still 201.3MB. Free memory was 134.3MB in the beginning and 132.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.25ms. Allocated memory is still 201.3MB. Free memory was 132.2MB in the beginning and 128.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 371.28ms. Allocated memory is still 201.3MB. Free memory was 127.7MB in the beginning and 107.0MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 21905.46ms. Allocated memory was 201.3MB in the beginning and 478.2MB in the end (delta: 276.8MB). Free memory was 106.5MB in the beginning and 247.2MB in the end (delta: -140.8MB). Peak memory consumption was 226.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-01-09 02:39:07,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-551b009-m [2025-01-09 02:39:09,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:39:09,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 02:39:09,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:39:09,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:39:09,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:39:09,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:39:09,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:39:09,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:39:09,247 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:39:09,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:39:09,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:39:09,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:39:09,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:39:09,248 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:39:09,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:39:09,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:39:09,248 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:39:09,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:39:09,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:39:09,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:39:09,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:39:09,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:39:09,249 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 02:39:09,249 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 02:39:09,249 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 02:39:09,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:39:09,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:39:09,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:39:09,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:39:09,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:39:09,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:39:09,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:39:09,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:39:09,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:39:09,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:39:09,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:39:09,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:39:09,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:39:09,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:39:09,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:39:09,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:39:09,251 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:39:09,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:39:09,251 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 02:39:09,251 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 02:39:09,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:39:09,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:39:09,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:39:09,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:39:09,251 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-jdk21/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-01-09 02:39:09,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:39:09,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:39:09,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:39:09,483 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:39:09,483 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:39:09,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2025-01-09 02:39:10,651 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/435aed491/0e14d632ec8e42baa27dc34599ccbcdf/FLAGd1ded1123 [2025-01-09 02:39:10,885 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:39:10,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2025-01-09 02:39:10,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/435aed491/0e14d632ec8e42baa27dc34599ccbcdf/FLAGd1ded1123 [2025-01-09 02:39:10,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/435aed491/0e14d632ec8e42baa27dc34599ccbcdf [2025-01-09 02:39:10,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:39:10,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:39:10,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:39:10,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:39:10,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:39:10,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:39:10" (1/1) ... [2025-01-09 02:39:10,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3604d9ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:10, skipping insertion in model container [2025-01-09 02:39:10,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:39:10" (1/1) ... [2025-01-09 02:39:10,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:39:11,134 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 02:39:11,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2025-01-09 02:39:11,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2025-01-09 02:39:11,157 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2025-01-09 02:39:11,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:39:11,171 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-01-09 02:39:11,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:39:11,213 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 02:39:11,223 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2025-01-09 02:39:11,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2025-01-09 02:39:11,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2025-01-09 02:39:11,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:39:11,229 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:39:11,256 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2025-01-09 02:39:11,256 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2025-01-09 02:39:11,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2025-01-09 02:39:11,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:39:11,280 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:39:11,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11 WrapperNode [2025-01-09 02:39:11,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:39:11,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:39:11,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:39:11,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:39:11,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11" (1/1) ... [2025-01-09 02:39:11,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11" (1/1) ... [2025-01-09 02:39:11,313 INFO L138 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 133 [2025-01-09 02:39:11,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:39:11,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:39:11,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:39:11,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:39:11,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11" (1/1) ... [2025-01-09 02:39:11,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11" (1/1) ... [2025-01-09 02:39:11,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11" (1/1) ... [2025-01-09 02:39:11,347 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-01-09 02:39:11,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11" (1/1) ... [2025-01-09 02:39:11,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11" (1/1) ... [2025-01-09 02:39:11,354 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11" (1/1) ... [2025-01-09 02:39:11,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11" (1/1) ... [2025-01-09 02:39:11,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11" (1/1) ... [2025-01-09 02:39:11,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11" (1/1) ... [2025-01-09 02:39:11,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11" (1/1) ... [2025-01-09 02:39:11,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:39:11,365 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:39:11,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:39:11,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:39:11,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11" (1/1) ... [2025-01-09 02:39:11,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:39:11,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:11,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:39:11,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:39:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-01-09 02:39:11,407 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-01-09 02:39:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-01-09 02:39:11,407 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-01-09 02:39:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-01-09 02:39:11,408 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-01-09 02:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2025-01-09 02:39:11,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2025-01-09 02:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:39:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:39:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 02:39:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 02:39:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2025-01-09 02:39:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2025-01-09 02:39:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:39:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:39:11,522 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:39:11,524 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:39:11,888 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-01-09 02:39:11,889 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:39:11,913 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:39:11,913 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:39:11,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:39:11 BoogieIcfgContainer [2025-01-09 02:39:11,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:39:11,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:39:11,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:39:11,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:39:11,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:39:10" (1/3) ... [2025-01-09 02:39:11,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af613d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:39:11, skipping insertion in model container [2025-01-09 02:39:11,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:11" (2/3) ... [2025-01-09 02:39:11,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af613d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:39:11, skipping insertion in model container [2025-01-09 02:39:11,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:39:11" (3/3) ... [2025-01-09 02:39:11,922 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2025-01-09 02:39:11,931 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:39:11,932 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex_double_unlock.i that has 6 procedures, 65 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-01-09 02:39:11,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:39:11,982 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;@5e0f3442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:39:11,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 02:39:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 48 states have internal predecessors, (57), 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-01-09 02:39:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:39:11,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:11,992 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] [2025-01-09 02:39:11,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:39:11,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash -319203762, now seen corresponding path program 1 times [2025-01-09 02:39:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 02:39:12,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857529054] [2025-01-09 02:39:12,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:12,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:12,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:12,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:39:12,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:39:12,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:39:12,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:39:12,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:12,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:12,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 02:39:12,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:39:12,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:39:12,139 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 02:39:12,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857529054] [2025-01-09 02:39:12,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857529054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:39:12,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:39:12,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 02:39:12,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151977573] [2025-01-09 02:39:12,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:39:12,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:39:12,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 02:39:12,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:39:12,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:39:12,161 INFO L87 Difference]: Start difference. First operand has 65 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 48 states have internal predecessors, (57), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-01-09 02:39:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:12,181 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2025-01-09 02:39:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:39:12,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 26 [2025-01-09 02:39:12,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:12,187 INFO L225 Difference]: With dead ends: 126 [2025-01-09 02:39:12,187 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 02:39:12,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 25 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-01-09 02:39:12,193 INFO L435 NwaCegarLoop]: 75 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, 75 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-01-09 02:39:12,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:39:12,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 02:39:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 02:39:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 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-01-09 02:39:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2025-01-09 02:39:12,224 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 26 [2025-01-09 02:39:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:12,224 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2025-01-09 02:39:12,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-01-09 02:39:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2025-01-09 02:39:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:39:12,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:12,226 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] [2025-01-09 02:39:12,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 02:39:12,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:12,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:39:12,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:12,428 INFO L85 PathProgramCache]: Analyzing trace with hash -907619186, now seen corresponding path program 1 times [2025-01-09 02:39:12,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 02:39:12,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319112012] [2025-01-09 02:39:12,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:12,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:12,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:12,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:39:12,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:39:12,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:39:12,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:39:12,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:12,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:12,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 02:39:12,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:39:12,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:39:12,552 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 02:39:12,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319112012] [2025-01-09 02:39:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319112012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:39:12,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:39:12,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:39:12,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888374617] [2025-01-09 02:39:12,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:39:12,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:39:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 02:39:12,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:39:12,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:39:12,555 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-01-09 02:39:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:12,573 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2025-01-09 02:39:12,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:39:12,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 26 [2025-01-09 02:39:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:12,576 INFO L225 Difference]: With dead ends: 65 [2025-01-09 02:39:12,577 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 02:39:12,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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-01-09 02:39:12,579 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:39:12,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:39:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 02:39:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-09 02:39:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 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-01-09 02:39:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-01-09 02:39:12,593 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 26 [2025-01-09 02:39:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:12,593 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-01-09 02:39:12,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-01-09 02:39:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-01-09 02:39:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 02:39:12,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:12,594 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-01-09 02:39:12,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 02:39:12,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:12,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:39:12,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:12,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1753054477, now seen corresponding path program 1 times [2025-01-09 02:39:12,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 02:39:12,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406744979] [2025-01-09 02:39:12,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:12,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:12,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:12,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:39:12,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:39:12,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:39:12,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 02:39:12,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:12,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:12,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 02:39:12,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:39:13,305 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:39:13,305 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 02:39:13,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406744979] [2025-01-09 02:39:13,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406744979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:39:13,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:39:13,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:39:13,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202334454] [2025-01-09 02:39:13,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:39:13,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:39:13,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 02:39:13,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:39:13,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:39:13,306 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.2) 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-01-09 02:39:13,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:13,685 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2025-01-09 02:39:13,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:39:13,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) 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-01-09 02:39:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:13,687 INFO L225 Difference]: With dead ends: 168 [2025-01-09 02:39:13,687 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 02:39:13,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:39:13,688 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 45 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:39:13,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 195 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:39:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 02:39:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2025-01-09 02:39:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.208955223880597) internal successors, (81), 71 states have internal predecessors, (81), 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-01-09 02:39:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2025-01-09 02:39:13,705 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 27 [2025-01-09 02:39:13,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:13,707 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2025-01-09 02:39:13,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) 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-01-09 02:39:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2025-01-09 02:39:13,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 02:39:13,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:13,708 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-01-09 02:39:13,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 02:39:13,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:13,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:39:13,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:13,910 INFO L85 PathProgramCache]: Analyzing trace with hash -818305067, now seen corresponding path program 1 times [2025-01-09 02:39:13,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 02:39:13,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1502559792] [2025-01-09 02:39:13,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:13,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:13,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:13,912 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:39:13,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 02:39:13,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 02:39:14,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 02:39:14,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:14,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:14,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 02:39:14,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 02:39:14,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:39:14,048 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 02:39:14,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502559792] [2025-01-09 02:39:14,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502559792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:39:14,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:39:14,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:39:14,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375229958] [2025-01-09 02:39:14,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:39:14,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:39:14,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 02:39:14,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:39:14,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:39:14,050 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-01-09 02:39:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:14,074 INFO L93 Difference]: Finished difference Result 178 states and 225 transitions. [2025-01-09 02:39:14,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:39:14,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 62 [2025-01-09 02:39:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:14,077 INFO L225 Difference]: With dead ends: 178 [2025-01-09 02:39:14,079 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 02:39:14,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-01-09 02:39:14,081 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:39:14,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:39:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 02:39:14,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 02:39:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.2) internal successors, (84), 73 states have internal predecessors, (84), 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-01-09 02:39:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2025-01-09 02:39:14,100 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 62 [2025-01-09 02:39:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:14,102 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2025-01-09 02:39:14,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-01-09 02:39:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2025-01-09 02:39:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 02:39:14,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:14,104 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 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] [2025-01-09 02:39:14,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 02:39:14,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:14,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:39:14,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash 105945865, now seen corresponding path program 1 times [2025-01-09 02:39:14,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 02:39:14,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379179600] [2025-01-09 02:39:14,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:14,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:14,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:14,312 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:39:14,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 02:39:14,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 02:39:14,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 02:39:14,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:14,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:14,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 02:39:14,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:14,571 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 7 treesize of output 3 [2025-01-09 02:39:14,578 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 7 treesize of output 3 [2025-01-09 02:39:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 02:39:14,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:39:14,790 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 02:39:14,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379179600] [2025-01-09 02:39:14,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379179600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:39:14,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:39:14,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 02:39:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988646406] [2025-01-09 02:39:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:39:14,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:39:14,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 02:39:14,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:39:14,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:39:14,793 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 02:39:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:15,779 INFO L93 Difference]: Finished difference Result 232 states and 291 transitions. [2025-01-09 02:39:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 02:39:15,779 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 64 [2025-01-09 02:39:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:15,780 INFO L225 Difference]: With dead ends: 232 [2025-01-09 02:39:15,780 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 02:39:15,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-01-09 02:39:15,781 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 140 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 02:39:15,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 225 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 02:39:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 02:39:15,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 97. [2025-01-09 02:39:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 71 states have internal predecessors, (77), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2025-01-09 02:39:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2025-01-09 02:39:15,799 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 64 [2025-01-09 02:39:15,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:15,799 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2025-01-09 02:39:15,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 02:39:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2025-01-09 02:39:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 02:39:15,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:15,802 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-01-09 02:39:15,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 02:39:16,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:16,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:39:16,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash -377011612, now seen corresponding path program 1 times [2025-01-09 02:39:16,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 02:39:16,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2010294534] [2025-01-09 02:39:16,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:16,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:16,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:16,006 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:39:16,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 02:39:16,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 02:39:16,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 02:39:16,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:16,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:16,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-01-09 02:39:16,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:16,160 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 7 [2025-01-09 02:39:16,340 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-01-09 02:39:16,340 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 13 treesize of output 13 [2025-01-09 02:39:16,411 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 7 treesize of output 3 [2025-01-09 02:39:16,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2025-01-09 02:39:16,712 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2025-01-09 02:39:16,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2025-01-09 02:39:16,852 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 10 treesize of output 9 [2025-01-09 02:39:16,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 51 treesize of output 56 [2025-01-09 02:39:16,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 128 treesize of output 105 [2025-01-09 02:39:16,905 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 7 treesize of output 3 [2025-01-09 02:39:16,926 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 [2025-01-09 02:39:16,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2025-01-09 02:39:16,964 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2025-01-09 02:39:17,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2025-01-09 02:39:17,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 62 [2025-01-09 02:39:17,073 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:17,074 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 131 treesize of output 99 [2025-01-09 02:39:17,267 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2025-01-09 02:39:17,268 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 1 case distinctions, treesize of input 13 treesize of output 17 [2025-01-09 02:39:17,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2025-01-09 02:39:17,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 55 [2025-01-09 02:39:17,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 131 treesize of output 99 [2025-01-09 02:39:17,384 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 17 [2025-01-09 02:39:17,431 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2025-01-09 02:39:17,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-01-09 02:39:17,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2025-01-09 02:39:17,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2025-01-09 02:39:17,523 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 21 treesize of output 20 [2025-01-09 02:39:17,574 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 7 [2025-01-09 02:39:21,741 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv0 32) |c_~#mutexes~0.offset|) (let ((.cse7 (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|)) (.cse13 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base|))) (let ((.cse0 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~new.base|)) (.cse10 (= |c___ldv_list_add_#in~new.offset| (select .cse13 |c___ldv_list_add_#in~prev.offset|))) (.cse8 (not .cse7)) (.cse11 (select |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base|)) (.cse3 (select |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base|)) (.cse1 (bvadd |c___ldv_list_add_#in~new.offset| (_ bv4 32))) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base|)) (.cse20 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|))) (or (and .cse0 (or (and (exists ((v___ldv_list_add_~next.offset_4 (_ BitVec 32)) (v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_58 (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_59 (_ BitVec 32))) (let ((.cse4 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_4)) (.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_1) |c___ldv_list_add_#in~next.base| v_arrayElimArr_2))) (and (= (store (store (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_66) |c___ldv_list_add_#in~new.base| (store (store v_ArrVal_66 |c___ldv_list_add_#in~new.offset| v_ArrVal_59) .cse1 v_ArrVal_58)) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse2 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 .cse4 |c___ldv_list_add_#in~new.base|)))) (store .cse2 |c___ldv_list_add_#in~new.base| (store (store (select .cse2 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse1 v_ArrVal_58))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|) (= (select .cse5 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_1) (= |c___ldv_list_add_#in~new.offset| (select v_arrayElimArr_2 .cse4)) (= .cse6 (store (select (store .cse5 |c___ldv_list_add_#in~new.base| (store (store (select .cse5 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| v___ldv_list_add_~next.offset_4) .cse1 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|))))) .cse7) (and .cse8 (exists ((v_DerPreprocessor_3 (_ BitVec 32)) (v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_58 (_ BitVec 32)) (v_ArrVal_59 (_ BitVec 32))) (= (store (store (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_66) |c___ldv_list_add_#in~new.base| (store (store v_ArrVal_66 |c___ldv_list_add_#in~new.offset| v_ArrVal_59) .cse1 v_ArrVal_58)) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse9 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 (bvadd v_DerPreprocessor_3 (_ bv4 32)) |c___ldv_list_add_#in~new.base|)))) (store .cse9 |c___ldv_list_add_#in~new.base| (store (store (select .cse9 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse1 v_ArrVal_58))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|)) .cse10))) (and (not .cse0) (or (and .cse7 (let ((.cse14 (= |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)) (.cse15 (= |c___ldv_list_add_#in~prev.offset| (select .cse13 .cse1)))) (or (and (exists ((v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_58 (_ BitVec 32)) (v_ArrVal_59 (_ BitVec 32))) (= (store (store (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_66) |c___ldv_list_add_#in~new.base| (store (store .cse11 |c___ldv_list_add_#in~new.offset| v_ArrVal_59) .cse1 v_ArrVal_58)) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse12 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 (bvadd (_ bv4 32) (select .cse13 |c___ldv_list_add_#in~new.offset|)) |c___ldv_list_add_#in~new.base|)))) (store .cse12 |c___ldv_list_add_#in~new.base| (store (store (select .cse12 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse1 v_ArrVal_58))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|)) (not .cse14) (or (= |c___ldv_list_add_#in~prev.offset| .cse1) .cse15) .cse10) (and (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_58 (_ BitVec 32)) (v_ArrVal_59 (_ BitVec 32))) (= (store (store (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_66) |c___ldv_list_add_#in~new.base| (store (store .cse11 |c___ldv_list_add_#in~new.offset| v_ArrVal_59) .cse1 v_ArrVal_58)) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse16 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 (bvadd v_DerPreprocessor_7 (_ bv4 32)) |c___ldv_list_add_#in~new.base|)))) (store .cse16 |c___ldv_list_add_#in~new.base| (store (store (select .cse16 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse1 v_ArrVal_58))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|)) .cse14 .cse15 .cse10)))) (and .cse8 (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_58 (_ BitVec 32)) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_59 (_ BitVec 32))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_9) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_10)) (.cse18 (bvadd (_ bv4 32) (select v_DerPreprocessor_10 |c___ldv_list_add_#in~new.offset|)))) (and (= (store (store (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_66) |c___ldv_list_add_#in~new.base| (store (store .cse11 |c___ldv_list_add_#in~new.offset| v_ArrVal_59) .cse1 v_ArrVal_58)) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse17 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 .cse18 |c___ldv_list_add_#in~new.base|)))) (store .cse17 |c___ldv_list_add_#in~new.base| (store (store (select .cse17 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse1 v_ArrVal_58))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|) (= .cse13 (store (select .cse19 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)) (= |c___ldv_list_add_#in~prev.offset| (select v_DerPreprocessor_10 .cse1)) (= |c___ldv_list_add_#in~new.offset| (select (select .cse19 |c___ldv_list_add_#in~next.base|) .cse18))))))) (not .cse20)) (and (or (and .cse8 (= |c___ldv_list_add_#in~new.offset| (select .cse6 |c___ldv_list_add_#in~prev.offset|)) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_58 (_ BitVec 32)) (v_ArrVal_59 (_ BitVec 32))) (let ((.cse22 (bvadd v_DerPreprocessor_6 (_ bv4 32)))) (and (= (store (store (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_66) |c___ldv_list_add_#in~new.base| (store (store .cse11 |c___ldv_list_add_#in~new.offset| v_ArrVal_59) .cse1 v_ArrVal_58)) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse21 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 .cse22 |c___ldv_list_add_#in~new.base|)))) (store .cse21 |c___ldv_list_add_#in~new.base| (store (store (select .cse21 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse1 v_ArrVal_58))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|) (= |c___ldv_list_add_#in~new.offset| (select .cse6 .cse22)))))) (and .cse7 (exists ((v___ldv_list_add_~next.offset_4 (_ BitVec 32)) (v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_58 (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_59 (_ BitVec 32))) (let ((.cse23 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_4)) (.cse25 (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_4) |c___ldv_list_add_#in~next.base| v_arrayElimArr_6))) (and (= |c___ldv_list_add_#in~new.offset| (select v_arrayElimArr_6 .cse23)) (= (store (store (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_66) |c___ldv_list_add_#in~new.base| (store (store v_ArrVal_66 |c___ldv_list_add_#in~new.offset| v_ArrVal_59) .cse1 v_ArrVal_58)) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse24 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 .cse23 |c___ldv_list_add_#in~new.base|)))) (store .cse24 |c___ldv_list_add_#in~new.base| (store (store (select .cse24 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse1 v_ArrVal_58))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|) (= (store (select (store .cse25 |c___ldv_list_add_#in~new.base| (store (store (select .cse25 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| v___ldv_list_add_~next.offset_4) .cse1 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|) .cse6) (= v_DerPreprocessor_4 (select .cse25 |c___ldv_list_add_#in~prev.base|))))))) .cse20))))) is different from false [2025-01-09 02:39:21,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:21,835 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2025-01-09 02:39:21,853 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 48 treesize of output 44 [2025-01-09 02:39:21,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:21,926 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2025-01-09 02:39:21,941 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 48 treesize of output 44 [2025-01-09 02:39:22,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:22,126 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2025-01-09 02:39:22,139 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 48 treesize of output 44 [2025-01-09 02:39:22,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:22,268 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2025-01-09 02:39:22,285 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 48 treesize of output 44 [2025-01-09 02:39:22,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:22,365 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2025-01-09 02:39:26,765 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv0 32) |c_~#mutexes~0.offset|) (let ((.cse6 (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|)) (.cse29 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base|))) (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base|)) (.cse14 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~new.base|)) (.cse5 (= |c___ldv_list_add_#in~new.offset| (select .cse29 |c___ldv_list_add_#in~prev.offset|))) (.cse4 (not .cse6)) (.cse21 (select |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base|)) (.cse3 (select |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base|)) (.cse2 (bvadd |c___ldv_list_add_#in~new.offset| (_ bv4 32))) (.cse24 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|))) (or (and (or (and (exists ((v_DerPreprocessor_3 (_ BitVec 32))) (= (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c___ldv_list_add_#in~new.base|))) (store (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| .cse0) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse1 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 (bvadd v_DerPreprocessor_3 (_ bv4 32)) |c___ldv_list_add_#in~new.base|)))) (store .cse1 |c___ldv_list_add_#in~new.base| (store (store (select .cse1 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse2 (select .cse0 .cse2)))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|)) .cse4 .cse5) (and .cse6 (or (exists ((v___ldv_list_add_~next.offset_4 (_ BitVec 32)) (v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_29 (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_4)) (.cse9 (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_1) |c___ldv_list_add_#in~next.base| v_arrayElimArr_2))) (and (= (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse7 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 .cse8 |c___ldv_list_add_#in~new.base|)))) (store .cse7 |c___ldv_list_add_#in~new.base| (store (store (select .cse7 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse2 v_arrayElimCell_29))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|) (= (select .cse9 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_1) (= |c___ldv_list_add_#in~new.offset| (select v_arrayElimArr_2 .cse8)) (= .cse10 (store (select (store .cse9 |c___ldv_list_add_#in~new.base| (store (store (select .cse9 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| v___ldv_list_add_~next.offset_4) .cse2 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|))))) (exists ((v___ldv_list_add_~next.offset_4 (_ BitVec 32)) (v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_28 (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_4)) (.cse13 (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_1) |c___ldv_list_add_#in~next.base| v_arrayElimArr_2))) (and (= (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse11 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 .cse12 |c___ldv_list_add_#in~new.base|)))) (store .cse11 |c___ldv_list_add_#in~new.base| (store (store (select .cse11 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse2 v_arrayElimCell_28))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|) (= (select .cse13 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_1) (= |c___ldv_list_add_#in~new.offset| (select v_arrayElimArr_2 .cse12)) (= .cse10 (store (select (store .cse13 |c___ldv_list_add_#in~new.base| (store (store (select .cse13 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| v___ldv_list_add_~next.offset_4) .cse2 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)))))))) .cse14) (and (or (and .cse6 (or (exists ((v___ldv_list_add_~next.offset_4 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32)) (v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_4) |c___ldv_list_add_#in~next.base| v_arrayElimArr_6)) (.cse15 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_4))) (and (= |c___ldv_list_add_#in~new.offset| (select v_arrayElimArr_6 .cse15)) (= (store (select (store .cse16 |c___ldv_list_add_#in~new.base| (store (store (select .cse16 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| v___ldv_list_add_~next.offset_4) .cse2 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|) .cse10) (= v_DerPreprocessor_4 (select .cse16 |c___ldv_list_add_#in~prev.base|)) (= (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse17 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 .cse15 |c___ldv_list_add_#in~new.base|)))) (store .cse17 |c___ldv_list_add_#in~new.base| (store (store (select .cse17 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse2 v_arrayElimCell_26))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|)))) (exists ((v___ldv_list_add_~next.offset_4 (_ BitVec 32)) (v_arrayElimCell_27 (_ BitVec 32)) (v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_4)) (.cse20 (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_4) |c___ldv_list_add_#in~next.base| v_arrayElimArr_6))) (and (= |c___ldv_list_add_#in~new.offset| (select v_arrayElimArr_6 .cse18)) (= (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse19 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 .cse18 |c___ldv_list_add_#in~new.base|)))) (store .cse19 |c___ldv_list_add_#in~new.base| (store (store (select .cse19 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse2 v_arrayElimCell_27))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|) (= (store (select (store .cse20 |c___ldv_list_add_#in~new.base| (store (store (select .cse20 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| v___ldv_list_add_~next.offset_4) .cse2 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|) .cse10) (= v_DerPreprocessor_4 (select .cse20 |c___ldv_list_add_#in~prev.base|))))))) (and (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_ArrVal_58 (_ BitVec 32)) (v_ArrVal_59 (_ BitVec 32))) (let ((.cse23 (bvadd v_DerPreprocessor_6 (_ bv4 32)))) (and (= (store (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| (store (store .cse21 |c___ldv_list_add_#in~new.offset| v_ArrVal_59) .cse2 v_ArrVal_58)) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse22 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 .cse23 |c___ldv_list_add_#in~new.base|)))) (store .cse22 |c___ldv_list_add_#in~new.base| (store (store (select .cse22 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse2 v_ArrVal_58))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|) (= |c___ldv_list_add_#in~new.offset| (select .cse10 .cse23))))) .cse4 (= |c___ldv_list_add_#in~new.offset| (select .cse10 |c___ldv_list_add_#in~prev.offset|)))) .cse24) (and (not .cse14) (let ((.cse27 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (select |c_#memory_$Pointer$#1.base| |c___ldv_list_add_#in~next.base|)))) (or (and .cse6 (let ((.cse25 (= |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)) (.cse26 (= |c___ldv_list_add_#in~prev.offset| (select .cse29 .cse2)))) (or (and (not .cse25) (or (= |c___ldv_list_add_#in~prev.offset| .cse2) .cse26) (exists ((v_ArrVal_58 (_ BitVec 32)) (v_ArrVal_59 (_ BitVec 32))) (= (store (store .cse27 |c___ldv_list_add_#in~new.base| (store (store .cse21 |c___ldv_list_add_#in~new.offset| v_ArrVal_59) .cse2 v_ArrVal_58)) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse28 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 (bvadd (_ bv4 32) (select .cse29 |c___ldv_list_add_#in~new.offset|)) |c___ldv_list_add_#in~new.base|)))) (store .cse28 |c___ldv_list_add_#in~new.base| (store (store (select .cse28 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse2 v_ArrVal_58))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)) |c_#memory_$Pointer$#1.base|)) .cse5) (and .cse25 .cse26 .cse5 (exists ((v_DerPreprocessor_7 (_ BitVec 32)) (v_ArrVal_58 (_ BitVec 32)) (v_ArrVal_59 (_ BitVec 32))) (= |c_#memory_$Pointer$#1.base| (store (store .cse27 |c___ldv_list_add_#in~new.base| (store (store .cse21 |c___ldv_list_add_#in~new.offset| v_ArrVal_59) .cse2 v_ArrVal_58)) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse30 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 (bvadd v_DerPreprocessor_7 (_ bv4 32)) |c___ldv_list_add_#in~new.base|)))) (store .cse30 |c___ldv_list_add_#in~new.base| (store (store (select .cse30 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse2 v_ArrVal_58))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))))))) (and .cse4 (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_58 (_ BitVec 32)) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_59 (_ BitVec 32))) (let ((.cse33 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_9) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_10)) (.cse32 (bvadd (_ bv4 32) (select v_DerPreprocessor_10 |c___ldv_list_add_#in~new.offset|)))) (and (= |c_#memory_$Pointer$#1.base| (store (store .cse27 |c___ldv_list_add_#in~new.base| (store (store .cse21 |c___ldv_list_add_#in~new.offset| v_ArrVal_59) .cse2 v_ArrVal_58)) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse31 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse3 .cse32 |c___ldv_list_add_#in~new.base|)))) (store .cse31 |c___ldv_list_add_#in~new.base| (store (store (select .cse31 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse2 v_ArrVal_58))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) (= .cse29 (store (select .cse33 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)) (= |c___ldv_list_add_#in~prev.offset| (select v_DerPreprocessor_10 .cse2)) (= |c___ldv_list_add_#in~new.offset| (select (select .cse33 |c___ldv_list_add_#in~next.base|) .cse32)))))))) (not .cse24)))))) is different from false [2025-01-09 02:39:31,839 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv0 32) |c_~#mutexes~0.offset|) (let ((.cse29 (select |c_old(#memory_$Pointer$#1.base)| |c_~#mutexes~0.base|)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_mutex_lock_#in~m#1.base|))) (let ((.cse10 (select .cse9 (_ bv4 32))) (.cse0 (store |c_old(#memory_$Pointer$#1.base)| |c_~#mutexes~0.base| (store .cse29 (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_~#mutexes~0.base|)) (.cse1 (select .cse0 |c_mutex_lock_#in~m#1.base|)) (.cse8 (bvadd (_ bv4 32) .cse10)) (.cse11 (select .cse29 (_ bv0 32)))) (let ((.cse12 (= |c_~#mutexes~0.base| .cse11)) (.cse4 (= |c_mutex_lock_#in~m#1.base| |c_~#mutexes~0.base|)) (.cse6 (store (select (store .cse0 |c_mutex_lock_#in~m#1.base| (store .cse1 .cse8 |c_~#mutexes~0.base|)) |c_~#mutexes~0.base|) (_ bv4 32) |c_mutex_lock_#in~m#1.base|)) (.cse3 (= (_ bv4 32) (select .cse2 (_ bv0 32))))) (or (and (exists ((v_ArrVal_58 (_ BitVec 32))) (= (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| (select |c_#memory_$Pointer$#1.base| |c_mutex_lock_#in~m#1.base|)) |c_~#mutexes~0.base| (store (store (store (select (store .cse0 |c_mutex_lock_#in~m#1.base| (store .cse1 (bvadd (_ bv4 32) (select .cse2 (_ bv4 32))) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base|) (_ bv4 32) |c_mutex_lock_#in~m#1.base|) (_ bv8 32) v_ArrVal_58) (_ bv0 32) |c_~#mutexes~0.base|)) |c_#memory_$Pointer$#1.base|)) (= (_ bv0 32) (select .cse2 (_ bv8 32))) .cse3 (not .cse4)) (and (let ((.cse5 (exists ((v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#1.offset| |c_~#mutexes~0.base| v_DerPreprocessor_1) |c_mutex_lock_#in~m#1.base| v_arrayElimArr_2) |c_~#mutexes~0.base|))) (and (= v_DerPreprocessor_1 .cse7) (= (_ bv4 32) (select v_arrayElimArr_2 .cse8)) (= .cse9 (store (store (store .cse7 (_ bv4 32) .cse10) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (_ bv4 32)))))))) (or (and .cse5 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$#1.base)| |c_~#mutexes~0.base| (store (store .cse6 (_ bv8 32) v_arrayElimCell_28) (_ bv0 32) |c_~#mutexes~0.base|)) |c_#memory_$Pointer$#1.base|))) (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$#1.base)| |c_~#mutexes~0.base| (store (store .cse6 (_ bv8 32) v_arrayElimCell_29) (_ bv0 32) |c_~#mutexes~0.base|)) |c_#memory_$Pointer$#1.base|)) .cse5))) .cse4) (exists ((|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32))) (and (not (= .cse11 |mutex_lock_ldv_list_add_~new#1.base|)) (not .cse12) (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_58 (_ BitVec 32)) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_59 (_ BitVec 32))) (let ((.cse14 (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|))) (let ((.cse13 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse14)) (.cse16 (bvadd (_ bv4 32) (select v_DerPreprocessor_10 (_ bv4 32))))) (and (= .cse2 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| (select (select .cse13 |c_~#mutexes~0.base|) (_ bv0 32)) v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_10) |c_~#mutexes~0.base|) (_ bv0 32) (_ bv4 32))) (= (_ bv0 32) (select v_DerPreprocessor_10 (_ bv8 32))) (= (store (store (store |c_old(#memory_$Pointer$#1.base)| .cse11 (select |c_#memory_$Pointer$#1.base| .cse11)) |mutex_lock_ldv_list_add_~new#1.base| (store (store .cse14 (_ bv4 32) v_ArrVal_59) (_ bv8 32) v_ArrVal_58)) |c_~#mutexes~0.base| (store (select (let ((.cse15 (store (select .cse13 .cse11) .cse16 |mutex_lock_ldv_list_add_~new#1.base|))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse11 .cse15) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse13 .cse11 .cse15) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse11) (_ bv8 32) v_ArrVal_58))) |c_~#mutexes~0.base|) (_ bv0 32) |mutex_lock_ldv_list_add_~new#1.base|)) |c_#memory_$Pointer$#1.base|) (= (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_10) .cse11) .cse16)))))) (not (= |c_~#mutexes~0.base| |mutex_lock_ldv_list_add_~new#1.base|)))) (exists ((|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32))) (let ((.cse17 (select |c_#memory_$Pointer$#1.offset| .cse11))) (and .cse12 (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_ArrVal_58 (_ BitVec 32)) (v_ArrVal_59 (_ BitVec 32))) (let ((.cse18 (bvadd v_DerPreprocessor_6 (_ bv4 32)))) (and (= (_ bv4 32) (select .cse17 .cse18)) (= |c_#memory_$Pointer$#1.base| (let ((.cse19 (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (store .cse19 (_ bv4 32) v_ArrVal_59) (_ bv8 32) v_ArrVal_58)) |c_~#mutexes~0.base| (store (select (let ((.cse22 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse19))) (let ((.cse20 (select (select .cse22 |c_~#mutexes~0.base|) (_ bv0 32)))) (let ((.cse21 (store (select .cse22 .cse20) .cse18 |mutex_lock_ldv_list_add_~new#1.base|))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse20 .cse21) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse22 .cse20 .cse21) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse20) (_ bv8 32) v_ArrVal_58))))) |c_~#mutexes~0.base|) (_ bv0 32) |mutex_lock_ldv_list_add_~new#1.base|))))))) (= (_ bv4 32) (select .cse17 (_ bv0 32))) (not (= |c_~#mutexes~0.base| |mutex_lock_ldv_list_add_~new#1.base|))))) (and .cse4 (let ((.cse23 (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (store (store |c_#memory_$Pointer$#1.offset| |c_~#mutexes~0.base| v_DerPreprocessor_4) |c_mutex_lock_#in~m#1.base| v_arrayElimArr_6) |c_~#mutexes~0.base|))) (and (= (_ bv4 32) (select v_arrayElimArr_6 .cse8)) (= (store (store (store .cse24 (_ bv4 32) .cse10) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (_ bv4 32)) .cse9) (= .cse24 v_DerPreprocessor_4)))))) (or (and .cse23 (exists ((v_arrayElimCell_27 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$#1.base)| |c_~#mutexes~0.base| (store (store .cse6 (_ bv8 32) v_arrayElimCell_27) (_ bv0 32) |c_~#mutexes~0.base|)) |c_#memory_$Pointer$#1.base|))) (and .cse23 (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$#1.base)| |c_~#mutexes~0.base| (store (store .cse6 (_ bv8 32) v_arrayElimCell_26) (_ bv0 32) |c_~#mutexes~0.base|)) |c_#memory_$Pointer$#1.base|)))))) (and (exists ((v_DerPreprocessor_3 (_ BitVec 32)) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32))) (and (= (let ((.cse25 (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse25) |c_~#mutexes~0.base| (store (select (let ((.cse28 (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|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse26 (select (select .cse28 |c_~#mutexes~0.base|) (_ bv0 32)))) (let ((.cse27 (store (select .cse28 .cse26) (bvadd v_DerPreprocessor_3 (_ bv4 32)) |mutex_lock_ldv_list_add_~new#1.base|))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse26 .cse27) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse28 .cse26 .cse27) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse26) (_ bv8 32) (select .cse25 (_ bv8 32))))))) |c_~#mutexes~0.base|) (_ bv0 32) |mutex_lock_ldv_list_add_~new#1.base|))) |c_#memory_$Pointer$#1.base|) (= .cse11 |mutex_lock_ldv_list_add_~new#1.base|) (not (= |c_~#mutexes~0.base| |mutex_lock_ldv_list_add_~new#1.base|)))) .cse3))))))) is different from false [2025-01-09 02:39:58,995 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 203 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)