./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex.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.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 cee8df08ffad3eb9e493a0be0076215dd3a59bce6d2370397b3bb712a7fad867 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:38:41,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:38:41,988 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:41,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:38:41,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:38:42,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:38:42,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:38:42,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:38:42,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:38:42,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:38:42,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:38:42,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:38:42,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:38:42,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:38:42,011 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:38:42,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:38:42,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:38:42,011 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:38:42,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:38:42,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:38:42,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:38:42,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:38:42,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:38:42,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:38:42,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:38:42,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:38:42,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:38:42,012 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:38:42,012 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:38:42,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:38:42,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:38:42,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:38:42,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:42,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:38:42,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:38:42,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:38:42,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:38:42,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:42,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:38:42,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:38:42,013 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:38:42,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:38:42,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:38:42,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:38:42,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:38:42,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:38:42,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:38:42,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:38:42,014 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 -> cee8df08ffad3eb9e493a0be0076215dd3a59bce6d2370397b3bb712a7fad867 [2025-01-09 02:38:42,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:38:42,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:38:42,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:38:42,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:38:42,248 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:38:42,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex.i [2025-01-09 02:38:43,394 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9615aee07/b696b65cd7884ee29b5cf0eb2bac74ba/FLAGfa57cc4e2 [2025-01-09 02:38:43,717 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:38:43,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i [2025-01-09 02:38:43,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9615aee07/b696b65cd7884ee29b5cf0eb2bac74ba/FLAGfa57cc4e2 [2025-01-09 02:38:43,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9615aee07/b696b65cd7884ee29b5cf0eb2bac74ba [2025-01-09 02:38:43,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:38:43,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:38:43,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:38:43,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:38:43,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:38:43,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:38:43" (1/1) ... [2025-01-09 02:38:43,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f473cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:43, skipping insertion in model container [2025-01-09 02:38:43,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:38:43" (1/1) ... [2025-01-09 02:38:43,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:38:44,307 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.i[25842,25855] [2025-01-09 02:38:44,314 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.i[25967,25980] [2025-01-09 02:38:44,319 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.i[26082,26095] [2025-01-09 02:38:44,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:38:44,342 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:38:44,399 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.i[25842,25855] [2025-01-09 02:38:44,400 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.i[25967,25980] [2025-01-09 02:38:44,401 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.i[26082,26095] [2025-01-09 02:38:44,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:38:44,431 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:38:44,433 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,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:38:44,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:38:44,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:38:44,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:38:44,440 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,457 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,481 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 137 [2025-01-09 02:38:44,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:38:44,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:38:44,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:38:44,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:38:44,488 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,489 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,492 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:44,519 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:44,519 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:44,520 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:44,534 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:44,534 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:44,536 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:44,539 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:44,540 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:44,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:38:44,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:38:44,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:38:44,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:38:44,549 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:44,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:44,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:44,584 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:44,587 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:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-01-09 02:38:44,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-01-09 02:38:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-01-09 02:38:44,607 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-01-09 02:38:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:38:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-01-09 02:38:44,608 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-01-09 02:38:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:38:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:38:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:38:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2025-01-09 02:38:44,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2025-01-09 02:38:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:38:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:38:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:38:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:38:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:38:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:38:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:38:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2025-01-09 02:38:44,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2025-01-09 02:38:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:38:44,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:38:44,704 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:38:44,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:38:44,937 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-01-09 02:38:44,937 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:38:44,944 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:38:44,944 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:38:44,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:38:44 BoogieIcfgContainer [2025-01-09 02:38:44,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:38:44,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:38:44,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:38:44,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:38:44,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:38:43" (1/3) ... [2025-01-09 02:38:44,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d3ce7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:38:44, skipping insertion in model container [2025-01-09 02:38:44,951 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:44,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d3ce7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:38:44, skipping insertion in model container [2025-01-09 02:38:44,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:38:44" (3/3) ... [2025-01-09 02:38:44,952 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex.i [2025-01-09 02:38:44,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:38:44,969 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex.i that has 6 procedures, 68 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-01-09 02:38:45,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:38:45,023 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;@2e56ae5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:38:45,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 02:38:45,026 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,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 02:38:45,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:45,031 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,031 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,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1350777473, now seen corresponding path program 1 times [2025-01-09 02:38:45,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:45,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404897806] [2025-01-09 02:38:45,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:45,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:45,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:38:45,106 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,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:45,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:45,149 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,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:45,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404897806] [2025-01-09 02:38:45,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404897806] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:45,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315305392] [2025-01-09 02:38:45,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:45,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:45,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:45,153 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,155 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,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:38:45,233 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,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:45,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:45,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 02:38:45,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:45,245 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,245 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:38:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315305392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:45,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:38:45,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 02:38:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791536960] [2025-01-09 02:38:45,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:45,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:38:45,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:45,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:38:45,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:38:45,263 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,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:45,277 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2025-01-09 02:38:45,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:38:45,278 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,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:45,283 INFO L225 Difference]: With dead ends: 132 [2025-01-09 02:38:45,283 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 02:38:45,285 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,287 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,287 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,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 02:38:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-09 02:38:45,305 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,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2025-01-09 02:38:45,309 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 27 [2025-01-09 02:38:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:45,310 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2025-01-09 02:38:45,310 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,310 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2025-01-09 02:38:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 02:38:45,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:45,311 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,317 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:38:45,512 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,512 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,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:45,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1883180863, now seen corresponding path program 1 times [2025-01-09 02:38:45,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:45,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775880798] [2025-01-09 02:38:45,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:45,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:45,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:38:45,539 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,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:45,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:45,646 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:45,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:45,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775880798] [2025-01-09 02:38:45,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775880798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:45,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:38:45,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:38:45,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62399661] [2025-01-09 02:38:45,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:45,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:38:45,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:45,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:38:45,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:38:45,647 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:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:45,672 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2025-01-09 02:38:45,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:38:45,672 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:45,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:45,676 INFO L225 Difference]: With dead ends: 69 [2025-01-09 02:38:45,676 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 02:38:45,676 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:45,678 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:45,678 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:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 02:38:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 02:38:45,683 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:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2025-01-09 02:38:45,684 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 27 [2025-01-09 02:38:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:45,685 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2025-01-09 02:38:45,685 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:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2025-01-09 02:38:45,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 02:38:45,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:45,685 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:45,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:38:45,686 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:45,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:45,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1397938305, now seen corresponding path program 1 times [2025-01-09 02:38:45,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:45,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368980989] [2025-01-09 02:38:45,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:45,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:45,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 02:38:45,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 02:38:45,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:45,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:46,019 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,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:46,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368980989] [2025-01-09 02:38:46,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368980989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:46,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:38:46,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:38:46,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40562286] [2025-01-09 02:38:46,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:46,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:38:46,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:46,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:38:46,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:38:46,022 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,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:46,237 INFO L93 Difference]: Finished difference Result 185 states and 235 transitions. [2025-01-09 02:38:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 02:38:46,237 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,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:46,239 INFO L225 Difference]: With dead ends: 185 [2025-01-09 02:38:46,239 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 02:38:46,239 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,240 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:46,240 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.1s Time] [2025-01-09 02:38:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 02:38:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2025-01-09 02:38:46,251 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,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2025-01-09 02:38:46,252 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 132 transitions. Word has length 28 [2025-01-09 02:38:46,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:46,252 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 132 transitions. [2025-01-09 02:38:46,252 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,252 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 132 transitions. [2025-01-09 02:38:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 02:38:46,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:46,254 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,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:38:46,254 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,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:46,254 INFO L85 PathProgramCache]: Analyzing trace with hash -959988023, now seen corresponding path program 1 times [2025-01-09 02:38:46,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:46,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603182807] [2025-01-09 02:38:46,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:46,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:46,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 02:38:46,294 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,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:46,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:46,339 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,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:46,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603182807] [2025-01-09 02:38:46,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603182807] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:46,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826238285] [2025-01-09 02:38:46,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:46,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:46,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:46,341 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,343 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,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 02:38:46,440 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,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:46,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:46,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:38:46,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:46,479 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,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:38:46,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826238285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:46,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:38:46,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-01-09 02:38:46,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360989731] [2025-01-09 02:38:46,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:46,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:38:46,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:46,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:38:46,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:38:46,480 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:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:46,530 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2025-01-09 02:38:46,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:38:46,539 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:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:46,540 INFO L225 Difference]: With dead ends: 191 [2025-01-09 02:38:46,540 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 02:38:46,541 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:46,541 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:46,541 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:46,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 02:38:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 02:38:46,566 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:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2025-01-09 02:38:46,570 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 67 [2025-01-09 02:38:46,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:46,571 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2025-01-09 02:38:46,571 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:46,571 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2025-01-09 02:38:46,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 02:38:46,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:46,572 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:46,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 02:38:46,772 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:46,773 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:46,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:46,773 INFO L85 PathProgramCache]: Analyzing trace with hash 138435622, now seen corresponding path program 1 times [2025-01-09 02:38:46,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:46,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454230605] [2025-01-09 02:38:46,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:46,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:46,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 02:38:46,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 02:38:46,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:46,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:51,101 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,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:51,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454230605] [2025-01-09 02:38:51,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454230605] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:51,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492540820] [2025-01-09 02:38:51,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:51,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:51,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:51,104 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,106 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,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 02:38:51,213 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,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:51,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:51,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 158 conjuncts are in the unsatisfiable core [2025-01-09 02:38:51,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:51,507 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:38:51,508 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:51,824 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-01-09 02:38:51,825 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,658 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2025-01-09 02:38:52,658 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,675 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:52,708 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:52,717 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:52,766 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,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:53,161 INFO L349 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2025-01-09 02:38:53,161 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,233 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,473 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:38:53,477 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:54,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:54,957 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:54,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:54,964 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,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:55,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:55,759 INFO L349 Elim1Store]: treesize reduction 203, result has 0.5 percent of original size [2025-01-09 02:38:55,759 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,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:55,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:55,792 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,801 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2025-01-09 02:38:55,802 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,817 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,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:38:55,828 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2025-01-09 02:38:55,828 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,664 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,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:38:57,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492540820] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:57,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:38:57,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2025-01-09 02:38:57,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984220577] [2025-01-09 02:38:57,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:38:57,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-01-09 02:38:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:57,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-01-09 02:38:57,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=4293, Unknown=7, NotChecked=0, Total=4556 [2025-01-09 02:38:57,839 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:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:02,560 INFO L93 Difference]: Finished difference Result 249 states and 305 transitions. [2025-01-09 02:39:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 02:39:02,560 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:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:02,564 INFO L225 Difference]: With dead ends: 249 [2025-01-09 02:39:02,567 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 02:39:02,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=722, Invalid=9983, Unknown=7, NotChecked=0, Total=10712 [2025-01-09 02:39:02,572 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 532 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 3632 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.7s IncrementalHoareTripleChecker+Time [2025-01-09 02:39:02,572 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.7s Time] [2025-01-09 02:39:02,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 02:39:02,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 143. [2025-01-09 02:39:02,599 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:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions. [2025-01-09 02:39:02,604 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 61 [2025-01-09 02:39:02,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:02,604 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions. [2025-01-09 02:39:02,604 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:02,604 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2025-01-09 02:39:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 02:39:02,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:02,606 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:02,615 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:02,806 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:02,807 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:02,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:02,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1411936029, now seen corresponding path program 1 times [2025-01-09 02:39:02,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:39:02,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482898327] [2025-01-09 02:39:02,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:02,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:39:02,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 02:39:02,824 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,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:02,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:03,016 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:03,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:39:03,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482898327] [2025-01-09 02:39:03,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482898327] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:39:03,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429577856] [2025-01-09 02:39:03,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:03,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:03,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:03,020 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:03,023 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:03,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 02:39:03,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 02:39:03,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:03,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:03,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 02:39:03,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:03,582 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:03,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:39:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429577856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:39:03,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:39:03,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-01-09 02:39:03,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048694130] [2025-01-09 02:39:03,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:39:03,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:39:03,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:39:03,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:39:03,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-09 02:39:03,586 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:04,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:04,016 INFO L93 Difference]: Finished difference Result 291 states and 361 transitions. [2025-01-09 02:39:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 02:39:04,016 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:04,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:04,018 INFO L225 Difference]: With dead ends: 291 [2025-01-09 02:39:04,018 INFO L226 Difference]: Without dead ends: 145 [2025-01-09 02:39:04,018 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:04,019 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:39:04,019 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.2s Time] [2025-01-09 02:39:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-09 02:39:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 127. [2025-01-09 02:39:04,033 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:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2025-01-09 02:39:04,034 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 69 [2025-01-09 02:39:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:04,034 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2025-01-09 02:39:04,035 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:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2025-01-09 02:39:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 02:39:04,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:04,035 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:04,047 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:04,236 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:04,236 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:04,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash -445328766, now seen corresponding path program 1 times [2025-01-09 02:39:04,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:39:04,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248551258] [2025-01-09 02:39:04,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:04,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:39:04,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 02:39:04,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 02:39:04,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:04,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:06,189 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:06,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:39:06,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248551258] [2025-01-09 02:39:06,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248551258] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:39:06,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444092296] [2025-01-09 02:39:06,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:06,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:06,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:06,191 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:06,192 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:06,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 02:39:06,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 02:39:06,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:06,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:06,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 141 conjuncts are in the unsatisfiable core [2025-01-09 02:39:06,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:06,524 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 02:39:06,525 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:06,704 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 02:39:06,705 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:07,210 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2025-01-09 02:39:07,211 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:07,216 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-01-09 02:39:07,216 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:07,223 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:07,264 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2025-01-09 02:39:07,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 49 treesize of output 15 [2025-01-09 02:39:07,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,275 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:07,287 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:07,295 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,295 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,296 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:07,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,319 INFO L349 Elim1Store]: treesize reduction 21, result has 52.3 percent of original size [2025-01-09 02:39:07,320 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:07,324 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,324 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,325 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:07,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,331 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,348 INFO L349 Elim1Store]: treesize reduction 26, result has 58.1 percent of original size [2025-01-09 02:39:07,349 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:07,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,376 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2025-01-09 02:39:07,376 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:07,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,388 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:07,396 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:07,400 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,401 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,401 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:07,405 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,405 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,406 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:07,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,412 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:07,450 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-01-09 02:39:07,450 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:07,473 INFO L349 Elim1Store]: treesize reduction 65, result has 14.5 percent of original size [2025-01-09 02:39:07,473 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:07,488 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,499 INFO L349 Elim1Store]: treesize reduction 51, result has 8.9 percent of original size [2025-01-09 02:39:07,500 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:07,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,510 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:07,515 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:07,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,543 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:07,551 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:07,555 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,555 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,556 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:07,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,564 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:07,621 INFO L349 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2025-01-09 02:39:07,621 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:07,643 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2025-01-09 02:39:07,643 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:07,661 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:07,724 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:07,730 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,731 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:07,738 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:07,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,750 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:07,773 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:07,814 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2025-01-09 02:39:07,814 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:07,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,862 INFO L349 Elim1Store]: treesize reduction 95, result has 12.0 percent of original size [2025-01-09 02:39:07,863 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:07,871 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,875 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 02:39:07,875 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:07,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,902 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:07,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,961 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:07,970 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:07,975 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,975 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:07,976 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:07,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:07,988 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:08,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:08,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:08,034 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:08,042 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:08,046 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:08,046 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:08,047 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:08,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:08,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:08,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:08,062 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:08,111 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2025-01-09 02:39:08,112 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:08,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:08,164 INFO L349 Elim1Store]: treesize reduction 150, result has 8.0 percent of original size [2025-01-09 02:39:08,164 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:08,196 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:08,216 INFO L349 Elim1Store]: treesize reduction 38, result has 32.1 percent of original size [2025-01-09 02:39:08,216 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:08,228 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:08,269 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:08,364 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-01-09 02:39:08,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 02:39:08,565 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:08,566 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:08,581 INFO L158 Benchmark]: Toolchain (without parser) took 24617.77ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 128.9MB in the beginning and 378.7MB in the end (delta: -249.8MB). Peak memory consumption was 285.9MB. Max. memory is 16.1GB. [2025-01-09 02:39:08,581 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 192.9MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:39:08,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.93ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 109.2MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:39:08,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.35ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.1MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:39:08,581 INFO L158 Benchmark]: Boogie Preprocessor took 64.11ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 102.8MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:39:08,581 INFO L158 Benchmark]: RCFGBuilder took 397.74ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 82.2MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 02:39:08,581 INFO L158 Benchmark]: TraceAbstraction took 23629.81ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 81.7MB in the beginning and 378.7MB in the end (delta: -297.0MB). Peak memory consumption was 235.5MB. Max. memory is 16.1GB. [2025-01-09 02:39:08,582 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.19ms. Allocated memory is still 192.9MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.93ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 109.2MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.35ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.1MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.11ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 102.8MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 397.74ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 82.2MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23629.81ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 81.7MB in the beginning and 378.7MB in the end (delta: -297.0MB). Peak memory consumption was 235.5MB. 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:08,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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.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 cee8df08ffad3eb9e493a0be0076215dd3a59bce6d2370397b3bb712a7fad867 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:39:10,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:39:10,605 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:10,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:39:10,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:39:10,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:39:10,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:39:10,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:39:10,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:39:10,641 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:39:10,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:39:10,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:39:10,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:39:10,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:39:10,642 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:39:10,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:39:10,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:39:10,643 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:39:10,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:39:10,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:39:10,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:39:10,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:39:10,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:39:10,643 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 02:39:10,644 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 02:39:10,644 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 02:39:10,644 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:39:10,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:39:10,644 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:39:10,644 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:39:10,644 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:39:10,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:39:10,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:39:10,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:39:10,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:39:10,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:39:10,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:39:10,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:39:10,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:39:10,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:39:10,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:39:10,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:39:10,646 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:39:10,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:39:10,646 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 02:39:10,646 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 02:39:10,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:39:10,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:39:10,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:39:10,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:39:10,646 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 -> cee8df08ffad3eb9e493a0be0076215dd3a59bce6d2370397b3bb712a7fad867 [2025-01-09 02:39:10,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:39:10,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:39:10,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:39:10,863 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:39:10,863 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:39:10,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex.i [2025-01-09 02:39:12,037 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c89ed7093/ab7df94aae0a4797870afbe27ff9d7cd/FLAGec176bd24 [2025-01-09 02:39:12,298 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:39:12,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex.i [2025-01-09 02:39:12,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c89ed7093/ab7df94aae0a4797870afbe27ff9d7cd/FLAGec176bd24 [2025-01-09 02:39:12,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c89ed7093/ab7df94aae0a4797870afbe27ff9d7cd [2025-01-09 02:39:12,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:39:12,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:39:12,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:39:12,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:39:12,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:39:12,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:39:12" (1/1) ... [2025-01-09 02:39:12,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f67bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:12, skipping insertion in model container [2025-01-09 02:39:12,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:39:12" (1/1) ... [2025-01-09 02:39:12,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:39:12,840 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:12,854 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.i[25842,25855] [2025-01-09 02:39:12,857 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.i[25967,25980] [2025-01-09 02:39:12,858 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.i[26082,26095] [2025-01-09 02:39:12,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:39:12,867 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-01-09 02:39:12,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:39:12,903 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:12,909 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.i[25842,25855] [2025-01-09 02:39:12,910 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.i[25967,25980] [2025-01-09 02:39:12,911 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.i[26082,26095] [2025-01-09 02:39:12,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:39:12,913 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:39:12,939 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.i[25842,25855] [2025-01-09 02:39:12,940 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.i[25967,25980] [2025-01-09 02:39:12,940 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.i[26082,26095] [2025-01-09 02:39:12,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:39:12,961 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:39:12,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:12 WrapperNode [2025-01-09 02:39:12,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:39:12,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:39:12,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:39:12,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:39:12,966 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:12" (1/1) ... [2025-01-09 02:39:12,979 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:12" (1/1) ... [2025-01-09 02:39:13,003 INFO L138 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 133 [2025-01-09 02:39:13,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:39:13,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:39:13,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:39:13,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:39:13,014 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:12" (1/1) ... [2025-01-09 02:39:13,014 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:12" (1/1) ... [2025-01-09 02:39:13,017 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:12" (1/1) ... [2025-01-09 02:39:13,053 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:13,056 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:12" (1/1) ... [2025-01-09 02:39:13,056 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:12" (1/1) ... [2025-01-09 02:39:13,062 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:12" (1/1) ... [2025-01-09 02:39:13,063 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:12" (1/1) ... [2025-01-09 02:39:13,067 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:12" (1/1) ... [2025-01-09 02:39:13,068 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:12" (1/1) ... [2025-01-09 02:39:13,069 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:12" (1/1) ... [2025-01-09 02:39:13,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:39:13,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:39:13,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:39:13,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:39:13,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:12" (1/1) ... [2025-01-09 02:39:13,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:39:13,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:13,115 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:13,123 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:13,138 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-01-09 02:39:13,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-01-09 02:39:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-01-09 02:39:13,139 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-01-09 02:39:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:39:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-01-09 02:39:13,140 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-01-09 02:39:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:39:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:39:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:39:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2025-01-09 02:39:13,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2025-01-09 02:39:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:39:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:39:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:39:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:39:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:39:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 02:39:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 02:39:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2025-01-09 02:39:13,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2025-01-09 02:39:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:39:13,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:39:13,239 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:39:13,241 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:39:13,648 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-01-09 02:39:13,648 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:39:13,656 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:39:13,657 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:39:13,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:39:13 BoogieIcfgContainer [2025-01-09 02:39:13,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:39:13,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:39:13,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:39:13,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:39:13,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:39:12" (1/3) ... [2025-01-09 02:39:13,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4929ac15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:39:13, skipping insertion in model container [2025-01-09 02:39:13,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:39:12" (2/3) ... [2025-01-09 02:39:13,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4929ac15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:39:13, skipping insertion in model container [2025-01-09 02:39:13,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:39:13" (3/3) ... [2025-01-09 02:39:13,666 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex.i [2025-01-09 02:39:13,675 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:39:13,676 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex.i that has 6 procedures, 65 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-01-09 02:39:13,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:39:13,719 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;@5a988063, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:39:13,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 02:39:13,722 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:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:39:13,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:13,726 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:13,726 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:13,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:13,730 INFO L85 PathProgramCache]: Analyzing trace with hash -319203762, now seen corresponding path program 1 times [2025-01-09 02:39:13,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 02:39:13,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012371126] [2025-01-09 02:39:13,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:13,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:13,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:13,740 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:13,742 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:13,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:39:13,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:39:13,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:13,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:13,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 02:39:13,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:13,854 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:13,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:39:13,854 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 02:39:13,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012371126] [2025-01-09 02:39:13,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012371126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:39:13,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:39:13,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 02:39:13,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102354508] [2025-01-09 02:39:13,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:39:13,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:39:13,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 02:39:13,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:39:13,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:39:13,873 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:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:13,887 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2025-01-09 02:39:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:39:13,888 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:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:13,892 INFO L225 Difference]: With dead ends: 126 [2025-01-09 02:39:13,892 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 02:39:13,894 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:13,895 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:13,896 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:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 02:39:13,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 02:39:13,914 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:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2025-01-09 02:39:13,917 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 26 [2025-01-09 02:39:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:13,918 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2025-01-09 02:39:13,918 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:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2025-01-09 02:39:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:39:13,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:13,919 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:13,925 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:39:14,119 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:14,119 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:14,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:14,120 INFO L85 PathProgramCache]: Analyzing trace with hash -907619186, now seen corresponding path program 1 times [2025-01-09 02:39:14,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 02:39:14,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925451265] [2025-01-09 02:39:14,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:14,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:14,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:14,123 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:14,125 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:14,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:39:14,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:39:14,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:14,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:14,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 02:39:14,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:14,243 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:14,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:39:14,243 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 02:39:14,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925451265] [2025-01-09 02:39:14,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925451265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:39:14,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:39:14,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:39:14,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131250906] [2025-01-09 02:39:14,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:39:14,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:39:14,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 02:39:14,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:39:14,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:39:14,245 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:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:14,262 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2025-01-09 02:39:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:39:14,265 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:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:14,267 INFO L225 Difference]: With dead ends: 65 [2025-01-09 02:39:14,269 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 02:39:14,269 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:14,269 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:14,270 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:14,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 02:39:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-09 02:39:14,280 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:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-01-09 02:39:14,283 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 26 [2025-01-09 02:39:14,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:14,283 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-01-09 02:39:14,283 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:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-01-09 02:39:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 02:39:14,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:14,285 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:14,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 02:39:14,489 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:14,489 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:14,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1753054477, now seen corresponding path program 1 times [2025-01-09 02:39:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 02:39:14,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48205035] [2025-01-09 02:39:14,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:14,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:14,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:14,494 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:14,495 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:14,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:39:14,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 02:39:14,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:14,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:14,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 02:39:14,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:14,973 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:14,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:39:14,973 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 02:39:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48205035] [2025-01-09 02:39:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48205035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:39:14,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:39:14,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:39:14,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816116101] [2025-01-09 02:39:14,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:39:14,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:39:14,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 02:39:14,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:39:14,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:39:14,975 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:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:15,375 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2025-01-09 02:39:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:39:15,376 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:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:15,377 INFO L225 Difference]: With dead ends: 168 [2025-01-09 02:39:15,377 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 02:39:15,378 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:15,379 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:15,379 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:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 02:39:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2025-01-09 02:39:15,391 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:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2025-01-09 02:39:15,393 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 27 [2025-01-09 02:39:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:15,393 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2025-01-09 02:39:15,393 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:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2025-01-09 02:39:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 02:39:15,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:15,395 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:15,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 02:39:15,595 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:15,596 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:15,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:15,596 INFO L85 PathProgramCache]: Analyzing trace with hash -818305067, now seen corresponding path program 1 times [2025-01-09 02:39:15,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 02:39:15,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029742005] [2025-01-09 02:39:15,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:15,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:15,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:15,599 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:15,604 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:15,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 02:39:15,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 02:39:15,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:15,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:15,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 02:39:15,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:15,712 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:15,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:39:15,713 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 02:39:15,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029742005] [2025-01-09 02:39:15,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029742005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:39:15,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:39:15,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:39:15,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717662127] [2025-01-09 02:39:15,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:39:15,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:39:15,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 02:39:15,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:39:15,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:39:15,714 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:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:15,732 INFO L93 Difference]: Finished difference Result 178 states and 225 transitions. [2025-01-09 02:39:15,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:39:15,732 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:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:15,733 INFO L225 Difference]: With dead ends: 178 [2025-01-09 02:39:15,733 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 02:39:15,734 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:15,734 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:15,735 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:15,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 02:39:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 02:39:15,751 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:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2025-01-09 02:39:15,752 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 62 [2025-01-09 02:39:15,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:15,754 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2025-01-09 02:39:15,754 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:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2025-01-09 02:39:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 02:39:15,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:15,757 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:15,764 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:15,957 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:15,958 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:15,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash 105945865, now seen corresponding path program 1 times [2025-01-09 02:39:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 02:39:15,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [536992085] [2025-01-09 02:39:15,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:15,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:15,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:15,961 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:15,962 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:16,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 02:39:16,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 02:39:16,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:16,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:16,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 02:39:16,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:16,197 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,203 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,422 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:16,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:39:16,423 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 02:39:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536992085] [2025-01-09 02:39:16,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536992085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:39:16,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:39:16,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 02:39:16,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345582942] [2025-01-09 02:39:16,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:39:16,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:39:16,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 02:39:16,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:39:16,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:39:16,425 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:17,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:17,422 INFO L93 Difference]: Finished difference Result 232 states and 291 transitions. [2025-01-09 02:39:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 02:39:17,423 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:17,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:17,424 INFO L225 Difference]: With dead ends: 232 [2025-01-09 02:39:17,424 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 02:39:17,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-01-09 02:39:17,426 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:17,427 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:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 02:39:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 97. [2025-01-09 02:39:17,446 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:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2025-01-09 02:39:17,449 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 64 [2025-01-09 02:39:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:17,449 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2025-01-09 02:39:17,450 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:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2025-01-09 02:39:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 02:39:17,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:17,450 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:17,457 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:17,651 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:17,651 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:17,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:17,652 INFO L85 PathProgramCache]: Analyzing trace with hash -377011612, now seen corresponding path program 1 times [2025-01-09 02:39:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 02:39:17,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [256844017] [2025-01-09 02:39:17,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:39:17,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:17,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:17,658 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:17,659 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:17,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 02:39:17,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 02:39:17,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:39:17,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:17,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-01-09 02:39:17,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:17,822 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:18,003 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-01-09 02:39:18,003 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:18,064 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:18,316 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:18,334 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:18,387 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:18,469 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:18,487 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:18,494 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:18,510 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:18,532 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:18,548 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:18,563 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:18,646 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:18,685 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:18,695 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:18,698 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:18,888 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2025-01-09 02:39:18,889 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:18,967 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:18,978 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:18,988 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:18,995 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:19,039 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2025-01-09 02:39:19,039 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:19,071 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:19,091 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:19,119 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:19,160 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:23,323 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:23,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:23,413 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:23,430 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:23,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:23,505 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:23,521 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:23,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:23,732 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:23,746 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:23,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:23,871 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:23,884 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:23,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:39:23,957 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:28,310 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:33,283 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:38,109 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv0 32) |c_~#mutexes~0.offset|) (let ((.cse31 (select |c_old(#memory_$Pointer$#1.base)| |c_~#mutexes~0.base|)) (.cse16 (select |c_#memory_$Pointer$#1.offset| |c_mutex_lock_#in~m#1.base|))) (let ((.cse17 (select .cse16 (_ bv4 32))) (.cse0 (store |c_old(#memory_$Pointer$#1.base)| |c_~#mutexes~0.base| (store .cse31 (_ bv0 32) |c_mutex_lock_#in~m#1.base|))) (.cse8 (select .cse31 (_ bv0 32)))) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_~#mutexes~0.base|)) (.cse24 (= |c_~#mutexes~0.base| .cse8)) (.cse1 (select .cse0 |c_mutex_lock_#in~m#1.base|)) (.cse15 (bvadd (_ bv4 32) .cse17))) (let ((.cse4 (= |c_mutex_lock_#in~m#1.base| |c_~#mutexes~0.base|)) (.cse13 (store (select (store .cse0 |c_mutex_lock_#in~m#1.base| (store .cse1 .cse15 |c_~#mutexes~0.base|)) |c_~#mutexes~0.base|) (_ bv4 32) |c_mutex_lock_#in~m#1.base|)) (.cse11 (not .cse24)) (.cse3 (= (_ bv4 32) (select .cse2 (_ bv0 32)))) (.cse6 (store |c_old(#memory_$Pointer$#1.base)| .cse8 .cse23))) (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 (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (v_ArrVal_58 (_ BitVec 32)) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_59 (_ BitVec 32))) (let ((.cse7 (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 ((.cse5 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse7)) (.cse10 (bvadd (_ bv4 32) (select v_DerPreprocessor_10 (_ bv4 32))))) (and (= .cse2 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| (select (select .cse5 |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 .cse6 |mutex_lock_ldv_list_add_~new#1.base| (store (store .cse7 (_ bv4 32) v_ArrVal_59) (_ bv8 32) v_ArrVal_58)) |c_~#mutexes~0.base| (store (select (let ((.cse9 (store (select .cse5 .cse8) .cse10 |mutex_lock_ldv_list_add_~new#1.base|))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse8 .cse9) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse5 .cse8 .cse9) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse8) (_ bv8 32) v_ArrVal_58))) |c_~#mutexes~0.base|) (_ bv0 32) |mutex_lock_ldv_list_add_~new#1.base|)) |c_#memory_$Pointer$#1.base|) (not (= .cse8 |mutex_lock_ldv_list_add_~new#1.base|)) (= (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_10) .cse8) .cse10)) (not (= |c_~#mutexes~0.base| |mutex_lock_ldv_list_add_~new#1.base|)))))) .cse11) (and (let ((.cse12 (exists ((v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (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 .cse14) (= (_ bv4 32) (select v_arrayElimArr_2 .cse15)) (= .cse16 (store (store (store .cse14 (_ bv4 32) .cse17) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (_ bv4 32)))))))) (or (and .cse12 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$#1.base)| |c_~#mutexes~0.base| (store (store .cse13 (_ 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 .cse13 (_ bv8 32) v_arrayElimCell_29) (_ bv0 32) |c_~#mutexes~0.base|)) |c_#memory_$Pointer$#1.base|)) .cse12))) .cse4) (and .cse4 (let ((.cse18 (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (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 .cse15)) (= (store (store (store .cse19 (_ bv4 32) .cse17) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (_ bv4 32)) .cse16) (= .cse19 v_DerPreprocessor_4)))))) (or (and .cse18 (exists ((v_arrayElimCell_27 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$#1.base)| |c_~#mutexes~0.base| (store (store .cse13 (_ bv8 32) v_arrayElimCell_27) (_ bv0 32) |c_~#mutexes~0.base|)) |c_#memory_$Pointer$#1.base|))) (and .cse18 (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$#1.base)| |c_~#mutexes~0.base| (store (store .cse13 (_ bv8 32) v_arrayElimCell_26) (_ bv0 32) |c_~#mutexes~0.base|)) |c_#memory_$Pointer$#1.base|)))))) (and .cse11 .cse3 (exists ((v_DerPreprocessor_3 (_ BitVec 32))) (= (store .cse6 |c_~#mutexes~0.base| (store (select (let ((.cse22 (store |c_old(#memory_$Pointer$#1.base)| .cse8 (store (select |c_old(#memory_$Pointer$#1.base)| .cse8) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse20 (select (select .cse22 |c_~#mutexes~0.base|) (_ bv0 32)))) (let ((.cse21 (store (select .cse22 .cse20) (bvadd v_DerPreprocessor_3 (_ bv4 32)) .cse8))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse20 .cse21) .cse8 (store (store (select (store .cse22 .cse20 .cse21) .cse8) (_ bv4 32) .cse20) (_ bv8 32) (select .cse23 (_ bv8 32))))))) |c_~#mutexes~0.base|) (_ bv0 32) .cse8)) |c_#memory_$Pointer$#1.base|))) (let ((.cse25 (select |c_#memory_$Pointer$#1.offset| .cse8))) (and .cse24 (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (v_ArrVal_58 (_ BitVec 32)) (v_ArrVal_59 (_ BitVec 32))) (let ((.cse26 (bvadd v_DerPreprocessor_6 (_ bv4 32)))) (and (= (_ bv4 32) (select .cse25 .cse26)) (= |c_#memory_$Pointer$#1.base| (let ((.cse27 (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 .cse27 (_ bv4 32) v_ArrVal_59) (_ bv8 32) v_ArrVal_58)) |c_~#mutexes~0.base| (store (select (let ((.cse30 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse27))) (let ((.cse28 (select (select .cse30 |c_~#mutexes~0.base|) (_ bv0 32)))) (let ((.cse29 (store (select .cse30 .cse28) .cse26 |mutex_lock_ldv_list_add_~new#1.base|))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse28 .cse29) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse30 .cse28 .cse29) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse28) (_ bv8 32) v_ArrVal_58))))) |c_~#mutexes~0.base|) (_ bv0 32) |mutex_lock_ldv_list_add_~new#1.base|)))) (not (= |c_~#mutexes~0.base| |mutex_lock_ldv_list_add_~new#1.base|))))) (= (_ bv4 32) (select .cse25 (_ bv0 32))))))))))) is different from false