./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_unlock_at_exit.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd310154a8f082280317f3bf1f868dbee13522304c8e13d29736e7fb8b36c7cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:28:06,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:28:06,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:28:06,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:28:06,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:28:06,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:28:06,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:28:06,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:28:06,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:28:06,328 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:28:06,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:28:06,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:28:06,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:28:06,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:28:06,331 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:28:06,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:28:06,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:28:06,331 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:28:06,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:28:06,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:28:06,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:28:06,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:28:06,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:28:06,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:28:06,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:28:06,337 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:28:06,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:28:06,338 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:28:06,338 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:28:06,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:28:06,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:28:06,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:28:06,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:28:06,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:28:06,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:28:06,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:28:06,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:28:06,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:28:06,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:28:06,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:28:06,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:28:06,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:28:06,340 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd310154a8f082280317f3bf1f868dbee13522304c8e13d29736e7fb8b36c7cf [2024-11-16 06:28:06,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:28:06,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:28:06,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:28:06,554 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:28:06,554 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:28:06,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i [2024-11-16 06:28:07,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:28:07,959 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:28:07,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i [2024-11-16 06:28:07,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06e3c4770/3ec591eb352f43afa6f9bc99ea3f7ff6/FLAG7f842cad8 [2024-11-16 06:28:08,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06e3c4770/3ec591eb352f43afa6f9bc99ea3f7ff6 [2024-11-16 06:28:08,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:28:08,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:28:08,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:28:08,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:28:08,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:28:08,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:28:08" (1/1) ... [2024-11-16 06:28:08,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cacd8e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08, skipping insertion in model container [2024-11-16 06:28:08,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:28:08" (1/1) ... [2024-11-16 06:28:08,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:28:08,626 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_unlock_at_exit.i[25842,25855] [2024-11-16 06:28:08,633 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_unlock_at_exit.i[25967,25980] [2024-11-16 06:28:08,634 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_unlock_at_exit.i[26082,26095] [2024-11-16 06:28:08,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:28:08,643 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:28:08,682 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_unlock_at_exit.i[25842,25855] [2024-11-16 06:28:08,682 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_unlock_at_exit.i[25967,25980] [2024-11-16 06:28:08,683 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_unlock_at_exit.i[26082,26095] [2024-11-16 06:28:08,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:28:08,713 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:28:08,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08 WrapperNode [2024-11-16 06:28:08,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:28:08,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:28:08,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:28:08,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:28:08,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08" (1/1) ... [2024-11-16 06:28:08,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08" (1/1) ... [2024-11-16 06:28:08,751 INFO L138 Inliner]: procedures = 139, calls = 56, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 138 [2024-11-16 06:28:08,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:28:08,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:28:08,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:28:08,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:28:08,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08" (1/1) ... [2024-11-16 06:28:08,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08" (1/1) ... [2024-11-16 06:28:08,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08" (1/1) ... [2024-11-16 06:28:08,787 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-16 06:28:08,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08" (1/1) ... [2024-11-16 06:28:08,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08" (1/1) ... [2024-11-16 06:28:08,800 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08" (1/1) ... [2024-11-16 06:28:08,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08" (1/1) ... [2024-11-16 06:28:08,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08" (1/1) ... [2024-11-16 06:28:08,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08" (1/1) ... [2024-11-16 06:28:08,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:28:08,809 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:28:08,810 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:28:08,810 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:28:08,813 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08" (1/1) ... [2024-11-16 06:28:08,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:28:08,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:28:08,849 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-16 06:28:08,852 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-16 06:28:08,887 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-16 06:28:08,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-16 06:28:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 06:28:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-11-16 06:28:08,889 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-11-16 06:28:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:28:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 06:28:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 06:28:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-16 06:28:08,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-16 06:28:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 06:28:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 06:28:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 06:28:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-16 06:28:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-16 06:28:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:28:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 06:28:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-11-16 06:28:08,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-11-16 06:28:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:28:08,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:28:09,007 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:28:09,009 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:28:09,176 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L663: havoc ldv_set_empty_#t~ret31#1; [2024-11-16 06:28:09,177 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L620: havoc ldv_list_empty_#t~mem10#1.base, ldv_list_empty_#t~mem10#1.offset; [2024-11-16 06:28:09,219 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-16 06:28:09,219 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:28:09,230 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:28:09,233 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:28:09,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:28:09 BoogieIcfgContainer [2024-11-16 06:28:09,233 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:28:09,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:28:09,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:28:09,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:28:09,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:28:08" (1/3) ... [2024-11-16 06:28:09,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b282210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:28:09, skipping insertion in model container [2024-11-16 06:28:09,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:28:08" (2/3) ... [2024-11-16 06:28:09,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b282210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:28:09, skipping insertion in model container [2024-11-16 06:28:09,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:28:09" (3/3) ... [2024-11-16 06:28:09,240 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unlock_at_exit.i [2024-11-16 06:28:09,252 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:28:09,253 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-16 06:28:09,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:28:09,295 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;@7d083b94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:28:09,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-16 06:28:09,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 56 states have internal predecessors, (67), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 06:28:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 06:28:09,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:28:09,304 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-16 06:28:09,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:28:09,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:28:09,308 INFO L85 PathProgramCache]: Analyzing trace with hash 999881062, now seen corresponding path program 1 times [2024-11-16 06:28:09,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:28:09,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154180992] [2024-11-16 06:28:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:28:09,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:28:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:09,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 06:28:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:09,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 06:28:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:09,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 06:28:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:09,573 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-16 06:28:09,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:28:09,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154180992] [2024-11-16 06:28:09,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154180992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:28:09,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:28:09,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:28:09,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360838755] [2024-11-16 06:28:09,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:28:09,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:28:09,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:28:09,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:28:09,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:28:09,595 INFO L87 Difference]: Start difference. First operand has 70 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 56 states have internal predecessors, (67), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 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-16 06:28:09,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:28:09,670 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2024-11-16 06:28:09,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:28:09,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 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-16 06:28:09,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:28:09,680 INFO L225 Difference]: With dead ends: 136 [2024-11-16 06:28:09,681 INFO L226 Difference]: Without dead ends: 65 [2024-11-16 06:28:09,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:28:09,686 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:28:09,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 101 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:28:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-16 06:28:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2024-11-16 06:28:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 06:28:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2024-11-16 06:28:09,715 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 28 [2024-11-16 06:28:09,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:28:09,715 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-11-16 06:28:09,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 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-16 06:28:09,715 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2024-11-16 06:28:09,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-16 06:28:09,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:28:09,717 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, 1] [2024-11-16 06:28:09,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:28:09,717 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:28:09,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:28:09,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1156268403, now seen corresponding path program 1 times [2024-11-16 06:28:09,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:28:09,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928823072] [2024-11-16 06:28:09,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:28:09,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:28:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:09,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 06:28:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:09,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 06:28:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:09,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 06:28:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:09,916 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-16 06:28:09,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:28:09,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928823072] [2024-11-16 06:28:09,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928823072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:28:09,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:28:09,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:28:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303608238] [2024-11-16 06:28:09,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:28:09,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:28:09,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:28:09,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:28:09,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:28:09,920 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-16 06:28:10,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:28:10,040 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-11-16 06:28:10,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:28:10,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 29 [2024-11-16 06:28:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:28:10,042 INFO L225 Difference]: With dead ends: 71 [2024-11-16 06:28:10,042 INFO L226 Difference]: Without dead ends: 69 [2024-11-16 06:28:10,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:28:10,043 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:28:10,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 196 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:28:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-16 06:28:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2024-11-16 06:28:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-16 06:28:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2024-11-16 06:28:10,060 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 29 [2024-11-16 06:28:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:28:10,060 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2024-11-16 06:28:10,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-16 06:28:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2024-11-16 06:28:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-16 06:28:10,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:28:10,061 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, 1] [2024-11-16 06:28:10,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 06:28:10,061 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:28:10,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:28:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1306433229, now seen corresponding path program 1 times [2024-11-16 06:28:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:28:10,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645661695] [2024-11-16 06:28:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:28:10,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:28:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:10,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 06:28:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:10,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 06:28:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:10,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 06:28:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:10,355 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-16 06:28:10,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:28:10,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645661695] [2024-11-16 06:28:10,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645661695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:28:10,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:28:10,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 06:28:10,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427139696] [2024-11-16 06:28:10,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:28:10,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 06:28:10,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:28:10,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 06:28:10,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:28:10,359 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 06:28:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:28:10,735 INFO L93 Difference]: Finished difference Result 189 states and 232 transitions. [2024-11-16 06:28:10,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 06:28:10,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-11-16 06:28:10,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:28:10,737 INFO L225 Difference]: With dead ends: 189 [2024-11-16 06:28:10,739 INFO L226 Difference]: Without dead ends: 131 [2024-11-16 06:28:10,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-16 06:28:10,740 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 113 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:28:10,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 251 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 06:28:10,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-16 06:28:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 101. [2024-11-16 06:28:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 79 states have internal predecessors, (85), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21) [2024-11-16 06:28:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2024-11-16 06:28:10,760 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 29 [2024-11-16 06:28:10,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:28:10,761 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2024-11-16 06:28:10,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 06:28:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2024-11-16 06:28:10,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-16 06:28:10,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:28:10,764 INFO L215 NwaCegarLoop]: trace histogram [3, 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-16 06:28:10,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 06:28:10,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:28:10,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:28:10,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1752277826, now seen corresponding path program 1 times [2024-11-16 06:28:10,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:28:10,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642929713] [2024-11-16 06:28:10,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:28:10,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:28:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:12,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 06:28:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:12,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 06:28:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:12,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 06:28:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:13,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 06:28:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:13,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:28:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:13,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 06:28:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:13,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 06:28:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:13,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 06:28:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 06:28:13,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:28:13,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642929713] [2024-11-16 06:28:13,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642929713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:28:13,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740316986] [2024-11-16 06:28:13,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:28:13,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:28:13,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:28:13,633 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-16 06:28:13,634 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-16 06:28:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:28:13,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 136 conjuncts are in the unsatisfiable core [2024-11-16 06:28:13,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:28:13,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-16 06:28:14,189 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-16 06:28:14,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-16 06:28:14,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 06:28:14,764 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-11-16 06:28:14,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 91 [2024-11-16 06:28:14,800 INFO L349 Elim1Store]: treesize reduction 42, result has 41.7 percent of original size [2024-11-16 06:28:14,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 123 [2024-11-16 06:28:14,823 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 57 treesize of output 52 [2024-11-16 06:28:14,923 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 29 treesize of output 24 [2024-11-16 06:28:15,003 INFO L349 Elim1Store]: treesize reduction 46, result has 34.3 percent of original size [2024-11-16 06:28:15,004 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 1 case distinctions, treesize of input 38 treesize of output 51 [2024-11-16 06:28:15,089 INFO L349 Elim1Store]: treesize reduction 42, result has 34.4 percent of original size [2024-11-16 06:28:15,089 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 1 case distinctions, treesize of input 23 treesize of output 33 [2024-11-16 06:28:15,284 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-16 06:28:15,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 83 [2024-11-16 06:28:15,293 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 140 treesize of output 122 [2024-11-16 06:28:15,427 INFO L349 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2024-11-16 06:28:15,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 91 [2024-11-16 06:28:15,441 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2024-11-16 06:28:15,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 87 [2024-11-16 06:28:15,482 INFO L349 Elim1Store]: treesize reduction 194, result has 33.6 percent of original size [2024-11-16 06:28:15,482 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 1 case distinctions, treesize of input 150 treesize of output 161 [2024-11-16 06:28:15,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 52 [2024-11-16 06:28:15,630 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 87 treesize of output 74 [2024-11-16 06:28:15,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 47 [2024-11-16 06:28:15,660 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 59 treesize of output 51 [2024-11-16 06:28:15,687 INFO L349 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2024-11-16 06:28:15,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 26 [2024-11-16 06:28:19,753 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_~#mutexes~0.offset| 0) (= 3 |c_~#mutexes~0.base|) (let ((.cse14 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base|)) (.cse2 (+ |c___ldv_list_add_#in~new.offset| 4))) (let ((.cse11 (= (select .cse14 .cse2) |c___ldv_list_add_#in~prev.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base|)) (.cse0 (= |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~prev.offset|)) (.cse15 (= |c___ldv_list_add_#in~prev.base| |c___ldv_list_add_#in~new.base|))) (or (and .cse0 (or (exists ((v_arrayElimArr_16 (Array Int Int)) (v___ldv_list_add_~next.offset_7 Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_13) |c___ldv_list_add_#in~prev.base| v_arrayElimArr_16) |c___ldv_list_add_#in~new.base|)) (.cse4 (+ 4 v___ldv_list_add_~next.offset_7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_arrayElimArr_16) |c___ldv_list_add_#in~new.base| (store (store .cse1 |c___ldv_list_add_#in~new.offset| v___ldv_list_add_~next.offset_7) .cse2 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|) .cse3) (= .cse1 v_DerPreprocessor_13) (= |c___ldv_list_add_#in~new.offset| (select v_arrayElimArr_16 .cse4)) (= |c_#memory_$Pointer$#1.base| (let ((.cse6 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~prev.base| (store (select |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~prev.base|) .cse4 |c___ldv_list_add_#in~new.base|)))) (let ((.cse5 (store (select .cse6 |c___ldv_list_add_#in~new.base|) .cse2 |c___ldv_list_add_#in~prev.base|))) (store (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| .cse5) |c___ldv_list_add_#in~prev.base| (store (select (store .cse6 |c___ldv_list_add_#in~new.base| .cse5) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))))))) (exists ((v_arrayElimArr_13 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v___ldv_list_add_~next.base_7 Int) (v_DerPreprocessor_11 (Array Int Int)) (v___ldv_list_add_~next.offset_7 Int)) (let ((.cse10 (+ 4 v___ldv_list_add_~next.offset_7)) (.cse7 (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_10) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_11) v___ldv_list_add_~next.base_7 v_arrayElimArr_13) |c___ldv_list_add_#in~new.base|))) (and (not (= v___ldv_list_add_~next.base_7 |c___ldv_list_add_#in~prev.base|)) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_11) v___ldv_list_add_~next.base_7 v_arrayElimArr_13) |c___ldv_list_add_#in~new.base| (store (store .cse7 |c___ldv_list_add_#in~new.offset| v___ldv_list_add_~next.offset_7) .cse2 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|) .cse3) (= |c_#memory_$Pointer$#1.base| (let ((.cse8 (let ((.cse9 (store |c_old(#memory_$Pointer$#1.base)| v___ldv_list_add_~next.base_7 (store (select |c_old(#memory_$Pointer$#1.base)| v___ldv_list_add_~next.base_7) .cse10 |c___ldv_list_add_#in~new.base|)))) (store .cse9 |c___ldv_list_add_#in~new.base| (store (select .cse9 |c___ldv_list_add_#in~new.base|) .cse2 |c___ldv_list_add_#in~prev.base|))))) (store .cse8 |c___ldv_list_add_#in~prev.base| (store (select .cse8 |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 v_arrayElimArr_13 .cse10)) (= v_DerPreprocessor_10 .cse7)))) (and (= |c___ldv_list_add_#in~new.offset| (select .cse3 |c___ldv_list_add_#in~prev.offset|)) .cse11 (exists ((v___ldv_list_add_~next.offset_7 Int)) (let ((.cse13 (+ 4 v___ldv_list_add_~next.offset_7))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse12 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| (store (store (select |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base|) .cse13 |c___ldv_list_add_#in~new.base|) .cse2 |c___ldv_list_add_#in~prev.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___ldv_list_add_#in~new.offset| (select .cse14 .cse13))))))) .cse15) (and (let ((.cse68 (select .cse14 |c___ldv_list_add_#in~new.offset|)) (.cse23 (select (select |c_#memory_$Pointer$#1.base| |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset|))) (let ((.cse16 (= .cse23 |c___ldv_list_add_#in~new.base|)) (.cse24 (select |c_old(#memory_$Pointer$#1.base)| .cse23)) (.cse69 (+ .cse68 4))) (let ((.cse18 (select |c_#memory_$Pointer$#1.offset| .cse23)) (.cse67 (= (let ((.cse101 (let ((.cse102 (store |c_old(#memory_$Pointer$#1.base)| .cse23 (store .cse24 .cse69 |c___ldv_list_add_#in~new.base|)))) (store .cse102 |c___ldv_list_add_#in~new.base| (store (store (select .cse102 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse23) .cse2 |c___ldv_list_add_#in~prev.base|))))) (store .cse101 |c___ldv_list_add_#in~prev.base| (store (select .cse101 |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|)) (.cse26 (= |c___ldv_list_add_#in~prev.base| .cse23)) (.cse70 (not .cse16))) (or (and .cse16 (or (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_$Pointer$#1.offset| .cse23 v_DerPreprocessor_7) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_9))) (let ((.cse17 (select .cse25 .cse23))) (let ((.cse20 (select .cse17 |c___ldv_list_add_#in~new.offset|)) (.cse19 (select .cse25 |c___ldv_list_add_#in~prev.base|))) (and (= .cse17 .cse18) (= .cse19 v_DerPreprocessor_8) (= .cse20 |c___ldv_list_add_#in~new.offset|) (= .cse17 v_DerPreprocessor_7) (= |c___ldv_list_add_#in~prev.offset| (select .cse17 .cse2)) (= (let ((.cse21 (let ((.cse22 (store |c_old(#memory_$Pointer$#1.base)| .cse23 (store .cse24 (+ .cse20 4) |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| .cse23) .cse2 |c___ldv_list_add_#in~prev.base|))))) (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|) (= (store .cse19 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|) .cse3)))))) (and .cse26 (or (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse32 (store (store (store |c_#memory_$Pointer$#1.offset| .cse23 v_DerPreprocessor_7) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_9))) (let ((.cse28 (select .cse32 .cse23))) (let ((.cse29 (+ (select .cse28 |c___ldv_list_add_#in~new.offset|) 4)) (.cse27 (select .cse32 |c___ldv_list_add_#in~prev.base|))) (and (= .cse27 v_DerPreprocessor_8) (= (select .cse28 .cse29) |c___ldv_list_add_#in~new.offset|) (= .cse28 v_DerPreprocessor_7) (= |c___ldv_list_add_#in~prev.offset| (select .cse28 .cse2)) (= (let ((.cse30 (let ((.cse31 (store |c_old(#memory_$Pointer$#1.base)| .cse23 (store .cse24 .cse29 |c___ldv_list_add_#in~new.base|)))) (store .cse31 |c___ldv_list_add_#in~new.base| (store (store (select .cse31 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse23) .cse2 |c___ldv_list_add_#in~prev.base|))))) (store .cse30 |c___ldv_list_add_#in~prev.base| (store (select .cse30 |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 .cse27 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|) .cse3)))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_$Pointer$#1.offset| .cse23 v_DerPreprocessor_7) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_9))) (let ((.cse35 (select .cse38 .cse23))) (let ((.cse34 (select .cse35 |c___ldv_list_add_#in~new.offset|)) (.cse33 (select .cse38 |c___ldv_list_add_#in~prev.base|))) (and (= .cse33 v_DerPreprocessor_8) (= .cse34 |c___ldv_list_add_#in~new.offset|) (= .cse35 v_DerPreprocessor_7) (= |c___ldv_list_add_#in~prev.offset| (select .cse35 .cse2)) (= (let ((.cse36 (let ((.cse37 (store |c_old(#memory_$Pointer$#1.base)| .cse23 (store .cse24 (+ .cse34 4) |c___ldv_list_add_#in~new.base|)))) (store .cse37 |c___ldv_list_add_#in~new.base| (store (store (select .cse37 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse23) .cse2 |c___ldv_list_add_#in~prev.base|))))) (store .cse36 |c___ldv_list_add_#in~prev.base| (store (select .cse36 |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 .cse33 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|) .cse3)))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_$Pointer$#1.offset| .cse23 v_DerPreprocessor_7) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_9))) (let ((.cse40 (select .cse44 .cse23))) (let ((.cse41 (+ (select .cse40 |c___ldv_list_add_#in~new.offset|) 4)) (.cse39 (select .cse44 |c___ldv_list_add_#in~prev.base|))) (and (= .cse39 v_DerPreprocessor_8) (= .cse40 v_DerPreprocessor_7) (= .cse41 |c___ldv_list_add_#in~new.offset|) (= |c___ldv_list_add_#in~prev.offset| (select .cse40 .cse2)) (= (let ((.cse42 (let ((.cse43 (store |c_old(#memory_$Pointer$#1.base)| .cse23 (store .cse24 .cse41 |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| .cse23) .cse2 |c___ldv_list_add_#in~prev.base|))))) (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|) (= (store .cse39 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|) .cse3)))))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse50 (store (store (store |c_#memory_$Pointer$#1.offset| .cse23 v_DerPreprocessor_7) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_9))) (let ((.cse45 (select .cse50 .cse23))) (let ((.cse47 (+ (select .cse45 |c___ldv_list_add_#in~new.offset|) 4)) (.cse46 (select .cse50 |c___ldv_list_add_#in~prev.base|))) (and (= .cse45 .cse18) (= .cse46 v_DerPreprocessor_8) (= (select .cse45 .cse47) |c___ldv_list_add_#in~new.offset|) (= .cse45 v_DerPreprocessor_7) (= |c___ldv_list_add_#in~prev.offset| (select .cse45 .cse2)) (= (let ((.cse48 (let ((.cse49 (store |c_old(#memory_$Pointer$#1.base)| .cse23 (store .cse24 .cse47 |c___ldv_list_add_#in~new.base|)))) (store .cse49 |c___ldv_list_add_#in~new.base| (store (store (select .cse49 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse23) .cse2 |c___ldv_list_add_#in~prev.base|))))) (store .cse48 |c___ldv_list_add_#in~prev.base| (store (select .cse48 |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 .cse46 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|) .cse3)))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse56 (store (store (store |c_#memory_$Pointer$#1.offset| .cse23 v_DerPreprocessor_7) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_9))) (let ((.cse51 (select .cse56 .cse23))) (let ((.cse53 (+ (select .cse51 |c___ldv_list_add_#in~new.offset|) 4)) (.cse52 (select .cse56 |c___ldv_list_add_#in~prev.base|))) (and (= .cse51 .cse18) (= .cse52 v_DerPreprocessor_8) (= .cse51 v_DerPreprocessor_7) (= .cse53 |c___ldv_list_add_#in~new.offset|) (= |c___ldv_list_add_#in~prev.offset| (select .cse51 .cse2)) (= (let ((.cse54 (let ((.cse55 (store |c_old(#memory_$Pointer$#1.base)| .cse23 (store .cse24 .cse53 |c___ldv_list_add_#in~new.base|)))) (store .cse55 |c___ldv_list_add_#in~new.base| (store (store (select .cse55 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse23) .cse2 |c___ldv_list_add_#in~prev.base|))))) (store .cse54 |c___ldv_list_add_#in~prev.base| (store (select .cse54 |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 .cse52 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|) .cse3)))))))) (and .cse26 (or (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse62 (select v_DerPreprocessor_3 |c___ldv_list_add_#in~new.offset|))) (let ((.cse58 (+ .cse62 4))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse61 (store (store (store |c_#memory_$Pointer$#1.offset| .cse23 v_DerPreprocessor_1) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_2) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_3))) (let ((.cse57 (select .cse61 .cse23))) (let ((.cse59 (store (store .cse57 |c___ldv_list_add_#in~new.offset| .cse62) .cse2 |c___ldv_list_add_#in~prev.offset|)) (.cse60 (select .cse61 |c___ldv_list_add_#in~prev.base|))) (and (= (select .cse57 .cse58) |c___ldv_list_add_#in~new.offset|) (= .cse57 v_DerPreprocessor_1) (= .cse59 .cse14) (= v_DerPreprocessor_2 .cse60) (= .cse59 v_DerPreprocessor_3) (= .cse18 (store .cse60 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|))))))) (= (let ((.cse63 (let ((.cse64 (store |c_old(#memory_$Pointer$#1.base)| .cse23 (store .cse24 .cse58 |c___ldv_list_add_#in~new.base|)))) (store .cse64 |c___ldv_list_add_#in~new.base| (store (store (select .cse64 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse23) .cse2 |c___ldv_list_add_#in~prev.base|))))) (store .cse63 |c___ldv_list_add_#in~prev.base| (store (select .cse63 |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_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse66 (store (store (store |c_#memory_$Pointer$#1.offset| .cse23 v_DerPreprocessor_1) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_2) |c___ldv_list_add_#in~new.base| .cse14))) (let ((.cse65 (select .cse66 |c___ldv_list_add_#in~prev.base|))) (and (= .cse65 v_DerPreprocessor_2) (= .cse18 (store .cse65 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)) (= v_DerPreprocessor_1 (select .cse66 .cse23)))))) .cse67 .cse16 (or (= .cse68 |c___ldv_list_add_#in~new.offset|) (= |c___ldv_list_add_#in~new.offset| (select .cse14 .cse69)) (= |c___ldv_list_add_#in~new.offset| .cse69)) .cse11) (and .cse67 .cse70 .cse11 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse72 (store (store (store |c_#memory_$Pointer$#1.offset| .cse23 v_DerPreprocessor_1) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_2) |c___ldv_list_add_#in~new.base| .cse14))) (let ((.cse71 (select .cse72 .cse23))) (and (= |c___ldv_list_add_#in~new.offset| (select .cse71 .cse69)) (= .cse18 (store (select .cse72 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)) (= v_DerPreprocessor_1 .cse71)))))) (and .cse16 (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse76 (store (store (store |c_#memory_$Pointer$#1.offset| .cse23 v_DerPreprocessor_1) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_2) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_3))) (let ((.cse75 (+ (select v_DerPreprocessor_3 |c___ldv_list_add_#in~new.offset|) 4)) (.cse77 (select .cse76 |c___ldv_list_add_#in~prev.base|))) (and (= (let ((.cse73 (let ((.cse74 (store |c_old(#memory_$Pointer$#1.base)| .cse23 (store .cse24 .cse75 |c___ldv_list_add_#in~new.base|)))) (store .cse74 |c___ldv_list_add_#in~new.base| (store (store (select .cse74 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse23) .cse2 |c___ldv_list_add_#in~prev.base|))))) (store .cse73 |c___ldv_list_add_#in~prev.base| (store (select .cse73 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|) (= |c___ldv_list_add_#in~prev.offset| (select v_DerPreprocessor_3 .cse2)) (= |c___ldv_list_add_#in~new.offset| .cse75) (= (select .cse76 .cse23) v_DerPreprocessor_1) (= v_DerPreprocessor_2 .cse77) (= .cse18 (store .cse77 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse81 (store (store (store |c_#memory_$Pointer$#1.offset| .cse23 v_DerPreprocessor_1) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_2) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_3))) (let ((.cse82 (select .cse81 |c___ldv_list_add_#in~prev.base|)) (.cse80 (select v_DerPreprocessor_3 |c___ldv_list_add_#in~new.offset|))) (and (= (let ((.cse78 (let ((.cse79 (store |c_old(#memory_$Pointer$#1.base)| .cse23 (store .cse24 (+ .cse80 4) |c___ldv_list_add_#in~new.base|)))) (store .cse79 |c___ldv_list_add_#in~new.base| (store (store (select .cse79 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse23) .cse2 |c___ldv_list_add_#in~prev.base|))))) (store .cse78 |c___ldv_list_add_#in~prev.base| (store (select .cse78 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|) (= |c___ldv_list_add_#in~prev.offset| (select v_DerPreprocessor_3 .cse2)) (= (select .cse81 .cse23) v_DerPreprocessor_1) (= v_DerPreprocessor_2 .cse82) (= .cse18 (store .cse82 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)) (= .cse80 |c___ldv_list_add_#in~new.offset|))))) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse88 (select v_DerPreprocessor_3 |c___ldv_list_add_#in~new.offset|))) (let ((.cse85 (+ .cse88 4))) (and (= (let ((.cse83 (let ((.cse84 (store |c_old(#memory_$Pointer$#1.base)| .cse23 (store .cse24 .cse85 |c___ldv_list_add_#in~new.base|)))) (store .cse84 |c___ldv_list_add_#in~new.base| (store (store (select .cse84 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse23) .cse2 |c___ldv_list_add_#in~prev.base|))))) (store .cse83 |c___ldv_list_add_#in~prev.base| (store (select .cse83 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse89 (store (store (store |c_#memory_$Pointer$#1.offset| .cse23 v_DerPreprocessor_1) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_2) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_3))) (let ((.cse86 (select .cse89 .cse23)) (.cse87 (select .cse89 |c___ldv_list_add_#in~prev.base|))) (and (= (select .cse86 .cse85) |c___ldv_list_add_#in~new.offset|) (= .cse86 v_DerPreprocessor_1) (= v_DerPreprocessor_2 .cse87) (= (store (store .cse86 |c___ldv_list_add_#in~new.offset| .cse88) .cse2 |c___ldv_list_add_#in~prev.offset|) v_DerPreprocessor_3) (= .cse18 (store .cse87 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)))))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse93 (store (store (store |c_#memory_$Pointer$#1.offset| .cse23 v_DerPreprocessor_1) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_2) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_3))) (let ((.cse90 (+ (select v_DerPreprocessor_3 |c___ldv_list_add_#in~new.offset|) 4)) (.cse94 (select .cse93 |c___ldv_list_add_#in~prev.base|))) (and (= (select v_DerPreprocessor_3 .cse90) |c___ldv_list_add_#in~new.offset|) (= (let ((.cse91 (let ((.cse92 (store |c_old(#memory_$Pointer$#1.base)| .cse23 (store .cse24 .cse90 |c___ldv_list_add_#in~new.base|)))) (store .cse92 |c___ldv_list_add_#in~new.base| (store (store (select .cse92 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse23) .cse2 |c___ldv_list_add_#in~prev.base|))))) (store .cse91 |c___ldv_list_add_#in~prev.base| (store (select .cse91 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|) (= |c___ldv_list_add_#in~prev.offset| (select v_DerPreprocessor_3 .cse2)) (= (select .cse93 .cse23) v_DerPreprocessor_1) (= v_DerPreprocessor_2 .cse94) (= .cse18 (store .cse94 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)))))))))) (and (or (and .cse67 (exists ((v_arrayElimArr_7 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse96 (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_4) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_5) .cse23 v_arrayElimArr_7) |c___ldv_list_add_#in~new.base|))) (let ((.cse95 (store (store .cse96 |c___ldv_list_add_#in~new.offset| .cse68) .cse2 |c___ldv_list_add_#in~prev.offset|))) (and (= |c___ldv_list_add_#in~new.offset| (select v_arrayElimArr_7 .cse69)) (= .cse95 .cse14) (= v_DerPreprocessor_4 .cse96) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_5) .cse23 v_arrayElimArr_7) |c___ldv_list_add_#in~new.base| .cse95) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|) .cse3)))))) (and .cse15 (exists ((v_arrayElimArr_7 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v___ldv_list_add_~next.offset_7 Int)) (let ((.cse99 (+ 4 v___ldv_list_add_~next.offset_7)) (.cse100 (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_4) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_5) .cse23 v_arrayElimArr_7) |c___ldv_list_add_#in~new.base|))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse97 (let ((.cse98 (store |c_old(#memory_$Pointer$#1.base)| .cse23 (store .cse24 .cse99 |c___ldv_list_add_#in~new.base|)))) (store .cse98 |c___ldv_list_add_#in~new.base| (store (store (select .cse98 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| .cse23) .cse2 |c___ldv_list_add_#in~prev.base|))))) (store .cse97 |c___ldv_list_add_#in~prev.base| (store (select .cse97 |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 v_arrayElimArr_7 .cse99)) (= .cse3 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_5) .cse23 v_arrayElimArr_7) |c___ldv_list_add_#in~new.base| (store (store .cse100 |c___ldv_list_add_#in~new.offset| v___ldv_list_add_~next.offset_7) .cse2 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)) (= v_DerPreprocessor_4 .cse100)))))) (not .cse26) .cse70))))) (or (not .cse0) (not .cse15))))))) is different from false