./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c4f91361 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd310154a8f082280317f3bf1f868dbee13522304c8e13d29736e7fb8b36c7cf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-c4f9136-m [2023-11-23 14:27:22,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 14:27:22,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 14:27:22,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 14:27:22,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 14:27:22,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 14:27:22,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 14:27:22,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 14:27:22,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 14:27:22,619 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 14:27:22,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 14:27:22,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 14:27:22,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 14:27:22,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 14:27:22,621 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 14:27:22,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 14:27:22,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 14:27:22,622 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 14:27:22,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 14:27:22,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 14:27:22,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 14:27:22,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 14:27:22,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 14:27:22,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 14:27:22,624 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 14:27:22,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 14:27:22,624 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 14:27:22,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 14:27:22,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 14:27:22,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 14:27:22,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 14:27:22,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 14:27:22,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 14:27:22,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 14:27:22,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 14:27:22,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 14:27:22,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 14:27:22,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 14:27:22,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 14:27:22,627 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 14:27:22,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 14:27:22,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 14:27:22,628 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd310154a8f082280317f3bf1f868dbee13522304c8e13d29736e7fb8b36c7cf [2023-11-23 14:27:22,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 14:27:22,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 14:27:22,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 14:27:22,862 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 14:27:22,862 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 14:27:22,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i [2023-11-23 14:27:23,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 14:27:24,185 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 14:27:24,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i [2023-11-23 14:27:24,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a20350a64/d4b75f279dfb4408aa2981f1abb45ae2/FLAGb08c3c3cd [2023-11-23 14:27:24,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a20350a64/d4b75f279dfb4408aa2981f1abb45ae2 [2023-11-23 14:27:24,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 14:27:24,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 14:27:24,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 14:27:24,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 14:27:24,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 14:27:24,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:27:24" (1/1) ... [2023-11-23 14:27:24,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aaf8e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24, skipping insertion in model container [2023-11-23 14:27:24,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:27:24" (1/1) ... [2023-11-23 14:27:24,271 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 14:27:24,559 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[25842,25855] [2023-11-23 14:27:24,564 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[25967,25980] [2023-11-23 14:27:24,568 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[26082,26095] [2023-11-23 14:27:24,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 14:27:24,583 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 14:27:24,618 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[25842,25855] [2023-11-23 14:27:24,618 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[25967,25980] [2023-11-23 14:27:24,619 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[26082,26095] [2023-11-23 14:27:24,620 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 14:27:24,642 INFO L206 MainTranslator]: Completed translation [2023-11-23 14:27:24,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24 WrapperNode [2023-11-23 14:27:24,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 14:27:24,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 14:27:24,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 14:27:24,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 14:27:24,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24" (1/1) ... [2023-11-23 14:27:24,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24" (1/1) ... [2023-11-23 14:27:24,688 INFO L138 Inliner]: procedures = 139, calls = 56, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 137 [2023-11-23 14:27:24,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 14:27:24,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 14:27:24,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 14:27:24,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 14:27:24,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24" (1/1) ... [2023-11-23 14:27:24,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24" (1/1) ... [2023-11-23 14:27:24,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24" (1/1) ... [2023-11-23 14:27:24,725 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 7 writes are split as follows [0, 7]. [2023-11-23 14:27:24,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24" (1/1) ... [2023-11-23 14:27:24,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24" (1/1) ... [2023-11-23 14:27:24,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24" (1/1) ... [2023-11-23 14:27:24,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24" (1/1) ... [2023-11-23 14:27:24,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24" (1/1) ... [2023-11-23 14:27:24,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24" (1/1) ... [2023-11-23 14:27:24,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 14:27:24,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 14:27:24,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 14:27:24,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 14:27:24,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24" (1/1) ... [2023-11-23 14:27:24,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 14:27:24,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:27:24,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 14:27:24,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 14:27:24,821 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-11-23 14:27:24,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-11-23 14:27:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 14:27:24,823 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-11-23 14:27:24,824 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-11-23 14:27:24,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 14:27:24,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 14:27:24,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 14:27:24,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-11-23 14:27:24,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-11-23 14:27:24,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 14:27:24,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 14:27:24,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 14:27:24,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 14:27:24,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 14:27:24,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 14:27:24,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 14:27:24,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-11-23 14:27:24,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-11-23 14:27:24,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 14:27:24,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 14:27:24,949 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 14:27:24,951 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 14:27:25,147 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 14:27:25,191 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 14:27:25,195 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 14:27:25,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:27:25 BoogieIcfgContainer [2023-11-23 14:27:25,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 14:27:25,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 14:27:25,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 14:27:25,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 14:27:25,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:27:24" (1/3) ... [2023-11-23 14:27:25,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311a776a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:27:25, skipping insertion in model container [2023-11-23 14:27:25,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:27:24" (2/3) ... [2023-11-23 14:27:25,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311a776a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:27:25, skipping insertion in model container [2023-11-23 14:27:25,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:27:25" (3/3) ... [2023-11-23 14:27:25,204 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unlock_at_exit.i [2023-11-23 14:27:25,217 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 14:27:25,218 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-23 14:27:25,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 14:27:25,259 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2aa14e01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 14:27:25,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-23 14:27:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 37 states have internal predecessors, (48), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-23 14:27:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 14:27:25,269 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:27:25,269 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:27:25,270 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:27:25,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:27:25,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1726020281, now seen corresponding path program 1 times [2023-11-23 14:27:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:27:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925780855] [2023-11-23 14:27:25,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:27:25,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:27:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:25,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:27:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:25,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:27:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:25,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 14:27:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 14:27:25,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:27:25,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925780855] [2023-11-23 14:27:25,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925780855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:27:25,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:27:25,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 14:27:25,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219283906] [2023-11-23 14:27:25,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:27:25,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 14:27:25,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:27:25,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 14:27:25,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 14:27:25,569 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 37 states have internal predecessors, (48), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 14:27:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:27:25,673 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2023-11-23 14:27:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 14:27:25,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-23 14:27:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:27:25,683 INFO L225 Difference]: With dead ends: 102 [2023-11-23 14:27:25,683 INFO L226 Difference]: Without dead ends: 51 [2023-11-23 14:27:25,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 14:27:25,690 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:27:25,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 61 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:27:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-23 14:27:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2023-11-23 14:27:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-23 14:27:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-11-23 14:27:25,732 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 24 [2023-11-23 14:27:25,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:27:25,733 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-11-23 14:27:25,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 14:27:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-11-23 14:27:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 14:27:25,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:27:25,735 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:27:25,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 14:27:25,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:27:25,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:27:25,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1711785163, now seen corresponding path program 1 times [2023-11-23 14:27:25,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:27:25,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429652341] [2023-11-23 14:27:25,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:27:25,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:27:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:27:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:27:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 14:27:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 14:27:26,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:27:26,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429652341] [2023-11-23 14:27:26,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429652341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:27:26,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:27:26,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 14:27:26,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578378873] [2023-11-23 14:27:26,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:27:26,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 14:27:26,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:27:26,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 14:27:26,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 14:27:26,194 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 14:27:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:27:26,540 INFO L93 Difference]: Finished difference Result 147 states and 184 transitions. [2023-11-23 14:27:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 14:27:26,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-11-23 14:27:26,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:27:26,542 INFO L225 Difference]: With dead ends: 147 [2023-11-23 14:27:26,543 INFO L226 Difference]: Without dead ends: 104 [2023-11-23 14:27:26,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-23 14:27:26,544 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 115 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 14:27:26,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 160 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 14:27:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-23 14:27:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2023-11-23 14:27:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 58 states have internal predecessors, (65), 14 states have call successors, (14), 7 states have call predecessors, (14), 9 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2023-11-23 14:27:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2023-11-23 14:27:26,556 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 24 [2023-11-23 14:27:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:27:26,556 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2023-11-23 14:27:26,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 14:27:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2023-11-23 14:27:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 14:27:26,557 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:27:26,557 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:27:26,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 14:27:26,557 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:27:26,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:27:26,558 INFO L85 PathProgramCache]: Analyzing trace with hash 137181858, now seen corresponding path program 1 times [2023-11-23 14:27:26,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:27:26,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356505734] [2023-11-23 14:27:26,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:27:26,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:27:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:27:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:27:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 14:27:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 14:27:26,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:27:26,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356505734] [2023-11-23 14:27:26,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356505734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:27:26,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:27:26,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 14:27:26,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957956857] [2023-11-23 14:27:26,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:27:26,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 14:27:26,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:27:26,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 14:27:26,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 14:27:26,622 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 14:27:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:27:26,732 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2023-11-23 14:27:26,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 14:27:26,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-11-23 14:27:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:27:26,733 INFO L225 Difference]: With dead ends: 87 [2023-11-23 14:27:26,734 INFO L226 Difference]: Without dead ends: 85 [2023-11-23 14:27:26,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 14:27:26,735 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:27:26,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 131 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:27:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-23 14:27:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2023-11-23 14:27:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 61 states have internal predecessors, (67), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21) [2023-11-23 14:27:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2023-11-23 14:27:26,743 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 24 [2023-11-23 14:27:26,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:27:26,744 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2023-11-23 14:27:26,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 14:27:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2023-11-23 14:27:26,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-23 14:27:26,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:27:26,746 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:27:26,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 14:27:26,746 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:27:26,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:27:26,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1808531088, now seen corresponding path program 1 times [2023-11-23 14:27:26,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:27:26,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892883614] [2023-11-23 14:27:26,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:27:26,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:27:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:27:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:27:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 14:27:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:27:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 14:27:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 14:27:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 14:27:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 14:27:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-23 14:27:26,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:27:26,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892883614] [2023-11-23 14:27:26,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892883614] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:27:26,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029055282] [2023-11-23 14:27:26,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:27:26,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:27:26,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:27:26,909 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:27:26,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 14:27:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:27,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 14:27:27,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:27:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 14:27:27,096 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 14:27:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029055282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:27:27,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 14:27:27,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2023-11-23 14:27:27,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334271991] [2023-11-23 14:27:27,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:27:27,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 14:27:27,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:27:27,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 14:27:27,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 14:27:27,098 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 14:27:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:27:27,136 INFO L93 Difference]: Finished difference Result 143 states and 175 transitions. [2023-11-23 14:27:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 14:27:27,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2023-11-23 14:27:27,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:27:27,138 INFO L225 Difference]: With dead ends: 143 [2023-11-23 14:27:27,138 INFO L226 Difference]: Without dead ends: 89 [2023-11-23 14:27:27,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 14:27:27,139 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:27:27,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:27:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-23 14:27:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-23 14:27:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.180327868852459) internal successors, (72), 65 states have internal predecessors, (72), 14 states have call successors, (14), 7 states have call predecessors, (14), 11 states have return successors, (22), 16 states have call predecessors, (22), 14 states have call successors, (22) [2023-11-23 14:27:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2023-11-23 14:27:27,147 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 55 [2023-11-23 14:27:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:27:27,148 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2023-11-23 14:27:27,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 14:27:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2023-11-23 14:27:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-23 14:27:27,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:27:27,150 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:27:27,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 14:27:27,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:27:27,363 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:27:27,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:27:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1360828121, now seen corresponding path program 2 times [2023-11-23 14:27:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:27:27,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413408170] [2023-11-23 14:27:27,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:27:27,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:27:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:28,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:27:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:28,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:27:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:28,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 14:27:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:29,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:27:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:29,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 14:27:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 14:27:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:29,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 14:27:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:29,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 14:27:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:27:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 14:27:29,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:27:29,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413408170] [2023-11-23 14:27:29,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413408170] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:27:29,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739159788] [2023-11-23 14:27:29,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 14:27:29,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:27:29,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:27:29,498 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:27:29,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 14:27:29,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 14:27:29,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 14:27:29,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 155 conjunts are in the unsatisfiable core [2023-11-23 14:27:29,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:27:29,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 14:27:30,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 14:27:30,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 14:27:31,035 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-11-23 14:27:31,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2023-11-23 14:27:31,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-23 14:27:31,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-23 14:27:31,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-23 14:27:31,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-23 14:27:31,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 14:27:31,961 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 14:27:31,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 86 [2023-11-23 14:27:31,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 14:27:31,998 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-23 14:27:31,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 53 [2023-11-23 14:28:30,839 WARN L293 SmtUtils]: Spent 54.49s on a formula simplification. DAG size of input: 285 DAG size of output: 276 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-23 14:28:33,589 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_~#mutexes~0.offset| 0) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| 3))) (let ((.cse8 (select .cse6 0))) (let ((.cse9 (store (select |c_old(#memory_$Pointer$#1.base)| .cse8) 0 |c_mutex_lock_#in~m#1.base|))) (let ((.cse30 (store |c_old(#memory_$Pointer$#1.base)| .cse8 .cse9))) (let ((.cse28 (select (select .cse30 3) 0))) (let ((.cse12 (not (= .cse8 3))) (.cse10 (select (select |c_#memory_$Pointer$#1.base| .cse8) 8)) (.cse11 (= .cse28 3)) (.cse26 (= |c_mutex_lock_#in~m#1.base| 3)) (.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| 3) 0) 4)) (.cse25 (select .cse6 8)) (.cse23 (select |c_old(#memory_$Pointer$#1.base)| 3))) (or (and .cse0 (or (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (let ((.cse4 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse1 (select .cse4 3))) (and (= (select .cse1 0) 3) (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)) (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse5 (+ __ldv_list_add_~next.offset 4))) (and (= (let ((.cse3 (store .cse1 .cse5 (select .cse6 .cse5)))) (let ((.cse2 (store (store (select (store .cse4 3 .cse3) |mutex_lock_ldv_list_add_~new#1.base|) 4 3) 8 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) 8)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse2) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse3) |mutex_lock_ldv_list_add_~new#1.base| .cse2) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))) |c_#memory_$Pointer$#1.base|) (not (= .cse5 0))))))))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse7 (store |c_old(#memory_$Pointer$#1.base)| .cse8 (store (store .cse9 4 3) 8 .cse10)))) (store .cse7 3 (store (select .cse7 3) 0 .cse8)))) .cse11 .cse12) (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (let ((.cse16 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse13 (select .cse16 3))) (and (= (select .cse13 0) 3) (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)) (exists ((__ldv_list_add_~next.offset Int)) (and (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)) (= (let ((.cse15 (let ((.cse17 (+ __ldv_list_add_~next.offset 4))) (store .cse13 .cse17 (select .cse6 .cse17))))) (let ((.cse14 (store (store (select (store .cse16 3 .cse15) |mutex_lock_ldv_list_add_~new#1.base|) 4 3) 8 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) 8)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse14) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse15) |mutex_lock_ldv_list_add_~new#1.base| .cse14) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))) |c_#memory_$Pointer$#1.base|))))))) (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (let ((.cse20 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse21 (select .cse20 3))) (and (exists ((__ldv_list_add_~next.offset Int)) (and (not (= __ldv_list_add_~next.offset 4)) (= (let ((.cse19 (let ((.cse22 (+ __ldv_list_add_~next.offset 4))) (store .cse21 .cse22 (select .cse6 .cse22))))) (let ((.cse18 (store (store (select (store .cse20 3 .cse19) |mutex_lock_ldv_list_add_~new#1.base|) 4 3) 8 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) 8)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse18) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse19) |mutex_lock_ldv_list_add_~new#1.base| .cse18) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))) |c_#memory_$Pointer$#1.base|))) (= (select .cse21 0) 3) (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)))))))) (and (or (exists ((__ldv_list_add_~next.offset Int)) (= (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store (let ((.cse24 (+ __ldv_list_add_~next.offset 4))) (store .cse23 .cse24 (select .cse6 .cse24))) 4 3) 8 .cse25) 0 3)) |c_#memory_$Pointer$#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store .cse23 4 3) 8 .cse25) 0 3)))) .cse0 .cse26) (and .cse0 (let ((.cse59 (select |c_#memory_$Pointer$#1.offset| .cse8))) (let ((.cse54 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse63 (store (store (store |c_#memory_$Pointer$#1.offset| .cse28 v_DerPreprocessor_10) .cse8 v_DerPreprocessor_11) 3 v_DerPreprocessor_12))) (and (= (select v_DerPreprocessor_12 0) 4) (= v_DerPreprocessor_10 (select .cse63 .cse28)) (= .cse59 (select .cse63 .cse8)))))) (.cse51 (= .cse28 .cse8)) (.cse53 (select |c_#memory_$Pointer$#1.offset| .cse28))) (let ((.cse40 (or (and .cse54 .cse51) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse62 (store (store (store |c_#memory_$Pointer$#1.offset| .cse28 v_DerPreprocessor_10) .cse8 v_DerPreprocessor_11) 3 v_DerPreprocessor_12))) (let ((.cse61 (select .cse62 .cse28))) (and (= v_DerPreprocessor_12 (store .cse61 0 4)) (= v_DerPreprocessor_10 .cse61) (= .cse61 .cse53) (= .cse59 (select .cse62 .cse8)))))))) (.cse34 (not .cse51)) (.cse35 (not .cse11)) (.cse31 (select .cse30 .cse28)) (.cse33 (select |c_#memory_$Pointer$#1.base| .cse28)) (.cse36 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse60 (store (store (store |c_#memory_$Pointer$#1.offset| .cse28 v_DerPreprocessor_10) .cse8 v_DerPreprocessor_11) 3 v_DerPreprocessor_12))) (let ((.cse58 (select .cse60 .cse28))) (and (= v_DerPreprocessor_12 (store .cse58 0 4)) (= .cse58 .cse53) (= .cse59 (select .cse60 .cse8)))))))) (or (and (exists ((__ldv_list_add_~next.offset Int)) (and (not (= __ldv_list_add_~next.offset 4)) (= |c_#memory_$Pointer$#1.base| (let ((.cse27 (let ((.cse29 (let ((.cse32 (+ __ldv_list_add_~next.offset 4))) (store .cse31 .cse32 (select .cse33 .cse32))))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse28 .cse29) .cse8 (store (store (select (store .cse30 .cse28 .cse29) .cse8) 4 .cse28) 8 .cse10))))) (store .cse27 3 (store (select .cse27 3) 0 .cse8)))))) .cse12 .cse34 .cse35 .cse36) (and (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse39 (+ __ldv_list_add_~next.offset 4))) (and (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)) (= |c_#memory_$Pointer$#1.base| (let ((.cse37 (let ((.cse38 (store .cse31 .cse39 (select .cse33 .cse39)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse28 .cse38) .cse8 (store (store (select (store .cse30 .cse28 .cse38) .cse8) 4 .cse28) 8 .cse10))))) (store .cse37 3 (store (select .cse37 3) 0 .cse8)))) (not (= .cse39 0))))) .cse12 .cse40 .cse35) (and (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse43 (+ __ldv_list_add_~next.offset 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse41 (let ((.cse42 (store .cse31 .cse43 (select .cse33 .cse43)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse28 .cse42) .cse8 (store (store (select (store .cse30 .cse28 .cse42) .cse8) 4 .cse28) 8 .cse10))))) (store .cse41 3 (store (select .cse41 3) 0 .cse8)))) (not (= .cse43 0))))) .cse12 .cse34 .cse35 .cse36) (and (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse46 (+ __ldv_list_add_~next.offset 4))) (and (not (= __ldv_list_add_~next.offset 4)) (= |c_#memory_$Pointer$#1.base| (let ((.cse44 (let ((.cse45 (store .cse31 .cse46 (select .cse33 .cse46)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse28 .cse45) .cse8 (store (store (select (store .cse30 .cse28 .cse45) .cse8) 4 .cse28) 8 .cse10))))) (store .cse44 3 (store (select .cse44 3) 0 .cse8)))) (not (= .cse46 0))))) .cse12 .cse34 .cse35 .cse36) (and (exists ((__ldv_list_add_~next.offset Int)) (and (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)) (= |c_#memory_$Pointer$#1.base| (let ((.cse47 (let ((.cse48 (let ((.cse49 (+ __ldv_list_add_~next.offset 4))) (store .cse31 .cse49 (select .cse33 .cse49))))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse28 .cse48) .cse8 (store (store (select (store .cse30 .cse28 .cse48) .cse8) 4 .cse28) 8 .cse10))))) (store .cse47 3 (store (select .cse47 3) 0 .cse8)))))) .cse12 .cse40 .cse35) (and (= (let ((.cse50 (store |c_old(#memory_$Pointer$#1.base)| .cse8 (store (store .cse9 4 .cse28) 8 .cse10)))) (store .cse50 3 (store (select .cse50 3) 0 .cse8))) |c_#memory_$Pointer$#1.base|) .cse51 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse52 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse28 v_DerPreprocessor_10) .cse8 v_DerPreprocessor_11) 3 v_DerPreprocessor_12) .cse28))) (and (= v_DerPreprocessor_12 (store .cse52 0 4)) (= v_DerPreprocessor_10 .cse52) (= .cse52 .cse53)))) .cse54)) (and .cse12 .cse34 .cse35 (exists ((__ldv_list_add_~next.offset Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse55 (let ((.cse56 (let ((.cse57 (+ __ldv_list_add_~next.offset 4))) (store .cse31 .cse57 (select .cse33 .cse57))))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse28 .cse56) .cse8 (store (store (select (store .cse30 .cse28 .cse56) .cse8) 4 .cse28) 8 .cse10))))) (store .cse55 3 (store (select .cse55 3) 0 .cse8))))) .cse36)))))) (let ((.cse64 (select |c_#memory_$Pointer$#1.offset| |c_mutex_lock_#in~m#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse64 (select (store (store |c_#memory_$Pointer$#1.offset| |c_mutex_lock_#in~m#1.base| v_DerPreprocessor_4) 3 v_DerPreprocessor_5) |c_mutex_lock_#in~m#1.base|)) (= (select v_DerPreprocessor_5 0) 4))) (not .cse26) .cse0 (exists ((v_DerPreprocessor_13 (Array Int Int))) (= (select (store (store |c_#memory_$Pointer$#1.offset| |c_mutex_lock_#in~m#1.base| v_DerPreprocessor_13) 3 (store .cse64 0 4)) |c_mutex_lock_#in~m#1.base|) .cse64)) (let ((.cse66 (store |c_old(#memory_$Pointer$#1.base)| 3 (store .cse23 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse67 (select .cse66 |c_mutex_lock_#in~m#1.base|)) (.cse69 (select |c_#memory_$Pointer$#1.base| |c_mutex_lock_#in~m#1.base|))) (or (exists ((__ldv_list_add_~next.offset Int)) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse65 (let ((.cse68 (+ __ldv_list_add_~next.offset 4))) (store .cse67 .cse68 (select .cse69 .cse68))))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse65) 3 (store (store (store (select (store .cse66 |c_mutex_lock_#in~m#1.base| .cse65) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse25) 0 3)))) (not (= __ldv_list_add_~next.offset 4)))) (exists ((__ldv_list_add_~next.offset Int)) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse70 (let ((.cse71 (+ __ldv_list_add_~next.offset 4))) (store .cse67 .cse71 (select .cse69 .cse71))))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse70) 3 (store (store (store (select (store .cse66 |c_mutex_lock_#in~m#1.base| .cse70) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse25) 0 3)))) (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)))) (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse73 (+ __ldv_list_add_~next.offset 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse72 (store .cse67 .cse73 (select .cse69 .cse73)))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse72) 3 (store (store (store (select (store .cse66 |c_mutex_lock_#in~m#1.base| .cse72) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse25) 0 3)))) (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)) (not (= .cse73 0))))) (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse75 (+ __ldv_list_add_~next.offset 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse74 (store .cse67 .cse75 (select .cse69 .cse75)))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse74) 3 (store (store (store (select (store .cse66 |c_mutex_lock_#in~m#1.base| .cse74) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse25) 0 3)))) (not (= __ldv_list_add_~next.offset 4)) (not (= .cse75 0))))) (exists ((__ldv_list_add_~next.offset Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse76 (let ((.cse77 (+ __ldv_list_add_~next.offset 4))) (store .cse67 .cse77 (select .cse69 .cse77))))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse76) 3 (store (store (store (select (store .cse66 |c_mutex_lock_#in~m#1.base| .cse76) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse25) 0 3))))) (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse79 (+ __ldv_list_add_~next.offset 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse78 (store .cse67 .cse79 (select .cse69 .cse79)))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse78) 3 (store (store (store (select (store .cse66 |c_mutex_lock_#in~m#1.base| .cse78) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse25) 0 3)))) (not (= .cse79 0))))))))))))))))) (= 3 |c_~#mutexes~0.base|)) is different from false [2023-11-23 14:29:32,665 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 211 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15