./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 00:44:42,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 00:44:42,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 00:44:42,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 00:44:42,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 00:44:42,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 00:44:42,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 00:44:42,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 00:44:42,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 00:44:42,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 00:44:42,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 00:44:42,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 00:44:42,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 00:44:42,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 00:44:42,675 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 00:44:42,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 00:44:42,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 00:44:42,676 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 00:44:42,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 00:44:42,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 00:44:42,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 00:44:42,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 00:44:42,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 00:44:42,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 00:44:42,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 00:44:42,678 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 00:44:42,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 00:44:42,678 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 00:44:42,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 00:44:42,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 00:44:42,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 00:44:42,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 00:44:42,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:44:42,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 00:44:42,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 00:44:42,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 00:44:42,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 00:44:42,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 00:44:42,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 00:44:42,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 00:44:42,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 00:44:42,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 00:44:42,681 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 -> d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 [2024-11-22 00:44:42,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 00:44:42,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 00:44:42,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 00:44:42,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 00:44:42,913 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 00:44:42,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2024-11-22 00:44:44,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 00:44:44,399 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 00:44:44,400 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2024-11-22 00:44:44,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1513a22f0/7ba2c54bd54e46fd95d98f8e0752d449/FLAG515da036d [2024-11-22 00:44:44,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1513a22f0/7ba2c54bd54e46fd95d98f8e0752d449 [2024-11-22 00:44:44,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 00:44:44,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 00:44:44,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 00:44:44,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 00:44:44,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 00:44:44,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:44:44" (1/1) ... [2024-11-22 00:44:44,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f15676c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:44, skipping insertion in model container [2024-11-22 00:44:44,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:44:44" (1/1) ... [2024-11-22 00:44:44,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:44:45,054 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2024-11-22 00:44:45,061 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2024-11-22 00:44:45,062 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2024-11-22 00:44:45,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:44:45,072 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 00:44:45,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2024-11-22 00:44:45,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2024-11-22 00:44:45,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2024-11-22 00:44:45,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:44:45,158 INFO L204 MainTranslator]: Completed translation [2024-11-22 00:44:45,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:45 WrapperNode [2024-11-22 00:44:45,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 00:44:45,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 00:44:45,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 00:44:45,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 00:44:45,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:45" (1/1) ... [2024-11-22 00:44:45,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:45" (1/1) ... [2024-11-22 00:44:45,194 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 140 [2024-11-22 00:44:45,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 00:44:45,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 00:44:45,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 00:44:45,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 00:44:45,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:45" (1/1) ... [2024-11-22 00:44:45,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:45" (1/1) ... [2024-11-22 00:44:45,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:45" (1/1) ... [2024-11-22 00:44:45,245 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]. [2024-11-22 00:44:45,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:45" (1/1) ... [2024-11-22 00:44:45,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:45" (1/1) ... [2024-11-22 00:44:45,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:45" (1/1) ... [2024-11-22 00:44:45,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:45" (1/1) ... [2024-11-22 00:44:45,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:45" (1/1) ... [2024-11-22 00:44:45,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:45" (1/1) ... [2024-11-22 00:44:45,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 00:44:45,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 00:44:45,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 00:44:45,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 00:44:45,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:45" (1/1) ... [2024-11-22 00:44:45,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:44:45,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:45,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 00:44:45,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 00:44:45,339 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-22 00:44:45,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-22 00:44:45,340 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2024-11-22 00:44:45,340 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2024-11-22 00:44:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 00:44:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-11-22 00:44:45,341 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-11-22 00:44:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 00:44:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 00:44:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 00:44:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-22 00:44:45,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-22 00:44:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 00:44:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 00:44:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 00:44:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 00:44:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 00:44:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 00:44:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 00:44:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-11-22 00:44:45,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-11-22 00:44:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 00:44:45,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 00:44:45,477 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 00:44:45,480 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 00:44:45,685 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-22 00:44:45,685 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 00:44:45,699 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 00:44:45,701 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 00:44:45,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:44:45 BoogieIcfgContainer [2024-11-22 00:44:45,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 00:44:45,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 00:44:45,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 00:44:45,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 00:44:45,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:44:44" (1/3) ... [2024-11-22 00:44:45,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e67eaea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:44:45, skipping insertion in model container [2024-11-22 00:44:45,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:44:45" (2/3) ... [2024-11-22 00:44:45,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e67eaea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:44:45, skipping insertion in model container [2024-11-22 00:44:45,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:44:45" (3/3) ... [2024-11-22 00:44:45,708 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2024-11-22 00:44:45,724 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 00:44:45,724 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 00:44:45,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 00:44:45,775 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;@65177435, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 00:44:45,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-22 00:44:45,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 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) [2024-11-22 00:44:45,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 00:44:45,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:45,784 INFO L215 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] [2024-11-22 00:44:45,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:45,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash 709034920, now seen corresponding path program 1 times [2024-11-22 00:44:45,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:45,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633866080] [2024-11-22 00:44:45,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:45,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 00:44:45,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:45,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633866080] [2024-11-22 00:44:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633866080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208368725] [2024-11-22 00:44:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:45,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:45,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:45,959 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) [2024-11-22 00:44:45,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 00:44:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:46,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 00:44:46,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 00:44:46,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:44:46,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208368725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:46,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 00:44:46,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 00:44:46,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035893872] [2024-11-22 00:44:46,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:46,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 00:44:46,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:46,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 00:44:46,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:44:46,139 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 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.5) internal successors, (19), 2 states have internal predecessors, (19), 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) [2024-11-22 00:44:46,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:46,179 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2024-11-22 00:44:46,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 00:44:46,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 28 [2024-11-22 00:44:46,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:46,187 INFO L225 Difference]: With dead ends: 136 [2024-11-22 00:44:46,187 INFO L226 Difference]: Without dead ends: 65 [2024-11-22 00:44:46,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:44:46,193 INFO L432 NwaCegarLoop]: 80 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, 80 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 [2024-11-22 00:44:46,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:44:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-22 00:44:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-22 00:44:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 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) [2024-11-22 00:44:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2024-11-22 00:44:46,226 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 28 [2024-11-22 00:44:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:46,227 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2024-11-22 00:44:46,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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) [2024-11-22 00:44:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2024-11-22 00:44:46,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 00:44:46,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:46,228 INFO L215 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] [2024-11-22 00:44:46,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 00:44:46,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 00:44:46,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:46,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2117471768, now seen corresponding path program 1 times [2024-11-22 00:44:46,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:46,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475830029] [2024-11-22 00:44:46,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:46,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 00:44:46,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475830029] [2024-11-22 00:44:46,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475830029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:46,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:44:46,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:44:46,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382106506] [2024-11-22 00:44:46,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:46,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:44:46,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:46,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:44:46,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:44:46,592 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2024-11-22 00:44:46,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:46,609 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-11-22 00:44:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:44:46,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 28 [2024-11-22 00:44:46,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:46,611 INFO L225 Difference]: With dead ends: 71 [2024-11-22 00:44:46,611 INFO L226 Difference]: Without dead ends: 69 [2024-11-22 00:44:46,612 INFO L431 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 [2024-11-22 00:44:46,613 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 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 [2024-11-22 00:44:46,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:44:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-22 00:44:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-22 00:44:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 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) [2024-11-22 00:44:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2024-11-22 00:44:46,622 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 28 [2024-11-22 00:44:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:46,622 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2024-11-22 00:44:46,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2024-11-22 00:44:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2024-11-22 00:44:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 00:44:46,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:46,623 INFO L215 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] [2024-11-22 00:44:46,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 00:44:46,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:46,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash -542868463, now seen corresponding path program 1 times [2024-11-22 00:44:46,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:46,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775111191] [2024-11-22 00:44:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 00:44:46,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:46,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775111191] [2024-11-22 00:44:46,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775111191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:46,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:44:46,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 00:44:46,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456436131] [2024-11-22 00:44:46,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:46,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:44:46,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:46,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:44:46,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:44:46,879 INFO L87 Difference]: Start difference. First operand 69 states and 81 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) [2024-11-22 00:44:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:47,183 INFO L93 Difference]: Finished difference Result 195 states and 245 transitions. [2024-11-22 00:44:47,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 00:44:47,183 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 [2024-11-22 00:44:47,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:47,185 INFO L225 Difference]: With dead ends: 195 [2024-11-22 00:44:47,185 INFO L226 Difference]: Without dead ends: 134 [2024-11-22 00:44:47,189 INFO L431 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 [2024-11-22 00:44:47,190 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 81 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 00:44:47,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 217 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 00:44:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-22 00:44:47,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 111. [2024-11-22 00:44:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 83 states have internal predecessors, (93), 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) [2024-11-22 00:44:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2024-11-22 00:44:47,217 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 28 [2024-11-22 00:44:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:47,217 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2024-11-22 00:44:47,217 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) [2024-11-22 00:44:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2024-11-22 00:44:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-22 00:44:47,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:47,220 INFO L215 NwaCegarLoop]: trace histogram [5, 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] [2024-11-22 00:44:47,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 00:44:47,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:47,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:47,221 INFO L85 PathProgramCache]: Analyzing trace with hash 391053642, now seen corresponding path program 1 times [2024-11-22 00:44:47,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:47,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654548243] [2024-11-22 00:44:47,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:47,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-22 00:44:47,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:47,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654548243] [2024-11-22 00:44:47,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654548243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16475818] [2024-11-22 00:44:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:47,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:47,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:47,332 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) [2024-11-22 00:44:47,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 00:44:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:47,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 00:44:47,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-22 00:44:47,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:44:47,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16475818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:44:47,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 00:44:47,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-22 00:44:47,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827285059] [2024-11-22 00:44:47,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:44:47,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:44:47,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:44:47,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:44:47,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:44:47,485 INFO L87 Difference]: Start difference. First operand 111 states and 137 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) [2024-11-22 00:44:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:44:47,513 INFO L93 Difference]: Finished difference Result 201 states and 248 transitions. [2024-11-22 00:44:47,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:44:47,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 72 [2024-11-22 00:44:47,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:44:47,515 INFO L225 Difference]: With dead ends: 201 [2024-11-22 00:44:47,515 INFO L226 Difference]: Without dead ends: 117 [2024-11-22 00:44:47,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:44:47,516 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 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 [2024-11-22 00:44:47,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:44:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-22 00:44:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-22 00:44:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 87 states have internal predecessors, (98), 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) [2024-11-22 00:44:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2024-11-22 00:44:47,528 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 72 [2024-11-22 00:44:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:44:47,528 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2024-11-22 00:44:47,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) [2024-11-22 00:44:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2024-11-22 00:44:47,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 00:44:47,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:44:47,529 INFO L215 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] [2024-11-22 00:44:47,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 00:44:47,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-22 00:44:47,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:44:47,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:44:47,735 INFO L85 PathProgramCache]: Analyzing trace with hash 336841398, now seen corresponding path program 1 times [2024-11-22 00:44:47,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:44:47,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738887792] [2024-11-22 00:44:47,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:47,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:44:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 00:44:51,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:44:51,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738887792] [2024-11-22 00:44:51,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738887792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:44:51,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993554208] [2024-11-22 00:44:51,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:44:51,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:44:51,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:44:51,647 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:44:51,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 00:44:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:44:51,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 157 conjuncts are in the unsatisfiable core [2024-11-22 00:44:51,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:44:52,068 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 00:44:52,070 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 [2024-11-22 00:44:52,374 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-22 00:44:52,374 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 [2024-11-22 00:44:53,269 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-22 00:44:53,269 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 [2024-11-22 00:44:53,280 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 [2024-11-22 00:44:53,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-22 00:44:53,319 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 [2024-11-22 00:44:53,359 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 [2024-11-22 00:44:53,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:44:53,842 INFO L349 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2024-11-22 00:44:53,843 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 [2024-11-22 00:44:53,938 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 [2024-11-22 00:44:54,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 00:44:54,132 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 [2024-11-22 00:44:55,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:44:55,782 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 [2024-11-22 00:44:55,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:44:55,793 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 [2024-11-22 00:45:25,339 INFO L349 Elim1Store]: treesize reduction 445, result has 25.5 percent of original size [2024-11-22 00:45:25,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 11 new quantified variables, introduced 19 case distinctions, treesize of input 360 treesize of output 572 [2024-11-22 00:45:25,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:45:25,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 141 [2024-11-22 00:45:25,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:45:25,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 460 [2024-11-22 00:45:25,876 INFO L349 Elim1Store]: treesize reduction 38, result has 37.7 percent of original size [2024-11-22 00:45:25,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 152 [2024-11-22 00:45:25,905 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-22 00:45:25,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 00:45:26,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:45:26,111 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Complicated and unsupported kind of self-update: (let ((.cse0 (select v_DerPreprocessor_20 0))) (select (store (store |#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_26) 3 v_arrayElimArr_16) .cse0)) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:205) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:104) 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:124) 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:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) 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:302) 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:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) 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:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2024-11-22 00:45:26,115 INFO L158 Benchmark]: Toolchain (without parser) took 41382.60ms. Allocated memory was 165.7MB in the beginning and 360.7MB in the end (delta: 195.0MB). Free memory was 131.8MB in the beginning and 234.1MB in the end (delta: -102.3MB). Peak memory consumption was 216.5MB. Max. memory is 16.1GB. [2024-11-22 00:45:26,115 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory was 87.8MB in the beginning and 87.7MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 00:45:26,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.41ms. Allocated memory is still 165.7MB. Free memory was 130.7MB in the beginning and 108.7MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 00:45:26,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.74ms. Allocated memory is still 165.7MB. Free memory was 108.7MB in the beginning and 106.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:45:26,116 INFO L158 Benchmark]: Boogie Preprocessor took 66.73ms. Allocated memory is still 165.7MB. Free memory was 106.6MB in the beginning and 101.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 00:45:26,116 INFO L158 Benchmark]: RCFGBuilder took 439.01ms. Allocated memory is still 165.7MB. Free memory was 101.4MB in the beginning and 79.4MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 00:45:26,116 INFO L158 Benchmark]: TraceAbstraction took 40411.44ms. Allocated memory was 165.7MB in the beginning and 360.7MB in the end (delta: 195.0MB). Free memory was 78.3MB in the beginning and 234.1MB in the end (delta: -155.8MB). Peak memory consumption was 161.9MB. Max. memory is 16.1GB. [2024-11-22 00:45:26,117 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.14ms. Allocated memory is still 125.8MB. Free memory was 87.8MB in the beginning and 87.7MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.41ms. Allocated memory is still 165.7MB. Free memory was 130.7MB in the beginning and 108.7MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.74ms. Allocated memory is still 165.7MB. Free memory was 108.7MB in the beginning and 106.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.73ms. Allocated memory is still 165.7MB. Free memory was 106.6MB in the beginning and 101.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 439.01ms. Allocated memory is still 165.7MB. Free memory was 101.4MB in the beginning and 79.4MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 40411.44ms. Allocated memory was 165.7MB in the beginning and 360.7MB in the end (delta: 195.0MB). Free memory was 78.3MB in the beginning and 234.1MB in the end (delta: -155.8MB). Peak memory consumption was 161.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Complicated and unsupported kind of self-update: (let ((.cse0 (select v_DerPreprocessor_20 0))) (select (store (store |#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_26) 3 v_arrayElimArr_16) .cse0)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Complicated and unsupported kind of self-update: (let ((.cse0 (select v_DerPreprocessor_20 0))) (select (store (store |#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_26) 3 v_arrayElimArr_16) .cse0)): de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:233) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-22 00:45:26,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/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 ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 00:45:27,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 00:45:27,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 00:45:27,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 00:45:27,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 00:45:28,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 00:45:28,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 00:45:28,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 00:45:28,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 00:45:28,014 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 00:45:28,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 00:45:28,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 00:45:28,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 00:45:28,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 00:45:28,016 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 00:45:28,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 00:45:28,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 00:45:28,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 00:45:28,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 00:45:28,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 00:45:28,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 00:45:28,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 00:45:28,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 00:45:28,018 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 00:45:28,018 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 00:45:28,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 00:45:28,018 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 00:45:28,019 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 00:45:28,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 00:45:28,019 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 00:45:28,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 00:45:28,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 00:45:28,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 00:45:28,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 00:45:28,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:45:28,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 00:45:28,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 00:45:28,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 00:45:28,021 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 00:45:28,021 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 00:45:28,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 00:45:28,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 00:45:28,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 00:45:28,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 00:45:28,022 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 -> d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 [2024-11-22 00:45:28,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 00:45:28,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 00:45:28,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 00:45:28,300 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 00:45:28,301 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 00:45:28,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2024-11-22 00:45:29,540 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 00:45:29,740 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 00:45:29,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2024-11-22 00:45:29,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce53e17ba/21c5d6aece8d44b9828c1d9b6c53aa61/FLAG3e7b2fb28 [2024-11-22 00:45:30,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce53e17ba/21c5d6aece8d44b9828c1d9b6c53aa61 [2024-11-22 00:45:30,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 00:45:30,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 00:45:30,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 00:45:30,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 00:45:30,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 00:45:30,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:45:30" (1/1) ... [2024-11-22 00:45:30,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b6cc80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30, skipping insertion in model container [2024-11-22 00:45:30,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:45:30" (1/1) ... [2024-11-22 00:45:30,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:45:30,456 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 00:45:30,487 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2024-11-22 00:45:30,494 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2024-11-22 00:45:30,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2024-11-22 00:45:30,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:45:30,512 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 00:45:30,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:45:30,554 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 00:45:30,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2024-11-22 00:45:30,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2024-11-22 00:45:30,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2024-11-22 00:45:30,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:45:30,569 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 00:45:30,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2024-11-22 00:45:30,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2024-11-22 00:45:30,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2024-11-22 00:45:30,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:45:30,651 INFO L204 MainTranslator]: Completed translation [2024-11-22 00:45:30,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30 WrapperNode [2024-11-22 00:45:30,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 00:45:30,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 00:45:30,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 00:45:30,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 00:45:30,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30" (1/1) ... [2024-11-22 00:45:30,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30" (1/1) ... [2024-11-22 00:45:30,695 INFO L138 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 136 [2024-11-22 00:45:30,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 00:45:30,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 00:45:30,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 00:45:30,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 00:45:30,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30" (1/1) ... [2024-11-22 00:45:30,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30" (1/1) ... [2024-11-22 00:45:30,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30" (1/1) ... [2024-11-22 00:45:30,743 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]. [2024-11-22 00:45:30,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30" (1/1) ... [2024-11-22 00:45:30,743 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30" (1/1) ... [2024-11-22 00:45:30,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30" (1/1) ... [2024-11-22 00:45:30,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30" (1/1) ... [2024-11-22 00:45:30,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30" (1/1) ... [2024-11-22 00:45:30,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30" (1/1) ... [2024-11-22 00:45:30,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 00:45:30,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 00:45:30,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 00:45:30,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 00:45:30,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30" (1/1) ... [2024-11-22 00:45:30,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:45:30,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:45:30,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 00:45:30,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 00:45:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-22 00:45:30,824 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-22 00:45:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2024-11-22 00:45:30,825 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2024-11-22 00:45:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 00:45:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-11-22 00:45:30,825 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-11-22 00:45:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 00:45:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 00:45:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 00:45:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-22 00:45:30,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-22 00:45:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 00:45:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 00:45:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 00:45:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 00:45:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 00:45:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 00:45:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 00:45:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-11-22 00:45:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-11-22 00:45:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 00:45:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 00:45:30,926 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 00:45:30,927 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 00:45:31,372 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-22 00:45:31,373 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 00:45:31,385 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 00:45:31,386 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 00:45:31,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:45:31 BoogieIcfgContainer [2024-11-22 00:45:31,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 00:45:31,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 00:45:31,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 00:45:31,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 00:45:31,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:45:30" (1/3) ... [2024-11-22 00:45:31,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632edc7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:45:31, skipping insertion in model container [2024-11-22 00:45:31,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:45:30" (2/3) ... [2024-11-22 00:45:31,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632edc7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:45:31, skipping insertion in model container [2024-11-22 00:45:31,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:45:31" (3/3) ... [2024-11-22 00:45:31,393 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2024-11-22 00:45:31,404 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 00:45:31,405 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 00:45:31,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 00:45:31,457 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;@3b1f8704, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 00:45:31,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-22 00:45:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 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) [2024-11-22 00:45:31,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 00:45:31,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:45:31,469 INFO L215 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] [2024-11-22 00:45:31,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:45:31,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:45:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash 673246785, now seen corresponding path program 1 times [2024-11-22 00:45:31,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:45:31,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695712766] [2024-11-22 00:45:31,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:45:31,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 00:45:31,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:45:31,488 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 00:45:31,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 00:45:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:45:31,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 00:45:31,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:45:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 00:45:31,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:45:31,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:45:31,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695712766] [2024-11-22 00:45:31,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695712766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:45:31,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:45:31,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 00:45:31,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133201483] [2024-11-22 00:45:31,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:45:31,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 00:45:31,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:45:31,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 00:45:31,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:45:31,653 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 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) [2024-11-22 00:45:31,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:45:31,671 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2024-11-22 00:45:31,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 00:45:31,673 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 [2024-11-22 00:45:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:45:31,681 INFO L225 Difference]: With dead ends: 130 [2024-11-22 00:45:31,681 INFO L226 Difference]: Without dead ends: 62 [2024-11-22 00:45:31,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:45:31,685 INFO L432 NwaCegarLoop]: 77 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, 77 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 [2024-11-22 00:45:31,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:45:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-22 00:45:31,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-22 00:45:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 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), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 00:45:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2024-11-22 00:45:31,713 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 27 [2024-11-22 00:45:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:45:31,713 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2024-11-22 00:45:31,713 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) [2024-11-22 00:45:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2024-11-22 00:45:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 00:45:31,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:45:31,715 INFO L215 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] [2024-11-22 00:45:31,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 00:45:31,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 00:45:31,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:45:31,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:45:31,916 INFO L85 PathProgramCache]: Analyzing trace with hash -387762175, now seen corresponding path program 1 times [2024-11-22 00:45:31,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:45:31,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595790975] [2024-11-22 00:45:31,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:45:31,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 00:45:31,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:45:31,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 00:45:31,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 00:45:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:45:32,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 00:45:32,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:45:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 00:45:32,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:45:32,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:45:32,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595790975] [2024-11-22 00:45:32,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595790975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:45:32,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:45:32,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:45:32,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563875008] [2024-11-22 00:45:32,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:45:32,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:45:32,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:45:32,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:45:32,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:45:32,533 INFO L87 Difference]: Start difference. First operand 62 states and 72 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) [2024-11-22 00:45:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:45:32,849 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2024-11-22 00:45:32,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 00:45:32,849 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 [2024-11-22 00:45:32,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:45:32,859 INFO L225 Difference]: With dead ends: 170 [2024-11-22 00:45:32,860 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 00:45:32,862 INFO L431 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 [2024-11-22 00:45:32,863 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 58 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 00:45:32,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 177 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 00:45:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 00:45:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2024-11-22 00:45:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (23), 17 states have call predecessors, (23), 18 states have call successors, (23) [2024-11-22 00:45:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2024-11-22 00:45:32,890 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 27 [2024-11-22 00:45:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:45:32,890 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2024-11-22 00:45:32,890 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) [2024-11-22 00:45:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2024-11-22 00:45:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 00:45:32,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:45:32,891 INFO L215 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] [2024-11-22 00:45:32,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 00:45:33,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 00:45:33,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:45:33,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:45:33,093 INFO L85 PathProgramCache]: Analyzing trace with hash -438555830, now seen corresponding path program 1 times [2024-11-22 00:45:33,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:45:33,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909987382] [2024-11-22 00:45:33,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:45:33,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 00:45:33,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:45:33,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 00:45:33,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 00:45:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:45:33,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 00:45:33,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:45:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 00:45:33,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:45:33,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:45:33,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909987382] [2024-11-22 00:45:33,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909987382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:45:33,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:45:33,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:45:33,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728313100] [2024-11-22 00:45:33,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:45:33,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:45:33,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:45:33,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:45:33,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:45:33,173 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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) [2024-11-22 00:45:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:45:33,202 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2024-11-22 00:45:33,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:45:33,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 [2024-11-22 00:45:33,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:45:33,207 INFO L225 Difference]: With dead ends: 108 [2024-11-22 00:45:33,207 INFO L226 Difference]: Without dead ends: 106 [2024-11-22 00:45:33,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:45:33,209 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 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 [2024-11-22 00:45:33,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:45:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-22 00:45:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2024-11-22 00:45:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 76 states have internal predecessors, (86), 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) [2024-11-22 00:45:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2024-11-22 00:45:33,231 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 27 [2024-11-22 00:45:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:45:33,231 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2024-11-22 00:45:33,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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) [2024-11-22 00:45:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2024-11-22 00:45:33,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 00:45:33,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:45:33,233 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 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] [2024-11-22 00:45:33,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 00:45:33,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 00:45:33,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:45:33,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:45:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash -811626959, now seen corresponding path program 1 times [2024-11-22 00:45:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:45:33,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023644354] [2024-11-22 00:45:33,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:45:33,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 00:45:33,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:45:33,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 00:45:33,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 00:45:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:45:33,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-22 00:45:33,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:45:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-22 00:45:33,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:45:33,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:45:33,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023644354] [2024-11-22 00:45:33,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023644354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:45:33,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:45:33,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 00:45:33,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208116218] [2024-11-22 00:45:33,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:45:33,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 00:45:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:45:33,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 00:45:33,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-22 00:45:33,992 INFO L87 Difference]: Start difference. First operand 104 states and 130 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, (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) [2024-11-22 00:45:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:45:35,196 INFO L93 Difference]: Finished difference Result 268 states and 338 transitions. [2024-11-22 00:45:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 00:45:35,197 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, (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 67 [2024-11-22 00:45:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:45:35,199 INFO L225 Difference]: With dead ends: 268 [2024-11-22 00:45:35,199 INFO L226 Difference]: Without dead ends: 162 [2024-11-22 00:45:35,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2024-11-22 00:45:35,200 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 203 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 00:45:35,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 254 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 00:45:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-22 00:45:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2024-11-22 00:45:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 19 states have call successors, (19), 10 states have call predecessors, (19), 14 states have return successors, (32), 19 states have call predecessors, (32), 19 states have call successors, (32) [2024-11-22 00:45:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2024-11-22 00:45:35,218 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 67 [2024-11-22 00:45:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:45:35,218 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2024-11-22 00:45:35,218 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, (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) [2024-11-22 00:45:35,218 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2024-11-22 00:45:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 00:45:35,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:45:35,224 INFO L215 NwaCegarLoop]: trace histogram [5, 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] [2024-11-22 00:45:35,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 00:45:35,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 00:45:35,425 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:45:35,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:45:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1108503363, now seen corresponding path program 1 times [2024-11-22 00:45:35,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:45:35,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393715669] [2024-11-22 00:45:35,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:45:35,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 00:45:35,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:45:35,429 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 00:45:35,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 00:45:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:45:35,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 00:45:35,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:45:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-22 00:45:35,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:45:35,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 00:45:35,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393715669] [2024-11-22 00:45:35,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393715669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:45:35,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:45:35,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:45:35,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996267847] [2024-11-22 00:45:35,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:45:35,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:45:35,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 00:45:35,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:45:35,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:45:35,565 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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) [2024-11-22 00:45:35,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:45:35,589 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2024-11-22 00:45:35,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:45:35,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 [2024-11-22 00:45:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:45:35,590 INFO L225 Difference]: With dead ends: 196 [2024-11-22 00:45:35,591 INFO L226 Difference]: Without dead ends: 109 [2024-11-22 00:45:35,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:45:35,592 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 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 [2024-11-22 00:45:35,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:45:35,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-22 00:45:35,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2024-11-22 00:45:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 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) [2024-11-22 00:45:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2024-11-22 00:45:35,609 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 67 [2024-11-22 00:45:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:45:35,609 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2024-11-22 00:45:35,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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) [2024-11-22 00:45:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2024-11-22 00:45:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-22 00:45:35,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:45:35,610 INFO L215 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] [2024-11-22 00:45:35,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 00:45:35,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 00:45:35,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:45:35,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:45:35,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1210243856, now seen corresponding path program 1 times [2024-11-22 00:45:35,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 00:45:35,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500475725] [2024-11-22 00:45:35,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:45:35,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 00:45:35,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 00:45:35,815 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 00:45:35,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 00:45:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:45:35,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-22 00:45:35,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:45:36,141 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-22 00:45:36,142 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 14 treesize of output 20 [2024-11-22 00:45:36,295 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2024-11-22 00:45:36,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2024-11-22 00:45:36,822 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 [2024-11-22 00:45:36,836 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 52 treesize of output 57 [2024-11-22 00:45:36,849 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 160 treesize of output 133 [2024-11-22 00:45:36,854 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 [2024-11-22 00:45:36,889 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 [2024-11-22 00:45:36,908 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 [2024-11-22 00:45:36,965 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 [2024-11-22 00:45:36,987 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 62 treesize of output 54 [2024-11-22 00:45:37,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2024-11-22 00:45:37,048 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 [2024-11-22 00:45:37,068 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 00:45:37,070 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 165 treesize of output 129 [2024-11-22 00:45:37,172 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2024-11-22 00:45:37,173 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 [2024-11-22 00:45:37,223 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 [2024-11-22 00:45:37,248 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 [2024-11-22 00:45:37,292 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 [2024-11-22 00:45:37,304 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 62 treesize of output 54 [2024-11-22 00:45:37,374 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 [2024-11-22 00:45:37,391 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 [2024-11-22 00:45:37,417 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 [2024-11-22 00:45:37,434 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 [2024-11-22 00:45:37,520 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 [2024-11-22 00:45:37,535 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 [2024-11-22 00:45:37,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2024-11-22 00:45:37,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 35 treesize of output 18 [2024-11-22 00:45:37,731 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 [2024-11-22 00:45:37,739 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 [2024-11-22 00:45:37,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:45:37,770 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 35 treesize of output 18 [2024-11-22 00:45:37,787 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 32 treesize of output 31 [2024-11-22 00:45:41,892 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv0 32) |c_~#mutexes~0.offset|) (= (_ bv3 32) |c_~#mutexes~0.base|) (let ((.cse4 (bvadd |c___ldv_list_add_#in~new.offset| (_ bv4 32)))) (let ((.cse8 (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|)) (.cse9 (= |c___ldv_list_add_#in~prev.offset| .cse4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base|)) (.cse31 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~new.base|)) (.cse19 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|)) (.cse14 (not .cse9)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c___ldv_list_add_#in~new.base|) .cse4)) (.cse6 (select |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base|)) (.cse20 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base|)) (.cse0 (not .cse8))) (or (and (or (and .cse0 (= |c___ldv_list_add_#in~new.offset| (select .cse1 |c___ldv_list_add_#in~prev.offset|)) (exists ((v_DerPreprocessor_7 (_ BitVec 32))) (let ((.cse7 (bvadd v_DerPreprocessor_7 (_ bv4 32)))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse2 (let ((.cse3 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse6 .cse7 |c___ldv_list_add_#in~new.base|)))) (store .cse3 |c___ldv_list_add_#in~new.base| (store (store (select .cse3 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse4 .cse5))))) (store .cse2 |c___ldv_list_add_#in~prev.base| (store (select .cse2 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= |c___ldv_list_add_#in~new.offset| (select .cse1 .cse7)))))) (and .cse8 (or (and .cse9 (exists ((v___ldv_list_add_~next.offset_4 (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_4)) (.cse11 (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~next.base| v_arrayElimArr_10))) (and (= |c___ldv_list_add_#in~new.offset| (select v_arrayElimArr_10 .cse10)) (= (select .cse11 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_8) (= (let ((.cse12 (let ((.cse13 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse6 .cse10 |c___ldv_list_add_#in~new.base|)))) (store .cse13 |c___ldv_list_add_#in~new.base| (store (select .cse13 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|))))) (store .cse12 |c___ldv_list_add_#in~prev.base| (store (select .cse12 |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|) (= .cse1 (store (select (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| v___ldv_list_add_~next.offset_4) .cse4 |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|)))))) (and .cse14 (exists ((v___ldv_list_add_~next.offset_4 (_ BitVec 32)) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_4)) (.cse16 (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_10) |c___ldv_list_add_#in~next.base| v_arrayElimArr_12))) (and (= |c___ldv_list_add_#in~new.offset| (select v_arrayElimArr_12 .cse15)) (= v_DerPreprocessor_10 (select .cse16 |c___ldv_list_add_#in~prev.base|)) (= (let ((.cse17 (let ((.cse18 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse6 .cse15 |c___ldv_list_add_#in~new.base|)))) (store .cse18 |c___ldv_list_add_#in~new.base| (store (store (select .cse18 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse4 .cse5))))) (store .cse17 |c___ldv_list_add_#in~prev.base| (store (select .cse17 |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 .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) .cse4 |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|) .cse1)))))))) .cse19) (and (or (and .cse0 (= |c___ldv_list_add_#in~new.offset| (select .cse20 |c___ldv_list_add_#in~prev.offset|)) (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (= (let ((.cse21 (let ((.cse22 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse6 v_DerPreprocessor_1 |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|) .cse4 .cse5))))) (store .cse21 |c___ldv_list_add_#in~prev.base| (store (select .cse21 |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|))) (and .cse8 (or (and .cse14 (exists ((v___ldv_list_add_~next.offset_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_5) |c___ldv_list_add_#in~next.base| v_arrayElimArr_6)) (.cse23 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_4))) (and (= |c___ldv_list_add_#in~new.offset| (select v_arrayElimArr_6 .cse23)) (= (select .cse24 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_5) (= (store (select (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| v___ldv_list_add_~next.offset_4) .cse4 |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|) .cse1) (= (let ((.cse25 (let ((.cse26 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse6 .cse23 |c___ldv_list_add_#in~new.base|)))) (store .cse26 |c___ldv_list_add_#in~new.base| (store (store (select .cse26 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse4 .cse5))))) (store .cse25 |c___ldv_list_add_#in~prev.base| (store (select .cse25 |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|))))) (and (exists ((v___ldv_list_add_~next.offset_4 (_ BitVec 32)) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_4)) (.cse27 (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_3) |c___ldv_list_add_#in~next.base| v_arrayElimArr_4))) (and (= (select .cse27 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_3) (= |c___ldv_list_add_#in~new.offset| (select v_arrayElimArr_4 .cse28)) (= (let ((.cse29 (let ((.cse30 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse6 .cse28 |c___ldv_list_add_#in~new.base|)))) (store .cse30 |c___ldv_list_add_#in~new.base| (store (select .cse30 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|))))) (store .cse29 |c___ldv_list_add_#in~prev.base| (store (select .cse29 |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|) (= .cse1 (store (select (store .cse27 |c___ldv_list_add_#in~new.base| (store (store (select .cse27 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| v___ldv_list_add_~next.offset_4) .cse4 |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|))))) .cse9)))) .cse31) (and (not .cse31) (not .cse19) (or (and .cse8 (or (and .cse14 (exists ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_15) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_16) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_17))) (let ((.cse32 (select .cse33 |c___ldv_list_add_#in~prev.base|))) (let ((.cse34 (bvadd (_ bv4 32) (select .cse32 |c___ldv_list_add_#in~new.offset|)))) (and (= .cse20 (store .cse32 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)) (= |c___ldv_list_add_#in~prev.offset| (select .cse32 .cse4)) (= v_DerPreprocessor_16 .cse32) (= |c___ldv_list_add_#in~new.offset| (select (select .cse33 |c___ldv_list_add_#in~next.base|) .cse34)) (= (let ((.cse35 (let ((.cse36 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse6 .cse34 |c___ldv_list_add_#in~new.base|)))) (store .cse36 |c___ldv_list_add_#in~new.base| (store (store (select .cse36 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse4 .cse5))))) (store .cse35 |c___ldv_list_add_#in~prev.base| (store (select .cse35 |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|))))))) (and .cse9 (exists ((v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_18) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_19) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_20))) (let ((.cse37 (select .cse38 |c___ldv_list_add_#in~prev.base|))) (let ((.cse39 (bvadd (_ bv4 32) (select .cse37 |c___ldv_list_add_#in~new.offset|)))) (and (= (store .cse37 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|) .cse20) (= |c___ldv_list_add_#in~new.offset| (select (select .cse38 |c___ldv_list_add_#in~next.base|) .cse39)) (= |c___ldv_list_add_#in~prev.offset| (select .cse37 .cse4)) (= |c_#memory_$Pointer$#1.base| (let ((.cse40 (let ((.cse41 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse6 .cse39 |c___ldv_list_add_#in~new.base|)))) (store .cse41 |c___ldv_list_add_#in~new.base| (store (select .cse41 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|))))) (store .cse40 |c___ldv_list_add_#in~prev.base| (store (select .cse40 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= v_DerPreprocessor_19 .cse37))))))))) (and (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_12) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_13) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_14)) (.cse44 (bvadd (select v_DerPreprocessor_14 |c___ldv_list_add_#in~new.offset|) (_ bv4 32)))) (and (= |c___ldv_list_add_#in~prev.offset| (select v_DerPreprocessor_14 .cse4)) (= (let ((.cse42 (let ((.cse43 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store .cse6 .cse44 |c___ldv_list_add_#in~new.base|)))) (store .cse43 |c___ldv_list_add_#in~new.base| (store (store (select .cse43 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse4 .cse5))))) (store .cse42 |c___ldv_list_add_#in~prev.base| (store (select .cse42 |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|) (= .cse20 (store (select .cse45 |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~new.offset| (select (select .cse45 |c___ldv_list_add_#in~next.base|) .cse44))))) .cse0)))))))) is different from false [2024-11-22 00:45:43,276 INFO L349 Elim1Store]: treesize reduction 107, result has 20.7 percent of original size [2024-11-22 00:45:43,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 46 [2024-11-22 00:45:44,540 INFO L349 Elim1Store]: treesize reduction 134, result has 0.7 percent of original size [2024-11-22 00:45:44,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 1