./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:28:14,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:28:14,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:28:14,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:28:14,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:28:14,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:28:14,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:28:14,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:28:14,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:28:14,611 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:28:14,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:28:14,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:28:14,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:28:14,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:28:14,613 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:28:14,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:28:14,614 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:28:14,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:28:14,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:28:14,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:28:14,615 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:28:14,616 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:28:14,616 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:28:14,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:28:14,617 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:28:14,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:28:14,618 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:28:14,618 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:28:14,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:28:14,619 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:28:14,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:28:14,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:28:14,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:28:14,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:28:14,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:28:14,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:28:14,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:28:14,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:28:14,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:28:14,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:28:14,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:28:14,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:28:14,623 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2024-11-10 15:28:14,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:28:14,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:28:14,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:28:14,919 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:28:14,920 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:28:14,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-10 15:28:16,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:28:16,583 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:28:16,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-10 15:28:16,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31df5b6d/191350d3bf74448391b009f4b7f6f3c8/FLAGd1f664580 [2024-11-10 15:28:16,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31df5b6d/191350d3bf74448391b009f4b7f6f3c8 [2024-11-10 15:28:16,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:28:16,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:28:16,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:28:16,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:28:16,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:28:16,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:28:16" (1/1) ... [2024-11-10 15:28:16,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0302d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:16, skipping insertion in model container [2024-11-10 15:28:16,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:28:16" (1/1) ... [2024-11-10 15:28:16,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:28:17,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:28:17,029 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:28:17,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:28:17,156 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:28:17,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:17 WrapperNode [2024-11-10 15:28:17,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:28:17,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:28:17,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:28:17,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:28:17,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:17" (1/1) ... [2024-11-10 15:28:17,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:17" (1/1) ... [2024-11-10 15:28:17,215 INFO L138 Inliner]: procedures = 127, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 118 [2024-11-10 15:28:17,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:28:17,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:28:17,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:28:17,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:28:17,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:17" (1/1) ... [2024-11-10 15:28:17,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:17" (1/1) ... [2024-11-10 15:28:17,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:17" (1/1) ... [2024-11-10 15:28:17,261 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 7, 12]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2024-11-10 15:28:17,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:17" (1/1) ... [2024-11-10 15:28:17,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:17" (1/1) ... [2024-11-10 15:28:17,275 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:17" (1/1) ... [2024-11-10 15:28:17,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:17" (1/1) ... [2024-11-10 15:28:17,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:17" (1/1) ... [2024-11-10 15:28:17,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:17" (1/1) ... [2024-11-10 15:28:17,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:28:17,296 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:28:17,296 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:28:17,297 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:28:17,297 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:17" (1/1) ... [2024-11-10 15:28:17,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:28:17,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:17,329 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-10 15:28:17,331 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-10 15:28:17,373 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-10 15:28:17,374 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-10 15:28:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:28:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:28:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 15:28:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:28:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:28:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 15:28:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:28:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:28:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:28:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:28:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:28:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 15:28:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:28:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:28:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 15:28:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:28:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:28:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:28:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 15:28:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:28:17,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:28:17,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 15:28:17,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:28:17,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:28:17,527 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:28:17,529 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:28:17,554 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-10 15:28:17,866 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L621: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-10 15:28:17,891 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-10 15:28:17,892 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:28:17,906 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:28:17,907 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:28:17,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:28:17 BoogieIcfgContainer [2024-11-10 15:28:17,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:28:17,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:28:17,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:28:17,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:28:17,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:28:16" (1/3) ... [2024-11-10 15:28:17,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798dcfa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:28:17, skipping insertion in model container [2024-11-10 15:28:17,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:17" (2/3) ... [2024-11-10 15:28:17,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798dcfa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:28:17, skipping insertion in model container [2024-11-10 15:28:17,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:28:17" (3/3) ... [2024-11-10 15:28:17,919 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2024-11-10 15:28:17,943 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:28:17,943 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-10 15:28:17,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:28:18,003 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=None, 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;@6544cd94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:28:18,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-10 15:28:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 101 states have internal predecessors, (113), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:28:18,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:18,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:28:18,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:18,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash 319034843, now seen corresponding path program 1 times [2024-11-10 15:28:18,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:18,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922110069] [2024-11-10 15:28:18,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:18,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:18,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:18,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922110069] [2024-11-10 15:28:18,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922110069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:18,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:18,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:28:18,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265554333] [2024-11-10 15:28:18,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:18,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:18,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:18,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:18,302 INFO L87 Difference]: Start difference. First operand has 103 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 101 states have internal predecessors, (113), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:18,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:18,478 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2024-11-10 15:28:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:18,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 15:28:18,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:18,486 INFO L225 Difference]: With dead ends: 99 [2024-11-10 15:28:18,486 INFO L226 Difference]: Without dead ends: 92 [2024-11-10 15:28:18,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 15:28:18,491 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:18,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 147 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-10 15:28:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-10 15:28:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 91 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-10 15:28:18,524 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 6 [2024-11-10 15:28:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:18,524 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-10 15:28:18,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-10 15:28:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:28:18,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:18,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:28:18,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:28:18,526 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:18,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash 319034844, now seen corresponding path program 1 times [2024-11-10 15:28:18,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:18,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008080707] [2024-11-10 15:28:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:18,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:18,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:18,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:18,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008080707] [2024-11-10 15:28:18,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008080707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:18,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:18,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:28:18,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862626225] [2024-11-10 15:28:18,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:18,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:18,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:18,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:18,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:18,688 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:18,782 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-10 15:28:18,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:18,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 15:28:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:18,784 INFO L225 Difference]: With dead ends: 89 [2024-11-10 15:28:18,784 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 15:28:18,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 15:28:18,785 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 8 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:18,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 15:28:18,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-10 15:28:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 88 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-10 15:28:18,798 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 6 [2024-11-10 15:28:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:18,799 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-10 15:28:18,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-10 15:28:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:28:18,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:18,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:18,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:28:18,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:18,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:18,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1647410551, now seen corresponding path program 1 times [2024-11-10 15:28:18,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:18,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574380493] [2024-11-10 15:28:18,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:18,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:18,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:18,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574380493] [2024-11-10 15:28:18,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574380493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:18,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:18,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:28:18,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459092216] [2024-11-10 15:28:18,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:18,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:18,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:18,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:18,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:18,867 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:18,883 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-10 15:28:18,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:18,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 15:28:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:18,885 INFO L225 Difference]: With dead ends: 100 [2024-11-10 15:28:18,885 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 15:28:18,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 15:28:18,886 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 10 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:18,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 15:28:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2024-11-10 15:28:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.7142857142857142) internal successors, (96), 90 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2024-11-10 15:28:18,893 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 8 [2024-11-10 15:28:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:18,894 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2024-11-10 15:28:18,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2024-11-10 15:28:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:28:18,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:18,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:18,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:28:18,895 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:18,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash 623196277, now seen corresponding path program 1 times [2024-11-10 15:28:18,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:18,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791170256] [2024-11-10 15:28:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:18,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:18,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:18,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791170256] [2024-11-10 15:28:18,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791170256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:18,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:18,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:28:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088891596] [2024-11-10 15:28:18,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:18,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:18,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:18,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:18,997 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:19,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:19,018 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2024-11-10 15:28:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:19,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 15:28:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:19,020 INFO L225 Difference]: With dead ends: 96 [2024-11-10 15:28:19,020 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 15:28:19,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 15:28:19,021 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:19,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 15:28:19,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 15:28:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2024-11-10 15:28:19,028 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 10 [2024-11-10 15:28:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:19,028 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2024-11-10 15:28:19,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2024-11-10 15:28:19,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:28:19,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:19,029 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:19,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:28:19,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:19,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:19,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1448545545, now seen corresponding path program 1 times [2024-11-10 15:28:19,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:19,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784836887] [2024-11-10 15:28:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:19,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:19,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:19,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784836887] [2024-11-10 15:28:19,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784836887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:19,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950596312] [2024-11-10 15:28:19,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:19,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:19,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:19,139 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-10 15:28:19,141 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-10 15:28:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:19,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:28:19,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:19,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:19,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950596312] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:19,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:19,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-10 15:28:19,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241720971] [2024-11-10 15:28:19,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:19,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:28:19,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:19,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:28:19,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:19,368 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:19,394 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2024-11-10 15:28:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:28:19,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-10 15:28:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:19,396 INFO L225 Difference]: With dead ends: 99 [2024-11-10 15:28:19,396 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 15:28:19,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:19,398 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 10 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:19,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 271 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 15:28:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-10 15:28:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.625) internal successors, (104), 98 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2024-11-10 15:28:19,404 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 16 [2024-11-10 15:28:19,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:19,404 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2024-11-10 15:28:19,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2024-11-10 15:28:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:28:19,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:19,405 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:19,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 15:28:19,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:19,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:19,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1507513465, now seen corresponding path program 1 times [2024-11-10 15:28:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:19,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897508251] [2024-11-10 15:28:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:19,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897508251] [2024-11-10 15:28:19,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897508251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180867103] [2024-11-10 15:28:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:19,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:19,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:19,840 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-10 15:28:19,841 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-10 15:28:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:19,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 15:28:19,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:19,978 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-10 15:28:20,023 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:28:20,023 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 12 treesize of output 14 [2024-11-10 15:28:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:20,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:20,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180867103] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:20,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:20,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-10 15:28:20,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529085524] [2024-11-10 15:28:20,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:20,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:28:20,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:20,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:28:20,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:20,101 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:20,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:20,236 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2024-11-10 15:28:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:28:20,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 15:28:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:20,238 INFO L225 Difference]: With dead ends: 98 [2024-11-10 15:28:20,238 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 15:28:20,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:28:20,239 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:20,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 222 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 15:28:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-10 15:28:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.609375) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2024-11-10 15:28:20,250 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 18 [2024-11-10 15:28:20,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:20,250 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2024-11-10 15:28:20,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2024-11-10 15:28:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:28:20,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:20,251 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:20,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:28:20,451 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,SelfDestructingSolverStorable5 [2024-11-10 15:28:20,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:20,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:20,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1507513464, now seen corresponding path program 1 times [2024-11-10 15:28:20,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:20,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713903456] [2024-11-10 15:28:20,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:20,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:20,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:20,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713903456] [2024-11-10 15:28:20,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713903456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:20,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316126826] [2024-11-10 15:28:20,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:20,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:20,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:20,640 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-10 15:28:20,642 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-10 15:28:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:20,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 15:28:20,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:20,777 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 1 [2024-11-10 15:28:20,780 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-10 15:28:20,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:20,907 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 9 [2024-11-10 15:28:20,917 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:20,917 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-10 15:28:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:20,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:21,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316126826] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:21,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:21,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2024-11-10 15:28:21,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464586870] [2024-11-10 15:28:21,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:21,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:28:21,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:21,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:28:21,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:28:21,312 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:21,623 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2024-11-10 15:28:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:28:21,623 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 15:28:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:21,624 INFO L225 Difference]: With dead ends: 97 [2024-11-10 15:28:21,625 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 15:28:21,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:28:21,626 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 18 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:21,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 334 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:28:21,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 15:28:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-10 15:28:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.59375) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-11-10 15:28:21,632 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 18 [2024-11-10 15:28:21,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:21,635 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-11-10 15:28:21,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-11-10 15:28:21,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:28:21,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:21,636 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:21,656 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-10 15:28:21,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:21,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:21,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:21,843 INFO L85 PathProgramCache]: Analyzing trace with hash 512027291, now seen corresponding path program 2 times [2024-11-10 15:28:21,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:21,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081724195] [2024-11-10 15:28:21,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:21,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:21,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:21,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081724195] [2024-11-10 15:28:21,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081724195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:21,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838671462] [2024-11-10 15:28:21,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:28:21,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:21,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:21,923 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:21,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 15:28:22,025 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 15:28:22,025 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:28:22,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:28:22,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:22,034 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-10 15:28:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:22,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:28:22,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838671462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:22,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:28:22,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-10 15:28:22,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507553953] [2024-11-10 15:28:22,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:22,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:22,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:22,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:22,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:22,050 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:22,116 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-11-10 15:28:22,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:22,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-10 15:28:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:22,117 INFO L225 Difference]: With dead ends: 94 [2024-11-10 15:28:22,118 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 15:28:22,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:22,119 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:22,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 126 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:22,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 15:28:22,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 15:28:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.546875) internal successors, (99), 93 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-11-10 15:28:22,126 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 24 [2024-11-10 15:28:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:22,126 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-11-10 15:28:22,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-11-10 15:28:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:28:22,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:22,131 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:22,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 15:28:22,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:22,333 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:22,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash 512027292, now seen corresponding path program 1 times [2024-11-10 15:28:22,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:22,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346636623] [2024-11-10 15:28:22,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:22,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:22,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346636623] [2024-11-10 15:28:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346636623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205278326] [2024-11-10 15:28:22,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:22,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:22,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:22,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:22,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 15:28:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:22,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:28:22,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:22,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:22,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205278326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:22,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:22,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-10 15:28:22,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59345598] [2024-11-10 15:28:22,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:22,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:28:22,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:22,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:28:22,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:28:22,567 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:22,599 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2024-11-10 15:28:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:28:22,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-10 15:28:22,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:22,612 INFO L225 Difference]: With dead ends: 94 [2024-11-10 15:28:22,613 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 15:28:22,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:22,614 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 4 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:22,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 238 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:22,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 15:28:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 15:28:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.53125) internal successors, (98), 93 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2024-11-10 15:28:22,619 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 24 [2024-11-10 15:28:22,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:22,620 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-10 15:28:22,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2024-11-10 15:28:22,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:28:22,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:22,621 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:22,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:22,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:22,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:22,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:22,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2448471, now seen corresponding path program 1 times [2024-11-10 15:28:22,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:22,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450602420] [2024-11-10 15:28:22,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:22,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:22,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:22,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450602420] [2024-11-10 15:28:22,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450602420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:22,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:22,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:28:22,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069047182] [2024-11-10 15:28:22,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:22,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:22,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:22,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:22,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:22,946 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:22,997 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2024-11-10 15:28:22,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:22,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-10 15:28:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:23,000 INFO L225 Difference]: With dead ends: 91 [2024-11-10 15:28:23,000 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 15:28:23,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 15:28:23,001 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 3 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:23,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 131 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 15:28:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-10 15:28:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.484375) internal successors, (95), 90 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2024-11-10 15:28:23,006 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 25 [2024-11-10 15:28:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:23,006 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2024-11-10 15:28:23,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2024-11-10 15:28:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:28:23,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:23,007 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:23,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:28:23,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:23,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:23,008 INFO L85 PathProgramCache]: Analyzing trace with hash -487678463, now seen corresponding path program 1 times [2024-11-10 15:28:23,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:23,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559479974] [2024-11-10 15:28:23,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:23,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:23,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:23,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559479974] [2024-11-10 15:28:23,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559479974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:23,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199629821] [2024-11-10 15:28:23,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:23,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:23,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:23,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:23,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 15:28:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:23,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 15:28:23,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:23,489 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-10 15:28:23,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:23,528 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 12 treesize of output 14 [2024-11-10 15:28:23,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:23,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:23,661 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:28:23,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2024-11-10 15:28:23,696 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:28:23,696 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 12 treesize of output 14 [2024-11-10 15:28:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:23,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:23,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199629821] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:23,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:23,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 9 [2024-11-10 15:28:23,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198958935] [2024-11-10 15:28:23,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:23,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:28:23,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:23,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:28:23,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:28:23,884 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:24,050 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2024-11-10 15:28:24,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:28:24,051 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-10 15:28:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:24,051 INFO L225 Difference]: With dead ends: 99 [2024-11-10 15:28:24,052 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 15:28:24,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:28:24,052 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 141 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:24,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 164 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 15:28:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2024-11-10 15:28:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.390625) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2024-11-10 15:28:24,056 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 30 [2024-11-10 15:28:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:24,056 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2024-11-10 15:28:24,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2024-11-10 15:28:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:28:24,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:24,057 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:24,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 15:28:24,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:24,262 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:24,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:24,262 INFO L85 PathProgramCache]: Analyzing trace with hash -487678462, now seen corresponding path program 1 times [2024-11-10 15:28:24,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:24,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970672500] [2024-11-10 15:28:24,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:24,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:24,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:24,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970672500] [2024-11-10 15:28:24,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970672500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:24,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069793611] [2024-11-10 15:28:24,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:24,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:24,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:24,713 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:24,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 15:28:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:24,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 15:28:24,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:24,876 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 1 [2024-11-10 15:28:24,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:24,908 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 9 [2024-11-10 15:28:24,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:24,960 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 9 [2024-11-10 15:28:25,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:25,041 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 9 [2024-11-10 15:28:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:25,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:28:25,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069793611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:25,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:28:25,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-10 15:28:25,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716838971] [2024-11-10 15:28:25,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:25,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:28:25,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:25,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:28:25,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:28:25,074 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:25,147 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-11-10 15:28:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:28:25,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-10 15:28:25,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:25,148 INFO L225 Difference]: With dead ends: 79 [2024-11-10 15:28:25,148 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 15:28:25,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:28:25,149 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 53 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:25,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 101 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:25,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 15:28:25,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-10 15:28:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-10 15:28:25,152 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 30 [2024-11-10 15:28:25,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:25,152 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-10 15:28:25,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-10 15:28:25,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:28:25,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:25,153 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:25,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 15:28:25,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:25,354 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:25,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:25,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2061836878, now seen corresponding path program 1 times [2024-11-10 15:28:25,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:25,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407943252] [2024-11-10 15:28:25,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:25,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:25,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:25,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407943252] [2024-11-10 15:28:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407943252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:25,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:25,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:28:25,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060395587] [2024-11-10 15:28:25,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:25,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:28:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:25,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:28:25,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:25,453 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:25,536 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-11-10 15:28:25,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:28:25,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-10 15:28:25,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:25,550 INFO L225 Difference]: With dead ends: 78 [2024-11-10 15:28:25,550 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 15:28:25,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:25,551 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 11 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:25,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 167 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 15:28:25,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-10 15:28:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.28125) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-10 15:28:25,556 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 31 [2024-11-10 15:28:25,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:25,556 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-10 15:28:25,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-10 15:28:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:28:25,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:25,557 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:25,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:28:25,557 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:25,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:25,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2061836879, now seen corresponding path program 1 times [2024-11-10 15:28:25,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:25,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832543314] [2024-11-10 15:28:25,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:25,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:25,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:25,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832543314] [2024-11-10 15:28:25,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832543314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:25,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:25,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:28:25,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110516773] [2024-11-10 15:28:25,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:25,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:28:25,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:25,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:28:25,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:25,755 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:25,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:25,831 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2024-11-10 15:28:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:28:25,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-10 15:28:25,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:25,832 INFO L225 Difference]: With dead ends: 77 [2024-11-10 15:28:25,832 INFO L226 Difference]: Without dead ends: 77 [2024-11-10 15:28:25,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:25,833 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:25,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 182 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-10 15:28:25,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-10 15:28:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.265625) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2024-11-10 15:28:25,835 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 31 [2024-11-10 15:28:25,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:25,836 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2024-11-10 15:28:25,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:25,836 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2024-11-10 15:28:25,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:28:25,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:25,837 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 15:28:25,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:28:25,837 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:25,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:25,838 INFO L85 PathProgramCache]: Analyzing trace with hash 414614075, now seen corresponding path program 1 times [2024-11-10 15:28:25,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:25,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011090905] [2024-11-10 15:28:25,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:25,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:28:26,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:26,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011090905] [2024-11-10 15:28:26,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011090905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:26,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:26,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:28:26,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129762160] [2024-11-10 15:28:26,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:26,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:28:26,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:26,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:28:26,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:28:26,107 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:26,281 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2024-11-10 15:28:26,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:26,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-10 15:28:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:26,282 INFO L225 Difference]: With dead ends: 76 [2024-11-10 15:28:26,283 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 15:28:26,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:28:26,283 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 30 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:26,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 282 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:28:26,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 15:28:26,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-10 15:28:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.25) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-11-10 15:28:26,286 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 36 [2024-11-10 15:28:26,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:26,286 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-11-10 15:28:26,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:26,286 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-11-10 15:28:26,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:28:26,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:26,287 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 15:28:26,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:28:26,287 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:26,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:26,287 INFO L85 PathProgramCache]: Analyzing trace with hash 414614076, now seen corresponding path program 1 times [2024-11-10 15:28:26,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:26,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222452932] [2024-11-10 15:28:26,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:26,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:26,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:26,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222452932] [2024-11-10 15:28:26,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222452932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:26,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:26,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:28:26,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606937859] [2024-11-10 15:28:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:26,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:26,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:26,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:26,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:26,650 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:26,803 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2024-11-10 15:28:26,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:26,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-10 15:28:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:26,804 INFO L225 Difference]: With dead ends: 75 [2024-11-10 15:28:26,804 INFO L226 Difference]: Without dead ends: 75 [2024-11-10 15:28:26,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:28:26,805 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 10 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:26,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 249 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-10 15:28:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-10 15:28:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.234375) internal successors, (79), 74 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-11-10 15:28:26,808 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 36 [2024-11-10 15:28:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:26,809 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-11-10 15:28:26,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2024-11-10 15:28:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 15:28:26,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:26,810 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 15:28:26,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:28:26,811 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:26,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:26,811 INFO L85 PathProgramCache]: Analyzing trace with hash 307144407, now seen corresponding path program 1 times [2024-11-10 15:28:26,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:26,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008493758] [2024-11-10 15:28:26,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:26,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:27,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:27,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008493758] [2024-11-10 15:28:27,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008493758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:27,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:27,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:28:27,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344271463] [2024-11-10 15:28:27,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:27,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:27,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:27,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:27,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:27,024 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:27,108 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-11-10 15:28:27,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:27,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 15:28:27,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:27,109 INFO L225 Difference]: With dead ends: 75 [2024-11-10 15:28:27,109 INFO L226 Difference]: Without dead ends: 75 [2024-11-10 15:28:27,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:28:27,110 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 12 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:27,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 312 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:27,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-10 15:28:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-10 15:28:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.21875) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-10 15:28:27,112 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 41 [2024-11-10 15:28:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:27,113 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-10 15:28:27,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-10 15:28:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 15:28:27,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:27,114 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 15:28:27,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:28:27,114 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:27,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:27,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1465730447, now seen corresponding path program 1 times [2024-11-10 15:28:27,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:27,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775022536] [2024-11-10 15:28:27,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:27,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:27,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:27,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775022536] [2024-11-10 15:28:27,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775022536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:27,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:27,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:28:27,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127664853] [2024-11-10 15:28:27,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:27,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:27,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:27,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:27,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:27,347 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:27,462 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2024-11-10 15:28:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:28:27,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-10 15:28:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:27,463 INFO L225 Difference]: With dead ends: 77 [2024-11-10 15:28:27,463 INFO L226 Difference]: Without dead ends: 77 [2024-11-10 15:28:27,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:28:27,464 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 25 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:27,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 211 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-10 15:28:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-10 15:28:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 76 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2024-11-10 15:28:27,467 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 44 [2024-11-10 15:28:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:27,467 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2024-11-10 15:28:27,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2024-11-10 15:28:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 15:28:27,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:27,468 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 15:28:27,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:28:27,468 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:27,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:27,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1465730448, now seen corresponding path program 1 times [2024-11-10 15:28:27,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:27,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550712994] [2024-11-10 15:28:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:27,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:27,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:27,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550712994] [2024-11-10 15:28:27,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550712994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:27,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:27,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:28:27,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617263322] [2024-11-10 15:28:27,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:27,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:28:27,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:27,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:28:27,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:28:27,878 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:28,030 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-11-10 15:28:28,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:28,031 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-10 15:28:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:28,032 INFO L225 Difference]: With dead ends: 79 [2024-11-10 15:28:28,032 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 15:28:28,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:28:28,033 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 26 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:28,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 246 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 15:28:28,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-10 15:28:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-10 15:28:28,035 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 44 [2024-11-10 15:28:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:28,036 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-10 15:28:28,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-10 15:28:28,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 15:28:28,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:28,037 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 15:28:28,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:28:28,037 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:28,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:28,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1358018007, now seen corresponding path program 1 times [2024-11-10 15:28:28,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:28,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54197578] [2024-11-10 15:28:28,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:28,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:28,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:28,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54197578] [2024-11-10 15:28:28,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54197578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:28,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:28,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:28:28,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139231344] [2024-11-10 15:28:28,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:28,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:28:28,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:28,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:28:28,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:28:28,265 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:28,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:28,357 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2024-11-10 15:28:28,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:28,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-10 15:28:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:28,358 INFO L225 Difference]: With dead ends: 79 [2024-11-10 15:28:28,358 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 15:28:28,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:28:28,359 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:28,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 311 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 15:28:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-10 15:28:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-11-10 15:28:28,362 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 47 [2024-11-10 15:28:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:28,362 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-11-10 15:28:28,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:28,363 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-11-10 15:28:28,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 15:28:28,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:28,363 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-11-10 15:28:28,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 15:28:28,363 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:28,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:28,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1472230446, now seen corresponding path program 1 times [2024-11-10 15:28:28,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:28,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864493895] [2024-11-10 15:28:28,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:28,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:28:29,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:29,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864493895] [2024-11-10 15:28:29,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864493895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:29,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:29,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 15:28:29,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590536570] [2024-11-10 15:28:29,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:29,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 15:28:29,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:29,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 15:28:29,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:28:29,189 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:29,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:29,499 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2024-11-10 15:28:29,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:28:29,500 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 15:28:29,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:29,500 INFO L225 Difference]: With dead ends: 84 [2024-11-10 15:28:29,500 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 15:28:29,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:28:29,501 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 32 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:29,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 412 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:28:29,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 15:28:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-11-10 15:28:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-10 15:28:29,505 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 50 [2024-11-10 15:28:29,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:29,505 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-10 15:28:29,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-10 15:28:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 15:28:29,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:29,506 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:29,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 15:28:29,507 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:29,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:29,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1472328754, now seen corresponding path program 1 times [2024-11-10 15:28:29,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:29,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114674144] [2024-11-10 15:28:29,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:29,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:28:30,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:30,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114674144] [2024-11-10 15:28:30,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114674144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:30,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567791165] [2024-11-10 15:28:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:30,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:30,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:30,678 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:30,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 15:28:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:30,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-10 15:28:30,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:30,933 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-10 15:28:31,048 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:28:31,048 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 15 treesize of output 15 [2024-11-10 15:28:31,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-10 15:28:31,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:31,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2024-11-10 15:28:31,557 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:31,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2024-11-10 15:28:31,576 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 15 treesize of output 1 [2024-11-10 15:28:31,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:31,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2024-11-10 15:28:31,691 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:31,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:31,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 31 [2024-11-10 15:28:31,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:31,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 21 [2024-11-10 15:28:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:31,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:32,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-10 15:28:36,199 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) 1))))) (and (or .cse0 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|) .cse0) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int)) (or (< |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_15|) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#2.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) 1) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0))))) is different from false [2024-11-10 15:28:36,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:36,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 225 [2024-11-10 15:28:40,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse64 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse64 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse12 (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)) .cse3))) (.cse18 (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4)) .cse3))) (.cse30 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (forall ((v_ArrVal_1646 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int)) (= .cse3 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))))) (.cse17 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_ArrVal_1646 (Array Int Int))) (or (= .cse3 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0)))) (.cse5 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse64 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (and (or .cse0 (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse5) (+ v_prenex_4 4))) (.cse1 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (< |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| v_prenex_4) (= .cse1 .cse2) (= .cse3 .cse2) (= .cse1 .cse3) (< v_prenex_4 0))))) (forall ((v_prenex_4 Int) (v_ArrVal_1646 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse5) (+ v_prenex_4 4))) (.cse6 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (= .cse6 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) (< |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| v_prenex_4) (= .cse6 .cse7) (= .cse3 .cse7) (= .cse6 .cse3) (< v_prenex_4 0)))) (or .cse8 (forall ((v_prenex_4 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_ArrVal_1646 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) (.cse11 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4))) (.cse10 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (= .cse3 .cse9) (= .cse10 .cse9) (= .cse11 .cse3) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0) (= .cse11 .cse10))))) (or (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| v_prenex_4) (= .cse3 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse5) (+ v_prenex_4 4))) (< v_prenex_4 0))) (and (or .cse12 .cse0) (forall ((v_ArrVal_1646 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (= .cse13 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) (= .cse13 .cse3)))))) (or .cse8 (and (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse16 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4)))) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int)) (or (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse14 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4)))) (or (= .cse3 .cse14) (= .cse15 .cse14) (= .cse16 .cse14)))) (= .cse15 .cse3)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0))) (= .cse16 .cse3)))) (or .cse17 .cse18 .cse12) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_prenex_4 Int) (v_ArrVal_1646 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse19 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) (.cse20 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (= .cse3 .cse19) (= .cse20 .cse19) (= (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4)) .cse19) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0) (= .cse20 .cse3)))) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_ArrVal_1646 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse21 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) (.cse22 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (= .cse3 .cse21) (= .cse22 .cse21) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0) (= .cse22 .cse3)))) .cse18))) (forall ((v_prenex_4 Int)) (or (< |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| v_prenex_4) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse23 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (forall ((v_prenex_3 (Array Int Int))) (let ((.cse24 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse5) (+ v_prenex_4 4)))) (or (= .cse23 .cse24) (= .cse3 .cse24) (forall ((v_ArrVal_1646 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int)) (= (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4)) .cse24))))) (= .cse23 .cse3)))) (< v_prenex_4 0))) (or .cse8 (forall ((v_ArrVal_1646 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse25 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) (.cse27 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4))) (.cse26 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (= .cse3 .cse25) (= .cse26 .cse25) (= .cse27 .cse25) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0) (= .cse27 .cse26))))) (forall ((v_prenex_4 Int) (v_ArrVal_1646 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse28 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse5) (+ v_prenex_4 4)))) (or (< |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| v_prenex_4) (= (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)) .cse28) (= .cse3 .cse28) (= (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4)) .cse28) (< v_prenex_4 0)))) (or (forall ((v_ArrVal_1646 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse29 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (= .cse29 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) (= .cse29 .cse3) (< v_prenex_2 0) (= (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4)) .cse29)))) .cse30) (or (and (or (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)) .cse3) (< v_prenex_2 0))) .cse0) (forall ((v_ArrVal_1646 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse31 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (= .cse31 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) (= .cse31 .cse3) (< v_prenex_2 0))))) .cse30 .cse18) (forall ((v_prenex_4 Int) (v_ArrVal_1646 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse33 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4))) (.cse32 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) (.cse34 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse5) (+ v_prenex_4 4)))) (or (= .cse3 .cse32) (= .cse33 .cse32) (< |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| v_prenex_4) (= .cse33 .cse34) (= .cse3 .cse34) (= .cse32 .cse34) (< v_prenex_4 0)))) (forall ((v_prenex_4 Int) (v_ArrVal_1646 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4))) (.cse36 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) (.cse37 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse5) (+ v_prenex_4 4)))) (or (= .cse35 .cse36) (< |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| v_prenex_4) (= .cse35 .cse37) (= .cse3 .cse37) (= .cse36 .cse37) (< v_prenex_4 0)))) (or .cse30 (and (or (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse38 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4))) (.cse39 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (= .cse38 .cse3) (= .cse39 .cse3) (< v_prenex_2 0) (= .cse38 .cse39)))) .cse0) (forall ((v_prenex_2 Int)) (or (< v_prenex_2 0) (forall ((v_prenex_1 (Array Int Int))) (let ((.cse41 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse40 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4)))) (or (= .cse40 .cse41) (forall ((v_ArrVal_1646 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int)) (let ((.cse42 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4)))) (or (= .cse3 .cse42) (= .cse40 .cse42))))))) (= .cse41 .cse3)))))))) (or .cse8 (and (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse43 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4)))) (or (= .cse43 .cse3) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int)) (or (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse45 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse44 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4)))) (or (= .cse3 .cse44) (= .cse45 .cse44) (= .cse43 .cse44)))) (= .cse45 .cse3) (= .cse43 .cse45)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0)))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_prenex_4 Int) (v_ArrVal_1646 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse46 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) (.cse48 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4))) (.cse47 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (= .cse3 .cse46) (= .cse47 .cse46) (= .cse48 .cse46) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0) (= .cse47 .cse3) (= .cse48 .cse47)))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse49 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4)))) (or (= .cse49 .cse3) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_ArrVal_1646 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse50 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) (.cse51 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (= .cse3 .cse50) (= .cse51 .cse50) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0) (= .cse51 .cse3) (= .cse49 .cse51))))))))) (or .cse8 (and (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse52 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (= .cse52 .cse3) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse53 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4)))) (or (= .cse53 .cse3) (= .cse53 .cse52) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0) (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse54 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4)))) (or (= .cse3 .cse54) (= .cse53 .cse54)))))))))))) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse57 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (let ((.cse56 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4)))) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_ArrVal_1646 (Array Int Int))) (let ((.cse55 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4)))) (or (= .cse3 .cse55) (= .cse56 .cse55) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0)))) (= .cse56 .cse57)))) (= .cse57 .cse3)))) (or .cse17 (forall ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse58 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4))) (.cse59 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)))) (or (= .cse58 .cse3) (= .cse59 .cse3) (= .cse58 .cse59))))))) (forall ((v_prenex_4 Int) (v_ArrVal_1646 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse60 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4))) (.cse61 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4))) (.cse62 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse5) (+ v_prenex_4 4)))) (or (= .cse3 .cse60) (= .cse61 .cse60) (< |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| v_prenex_4) (= .cse61 .cse62) (= .cse3 .cse62) (< v_prenex_4 0)))) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_15| Int) (v_prenex_4 Int) (v_ArrVal_1646 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse63 (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1646) .cse4) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 4)))) (or (= .cse3 .cse63) (= (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_1) .cse4) (+ v_prenex_2 4)) .cse63) (= (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_prenex_3) .cse4) (+ v_prenex_4 4)) .cse63) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_15| 0)))) .cse8))))) is different from false [2024-11-10 15:28:42,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:42,678 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 157 [2024-11-10 15:28:42,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:42,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 511 treesize of output 480 [2024-11-10 15:28:42,733 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 122 treesize of output 114 [2024-11-10 15:28:42,741 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 229 treesize of output 209 [2024-11-10 15:28:42,749 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 92 treesize of output 80 [2024-11-10 15:28:42,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:42,881 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 133 [2024-11-10 15:28:42,951 INFO L349 Elim1Store]: treesize reduction 12, result has 82.9 percent of original size [2024-11-10 15:28:42,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 407 treesize of output 358 [2024-11-10 15:28:42,968 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 70 treesize of output 58 [2024-11-10 15:28:42,979 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 43 treesize of output 35 [2024-11-10 15:28:42,988 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 19 treesize of output 15 [2024-11-10 15:28:43,028 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-10 15:28:43,028 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 1 [2024-11-10 15:28:43,035 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-10 15:28:43,035 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 264 treesize of output 1 [2024-11-10 15:28:43,048 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-10 15:28:43,048 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 1 [2024-11-10 15:28:43,057 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-10 15:28:43,059 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 1 [2024-11-10 15:28:43,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:43,073 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 109 [2024-11-10 15:28:43,138 INFO L349 Elim1Store]: treesize reduction 12, result has 82.9 percent of original size [2024-11-10 15:28:43,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 354 treesize of output 315 [2024-11-10 15:28:43,148 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 23 treesize of output 19 [2024-11-10 15:28:43,154 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 23 treesize of output 19 [2024-11-10 15:28:43,159 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 62 treesize of output 50 [2024-11-10 15:28:43,205 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-10 15:28:43,205 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 1 [2024-11-10 15:28:43,215 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-10 15:28:43,215 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 1 [2024-11-10 15:28:43,226 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-10 15:28:43,226 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 1 [2024-11-10 15:28:43,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:43,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 25 [2024-11-10 15:28:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:51,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567791165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:51,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:51,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 46 [2024-11-10 15:28:51,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719143660] [2024-11-10 15:28:51,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:51,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-10 15:28:51,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:51,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-10 15:28:51,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1828, Unknown=19, NotChecked=174, Total=2162 [2024-11-10 15:28:51,984 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 47 states, 46 states have (on average 2.630434782608696) internal successors, (121), 47 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:55,234 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-11-10 15:28:55,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 15:28:55,235 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.630434782608696) internal successors, (121), 47 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 15:28:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:55,235 INFO L225 Difference]: With dead ends: 83 [2024-11-10 15:28:55,235 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 15:28:55,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=282, Invalid=3247, Unknown=19, NotChecked=234, Total=3782 [2024-11-10 15:28:55,237 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 82 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:55,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 834 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1219 Invalid, 0 Unknown, 136 Unchecked, 2.0s Time] [2024-11-10 15:28:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 15:28:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-10 15:28:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 82 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-11-10 15:28:55,240 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 50 [2024-11-10 15:28:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:55,240 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-11-10 15:28:55,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.630434782608696) internal successors, (121), 47 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-11-10 15:28:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 15:28:55,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:55,241 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:55,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 15:28:55,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-10 15:28:55,442 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:28:55,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:55,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1472328755, now seen corresponding path program 1 times [2024-11-10 15:28:55,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:55,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927370351] [2024-11-10 15:28:55,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:55,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:56,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:56,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927370351] [2024-11-10 15:28:56,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927370351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:56,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939276633] [2024-11-10 15:28:56,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:56,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:56,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:56,952 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:56,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 15:28:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:57,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-10 15:28:57,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:57,214 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 1 [2024-11-10 15:28:57,216 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-10 15:28:57,386 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:28:57,386 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 15 treesize of output 15 [2024-11-10 15:28:57,396 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 18 treesize of output 13 [2024-11-10 15:28:57,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-10 15:28:57,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-10 15:28:57,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:57,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2024-11-10 15:28:58,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:58,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2024-11-10 15:28:58,050 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:58,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 31 [2024-11-10 15:28:58,058 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:58,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2024-11-10 15:28:58,142 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:58,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2024-11-10 15:28:58,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:58,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:58,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 37 [2024-11-10 15:28:58,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:28:58,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2024-11-10 15:28:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:58,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:58,629 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_1828 (Array Int Int)) (v_ArrVal_1827 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1827) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1828) .cse0) .cse1)))) (forall ((v_ArrVal_1827 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1827) .cse0) .cse1) 4))))) is different from false [2024-11-10 15:28:58,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:58,813 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 102 [2024-11-10 15:28:58,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:58,820 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 92 [2024-11-10 15:28:58,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:58,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 186 treesize of output 185 [2024-11-10 15:28:58,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:58,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 288 treesize of output 257 [2024-11-10 15:28:58,862 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 59 treesize of output 43 [2024-11-10 15:28:58,869 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 43 treesize of output 27 [2024-11-10 15:28:58,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:58,908 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 53 [2024-11-10 15:28:58,911 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:58,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:58,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2024-11-10 15:28:59,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2024-11-10 15:28:59,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:59,490 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 80 treesize of output 76 [2024-11-10 15:28:59,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2024-11-10 15:28:59,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:59,509 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 65 treesize of output 65 [2024-11-10 15:29:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:29:00,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939276633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:29:00,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:29:00,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 18] total 53 [2024-11-10 15:29:00,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192305202] [2024-11-10 15:29:00,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:00,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-10 15:29:00,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:00,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-10 15:29:00,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2562, Unknown=28, NotChecked=102, Total=2862 [2024-11-10 15:29:00,105 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 54 states, 53 states have (on average 2.509433962264151) internal successors, (133), 54 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:02,109 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-11-10 15:29:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 15:29:02,109 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.509433962264151) internal successors, (133), 54 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 15:29:02,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:02,110 INFO L225 Difference]: With dead ends: 85 [2024-11-10 15:29:02,110 INFO L226 Difference]: Without dead ends: 85 [2024-11-10 15:29:02,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=344, Invalid=4460, Unknown=30, NotChecked=136, Total=4970 [2024-11-10 15:29:02,112 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 96 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:02,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1079 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1510 Invalid, 0 Unknown, 70 Unchecked, 1.0s Time] [2024-11-10 15:29:02,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-10 15:29:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-10 15:29:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2024-11-10 15:29:02,115 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 50 [2024-11-10 15:29:02,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:02,115 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2024-11-10 15:29:02,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.509433962264151) internal successors, (133), 54 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2024-11-10 15:29:02,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 15:29:02,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:02,116 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:02,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 15:29:02,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:02,317 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:29:02,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:02,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1938617510, now seen corresponding path program 1 times [2024-11-10 15:29:02,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:02,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976469631] [2024-11-10 15:29:02,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:02,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:29:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:03,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976469631] [2024-11-10 15:29:03,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976469631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:03,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744761692] [2024-11-10 15:29:03,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:03,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:03,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:03,364 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:29:03,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 15:29:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:03,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-10 15:29:03,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:03,610 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 6 treesize of output 5 [2024-11-10 15:29:03,751 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:29:03,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 15:29:03,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-10 15:29:04,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:04,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2024-11-10 15:29:04,150 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:04,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 30 [2024-11-10 15:29:04,156 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 15 treesize of output 1 [2024-11-10 15:29:04,248 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:04,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-10 15:29:04,254 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:04,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:04,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 27 [2024-11-10 15:29:04,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-10 15:29:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:29:04,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:04,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-10 15:29:04,644 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse2 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (or (forall ((v_ArrVal_2006 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2006) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) 0))) (not .cse1) (not .cse2)) (or (forall ((v_arrayElimCell_83 Int) (v_ArrVal_2006 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2006) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 v_arrayElimCell_83)) 0))) (and .cse1 .cse2)))) is different from false [2024-11-10 15:29:04,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:04,681 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-10 15:29:04,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:04,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 59 treesize of output 58 [2024-11-10 15:29:04,692 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 38 treesize of output 34 [2024-11-10 15:29:04,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:04,705 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-10 15:29:04,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-11-10 15:29:04,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:04,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 25 [2024-11-10 15:29:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:29:05,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744761692] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:29:05,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:29:05,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 47 [2024-11-10 15:29:05,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084467798] [2024-11-10 15:29:05,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:05,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-10 15:29:05,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:05,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-10 15:29:05,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1918, Unknown=13, NotChecked=88, Total=2162 [2024-11-10 15:29:05,242 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 47 states, 47 states have (on average 2.74468085106383) internal successors, (129), 47 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:06,457 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2024-11-10 15:29:06,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 15:29:06,458 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.74468085106383) internal successors, (129), 47 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-10 15:29:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:06,458 INFO L225 Difference]: With dead ends: 85 [2024-11-10 15:29:06,458 INFO L226 Difference]: Without dead ends: 85 [2024-11-10 15:29:06,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=277, Invalid=3254, Unknown=13, NotChecked=116, Total=3660 [2024-11-10 15:29:06,459 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 112 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:06,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1001 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1089 Invalid, 0 Unknown, 64 Unchecked, 0.6s Time] [2024-11-10 15:29:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-10 15:29:06,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-10 15:29:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-10 15:29:06,462 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 53 [2024-11-10 15:29:06,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:06,462 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-10 15:29:06,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.74468085106383) internal successors, (129), 47 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:06,463 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-10 15:29:06,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 15:29:06,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:06,463 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:29:06,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-10 15:29:06,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 15:29:06,668 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 38 more)] === [2024-11-10 15:29:06,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1476240239, now seen corresponding path program 1 times [2024-11-10 15:29:06,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:06,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336345524] [2024-11-10 15:29:06,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:29:08,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:08,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336345524] [2024-11-10 15:29:08,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336345524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:08,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612365334] [2024-11-10 15:29:08,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:08,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:08,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:08,485 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:29:08,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 15:29:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:08,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-10 15:29:08,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:08,729 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-10 15:29:08,844 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:29:08,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:29:08,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:29:08,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:29:08,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:29:08,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-10 15:29:09,208 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-10 15:29:09,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-10 15:29:09,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2024-11-10 15:29:09,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2024-11-10 15:29:09,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2024-11-10 15:29:09,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2024-11-10 15:29:09,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 15:29:09,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:29:09,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:09,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-10 15:29:09,919 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:09,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:09,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 15 [2024-11-10 15:29:09,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:09,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-10 15:29:09,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:09,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-10 15:29:09,977 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:09,979 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:09,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 27 [2024-11-10 15:29:10,071 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:10,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-10 15:29:10,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 15:29:10,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-10 15:29:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:29:10,442 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:11,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:11,313 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 83 [2024-11-10 15:29:11,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:11,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 168 treesize of output 167 [2024-11-10 15:29:11,342 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 71 treesize of output 55 [2024-11-10 15:29:11,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:11,351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2024-11-10 15:29:11,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:11,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 104 treesize of output 103 [2024-11-10 15:29:11,377 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 41 treesize of output 25 [2024-11-10 15:29:18,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1206 treesize of output 1136 [2024-11-10 15:29:18,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1130 treesize of output 992 [2024-11-10 15:29:18,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:18,364 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 1044 treesize of output 908 [2024-11-10 15:29:18,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:18,454 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 912 treesize of output 850 [2024-11-10 15:29:19,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:19,107 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 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-10 15:29:19,137 INFO L349 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2024-11-10 15:29:19,138 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 51 [2024-11-10 15:29:28,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (.cse26 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse1 (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse32 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse0 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1))) (and (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_300 Int) (v_prenex_301 (Array Int Int)) (v_arrayElimCell_119 Int)) (or (= v_arrayElimCell_119 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_300) (< v_prenex_300 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_301) v_arrayElimCell_119) v_prenex_300)))) .cse0) (or .cse1 .cse0 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_239 (Array Int Int)) (v_prenex_237 Int) (v_prenex_238 Int) (v_prenex_235 Int) (v_prenex_236 Int) (v_arrayElimCell_121 Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_239))) (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_235))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 v_prenex_238) v_prenex_236)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 v_prenex_237) v_prenex_236)) (< v_prenex_236 0)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or .cse4 (forall ((v_prenex_258 Int) (v_prenex_233 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_arrayElimCell_121 Int) (v_prenex_234 (Array Int Int))) (let ((.cse5 (let ((.cse6 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_234))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_231))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_232 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 v_prenex_233) v_prenex_232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 v_prenex_258) v_prenex_232)))))) (or .cse4 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_222 Int) (v_prenex_221 Int) (v_arrayElimCell_112 Int) (v_prenex_223 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_223))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 v_prenex_222) v_prenex_221)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 v_arrayElimCell_112) v_prenex_221)) (< v_prenex_221 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_25| Int) (v_arrayElimCell_111 Int) (v_ArrVal_2194 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_25| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_ArrVal_2194) v_arrayElimCell_111) |v_ULTIMATE.start_main_~ptr~0#1.offset_25|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_224 Int) (v_prenex_225 Int) (v_prenex_226 (Array Int Int))) (or (< v_prenex_224 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_226) v_prenex_225) v_prenex_224)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_prenex_253 Int) (v_arrayElimCell_121 Int) (v_prenex_251 Int) (v_prenex_254 (Array Int Int)) (v_prenex_252 Int) (v_prenex_250 Int) (v_arrayElimCell_119 Int)) (let ((.cse8 (let ((.cse9 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_254))) (store .cse9 v_arrayElimCell_119 (store (select .cse9 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_250))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 v_prenex_252) v_prenex_251)) (< v_prenex_251 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 v_prenex_253) v_prenex_251))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_299 (Array Int Int))) (or (< v_prenex_297 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_299) v_prenex_298) v_prenex_297)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_227 Int) (v_arrayElimCell_121 Int) (v_prenex_230 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse10 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_230))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_227))) v_prenex_229) v_prenex_228)) (< v_prenex_228 0))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_294 (Array Int Int)) (v_prenex_293 Int) (v_prenex_292 Int) (v_prenex_290 Int)) (let ((.cse11 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_294))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_prenex_293) v_prenex_292)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_prenex_290) v_prenex_292)) (< v_prenex_292 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= v_arrayElimCell_119 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_244 Int) (v_prenex_245 Int) (v_prenex_263 Int) (v_prenex_246 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse12 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_246))) (store .cse12 v_arrayElimCell_119 (store (select .cse12 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_244))) v_prenex_263) v_prenex_245)) (< v_prenex_245 0))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int) (v_arrayElimCell_119 Int)) (let ((.cse13 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 v_prenex_285) v_prenex_284)) (< v_prenex_284 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 v_arrayElimCell_119) v_prenex_284))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_242 Int) (v_arrayElimCell_121 Int) (v_prenex_240 Int) (v_prenex_243 (Array Int Int)) (v_prenex_241 Int)) (or (< v_prenex_241 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse14 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_243))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_240))) v_prenex_242) v_prenex_241)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int)) (let ((.cse15 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_prenex_285) v_prenex_284)) (< v_prenex_284 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) v_prenex_284))))))) (or .cse4 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= v_arrayElimCell_119 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_270 (Array Int Int)) (v_prenex_273 Int) (v_prenex_271 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_270) v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_273) v_prenex_271)) (< v_prenex_271 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_279 Int) (v_arrayElimCell_121 Int) (v_prenex_276 Int) (v_prenex_265 (Array Int Int)) (v_prenex_283 Int) (v_prenex_281 Int) (v_arrayElimCell_119 Int)) (let ((.cse16 (let ((.cse17 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_265))) (store .cse17 v_arrayElimCell_119 (store (select .cse17 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_283))))) (or (< v_prenex_279 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_prenex_281) v_prenex_279)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_prenex_276) v_prenex_279))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_266 Int) (v_prenex_264 Int) (v_arrayElimCell_121 Int) (v_prenex_272 Int) (v_prenex_269 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse18 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_269))) (let ((.cse19 (store (select .cse18 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_272))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse18 v_arrayElimCell_119 .cse19) v_prenex_266) v_prenex_264)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 v_prenex_264)) (< v_prenex_264 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_278 Int) (v_arrayElimCell_121 Int) (v_prenex_282 Int) (v_prenex_267 (Array Int Int)) (v_prenex_280 Int)) (or (< v_prenex_282 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse20 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_267))) (store .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_280))) v_prenex_278) v_prenex_282)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= v_arrayElimCell_119 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_277 Int) (v_prenex_275 Int) (v_prenex_274 Int) (v_prenex_268 (Array Int Int))) (or (< v_prenex_275 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse21 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_268))) (store .cse21 v_arrayElimCell_119 (store (select .cse21 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_274))) v_prenex_277) v_prenex_275)))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_289 Int) (v_prenex_295 (Array Int Int)) (v_prenex_287 Int)) (or (< v_prenex_287 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_295) v_prenex_289) v_prenex_287)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_300 Int) (v_prenex_301 (Array Int Int)) (v_arrayElimCell_119 Int)) (or (= v_arrayElimCell_119 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< v_prenex_300 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_301) v_arrayElimCell_119) v_prenex_300)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_288 Int) (v_prenex_296 (Array Int Int)) (v_prenex_291 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_296) v_prenex_291) v_prenex_288)) (< v_prenex_288 0))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_259 Int) (v_prenex_261 (Array Int Int)) (v_arrayElimCell_121 Int) (v_prenex_262 Int) (v_prenex_260 Int) (v_arrayElimCell_119 Int)) (let ((.cse22 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_261))) (let ((.cse23 (store (select .cse22 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_262))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse22 v_arrayElimCell_119 .cse23) v_prenex_260) v_prenex_259)) (< v_prenex_259 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_prenex_259)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_ArrVal_2196 Int) (v_prenex_255 Int) (v_prenex_256 Int) (v_arrayElimCell_121 Int) (v_prenex_257 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_257))) (let ((.cse25 (store (select .cse24 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_121 8) v_ArrVal_2196))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse24 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse25) v_prenex_256) v_prenex_255)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 v_prenex_255)) (< v_prenex_255 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= v_arrayElimCell_119 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_248 Int) (v_prenex_247 Int) (v_prenex_249 (Array Int Int))) (or (< v_prenex_248 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_249) v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_247) v_prenex_248)))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_299 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_297 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_297) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_299) v_prenex_298) v_prenex_297)))) .cse0) (or .cse26 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_300 Int) (v_prenex_301 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_300) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< v_prenex_300 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_301) |c_ULTIMATE.start_dll_create_~head~0#1.base|) v_prenex_300))))) (or .cse27 .cse26 (forall ((v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_299 (Array Int Int))) (or (< v_prenex_297 0) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_299) v_prenex_298) v_prenex_297) |c_ULTIMATE.start_main_~data~0#1|) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_297)))) (or .cse4 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_222 Int) (v_prenex_221 Int) (v_arrayElimCell_112 Int) (v_prenex_223 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_223))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse28 v_prenex_222) v_prenex_221)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse28 v_arrayElimCell_112) v_prenex_221)) (< v_prenex_221 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_221)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_25| Int) (v_arrayElimCell_111 Int) (v_ArrVal_2194 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_25| 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_25|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_ArrVal_2194) v_arrayElimCell_111) |v_ULTIMATE.start_main_~ptr~0#1.offset_25|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_224 Int) (v_prenex_225 Int) (v_prenex_226 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_224) (< v_prenex_224 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_226) v_prenex_225) v_prenex_224))))))) .cse0) (or .cse0 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int) (v_arrayElimCell_119 Int)) (let ((.cse29 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse29 v_prenex_285) v_prenex_284)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_284) (< v_prenex_284 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse29 v_arrayElimCell_119) v_prenex_284)))))) (or .cse1 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_253 Int) (v_prenex_251 Int) (v_prenex_254 (Array Int Int)) (v_prenex_252 Int) (v_prenex_250 Int) (v_arrayElimCell_119 Int)) (let ((.cse30 (let ((.cse31 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_254))) (store .cse31 v_arrayElimCell_119 (store (select .cse31 v_arrayElimCell_119) .cse32 v_prenex_250))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 v_prenex_252) v_prenex_251)) (= (select (select .cse30 v_prenex_253) v_prenex_251) |c_ULTIMATE.start_main_~data~0#1|) (< v_prenex_251 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_259 Int) (v_prenex_261 (Array Int Int)) (v_prenex_262 Int) (v_prenex_260 Int) (v_arrayElimCell_119 Int)) (let ((.cse34 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_261))) (let ((.cse33 (store (select .cse34 v_arrayElimCell_119) .cse32 v_prenex_262))) (or (< v_prenex_259 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 v_prenex_259)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse34 v_arrayElimCell_119 .cse33) v_prenex_260) v_prenex_259)))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_119 Int)) (or (= v_arrayElimCell_119 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_244 Int) (v_prenex_245 Int) (v_prenex_263 Int) (v_prenex_246 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse35 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_246))) (store .cse35 v_arrayElimCell_119 (store (select .cse35 v_arrayElimCell_119) .cse32 v_prenex_244))) v_prenex_263) v_prenex_245)) (< v_prenex_245 0))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_prenex_242 Int) (v_prenex_240 Int) (v_prenex_243 (Array Int Int)) (v_prenex_241 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse36 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_243))) (store .cse36 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse36 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse32 v_prenex_240))) v_prenex_242) v_prenex_241)) (< v_prenex_241 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_arrayElimCell_119 Int)) (or (= v_arrayElimCell_119 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_248 Int) (v_prenex_247 Int) (v_prenex_249 (Array Int Int))) (or (< v_prenex_248 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_249) v_arrayElimCell_119) .cse32 v_prenex_247) v_prenex_248))))))))) .cse0) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_227 Int) (v_prenex_230 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse37 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_230))) (store .cse37 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse37 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse32 v_prenex_227))) v_prenex_229) v_prenex_228)) (< v_prenex_228 0))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_ArrVal_2196 Int) (v_prenex_255 Int) (v_prenex_256 Int) (v_prenex_257 (Array Int Int))) (let ((.cse39 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_257))) (let ((.cse38 (store (select .cse39 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse32 v_ArrVal_2196))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse38 v_prenex_255)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse39 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse38) v_prenex_256) v_prenex_255)) (< v_prenex_255 0))))))) (or .cse4 (forall ((v_prenex_258 Int) (v_prenex_233 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_234 (Array Int Int))) (let ((.cse40 (let ((.cse41 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_234))) (store .cse41 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse41 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse32 v_prenex_231))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_232 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_prenex_233) v_prenex_232)) (= (select (select .cse40 v_prenex_258) v_prenex_232) |c_ULTIMATE.start_main_~data~0#1|))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_239 (Array Int Int)) (v_prenex_237 Int) (v_prenex_238 Int) (v_prenex_235 Int) (v_prenex_236 Int)) (let ((.cse42 (let ((.cse43 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_239))) (store .cse43 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse43 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse32 v_prenex_235))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 v_prenex_238) v_prenex_236)) (< v_prenex_236 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 v_prenex_237) v_prenex_236)))))))) .cse1 .cse0) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int)) (let ((.cse44 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_prenex_285) v_prenex_284)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_284) (< v_prenex_284 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 |c_ULTIMATE.start_dll_create_~head~0#1.base|) v_prenex_284))))) .cse26) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_294 (Array Int Int)) (v_prenex_293 Int) (v_prenex_292 Int) (v_prenex_290 Int)) (let ((.cse45 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_294))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_292) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse45 v_prenex_293) v_prenex_292)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse45 v_prenex_290) v_prenex_292)) (< v_prenex_292 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_289 Int) (v_prenex_295 (Array Int Int)) (v_prenex_287 Int)) (or (< v_prenex_287 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_295) v_prenex_289) v_prenex_287)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_287))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_288 Int) (v_prenex_296 (Array Int Int)) (v_prenex_291 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_296) v_prenex_291) v_prenex_288)) (< v_prenex_288 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_288)))))) .cse0) (or .cse27 .cse26 (and (forall ((v_prenex_255 Int)) (or (forall ((v_prenex_256 Int) (v_arrayElimArr_19 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_19) v_prenex_256) v_prenex_255)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 v_prenex_255)))) (< v_prenex_255 0) (= .cse32 v_prenex_255))) (or (forall ((v_prenex_256 Int) (v_arrayElimArr_19 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_19) v_prenex_256) .cse32)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 .cse32)))) (< .cse32 0)) (forall ((v_prenex_255 Int)) (or (< v_prenex_255 0) (forall ((v_prenex_256 Int) (v_arrayElimArr_19 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_19) v_prenex_256) v_prenex_255)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 v_prenex_255)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 .cse32)))))) (forall ((v_arrayElimArr_18 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (or (< v_prenex_228 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_18) v_prenex_229) v_prenex_228)))))) (or .cse4 .cse1 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_266 Int) (v_prenex_264 Int) (v_prenex_272 Int) (v_prenex_269 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse47 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_269))) (let ((.cse46 (store (select .cse47 v_arrayElimCell_119) .cse32 v_prenex_272))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 v_prenex_264)) (< v_prenex_264 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse47 v_arrayElimCell_119 .cse46) v_prenex_266) v_prenex_264)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_119 Int)) (or (= v_arrayElimCell_119 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_277 Int) (v_prenex_275 Int) (v_prenex_274 Int) (v_prenex_268 (Array Int Int))) (or (< v_prenex_275 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse48 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_268))) (store .cse48 v_arrayElimCell_119 (store (select .cse48 v_arrayElimCell_119) .cse32 v_prenex_274))) v_prenex_277) v_prenex_275)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_279 Int) (v_prenex_276 Int) (v_prenex_265 (Array Int Int)) (v_prenex_283 Int) (v_prenex_281 Int) (v_arrayElimCell_119 Int)) (let ((.cse49 (let ((.cse50 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_265))) (store .cse50 v_arrayElimCell_119 (store (select .cse50 v_arrayElimCell_119) .cse32 v_prenex_283))))) (or (< v_prenex_279 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse49 v_prenex_281) v_prenex_279)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse49 v_prenex_276) v_prenex_279))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_278 Int) (v_prenex_282 Int) (v_prenex_267 (Array Int Int)) (v_prenex_280 Int)) (or (< v_prenex_282 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse51 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_267))) (store .cse51 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse51 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse32 v_prenex_280))) v_prenex_278) v_prenex_282)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_119 Int)) (or (= v_arrayElimCell_119 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_270 (Array Int Int)) (v_prenex_273 Int) (v_prenex_271 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_270) v_arrayElimCell_119) .cse32 v_prenex_273) v_prenex_271)) (< v_prenex_271 0)))))))) .cse0))) is different from false [2024-11-10 15:29:31,006 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse13 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse14 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (.cse5 (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse0 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_294 (Array Int Int)) (v_prenex_293 Int) (v_prenex_292 Int) (v_prenex_290 Int)) (let ((.cse1 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_294))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_292) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse1 v_prenex_293) v_prenex_292)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse1 v_prenex_290) v_prenex_292)) (< v_prenex_292 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_288 Int) (v_prenex_296 (Array Int Int)) (v_prenex_291 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_288) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_296) v_prenex_291) v_prenex_288)) (< v_prenex_288 0))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_289 Int) (v_prenex_295 (Array Int Int)) (v_prenex_287 Int)) (or (< v_prenex_287 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_287) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_295) v_prenex_289) v_prenex_287)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (or .cse0 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int) (v_arrayElimCell_119 Int)) (let ((.cse2 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 v_prenex_285) v_prenex_284)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_284) (< v_prenex_284 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 v_arrayElimCell_119) v_prenex_284)))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_25| Int) (v_arrayElimCell_111 Int) (v_ArrVal_2194 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_25| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_ArrVal_2194) v_arrayElimCell_111) |v_ULTIMATE.start_main_~ptr~0#1.offset_25|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_25|))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_224 Int) (v_prenex_225 Int) (v_prenex_226 (Array Int Int))) (or (< v_prenex_224 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_224) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_226) v_prenex_225) v_prenex_224)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_222 Int) (v_prenex_221 Int) (v_arrayElimCell_112 Int) (v_prenex_223 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_223))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_221) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse3 v_prenex_222) v_prenex_221)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse3 v_arrayElimCell_112) v_prenex_221)) (< v_prenex_221 0))))))) .cse4 .cse0) (or .cse5 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_248 Int) (v_prenex_247 Int) (v_prenex_249 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_249) v_arrayElimCell_119) .cse6 v_prenex_247) v_prenex_248)) (< v_prenex_248 0))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_253 Int) (v_prenex_251 Int) (v_prenex_254 (Array Int Int)) (v_prenex_252 Int) (v_prenex_250 Int) (v_arrayElimCell_119 Int)) (let ((.cse7 (let ((.cse8 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_254))) (store .cse8 v_arrayElimCell_119 (store (select .cse8 v_arrayElimCell_119) .cse6 v_prenex_250))))) (or (< v_prenex_251 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 v_prenex_252) v_prenex_251)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 v_prenex_253) v_prenex_251))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_242 Int) (v_prenex_240 Int) (v_prenex_243 (Array Int Int)) (v_prenex_241 Int)) (or (< v_prenex_241 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse9 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_243))) (store .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 v_prenex_240))) v_prenex_242) v_prenex_241)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_259 Int) (v_prenex_261 (Array Int Int)) (v_prenex_262 Int) (v_prenex_260 Int) (v_arrayElimCell_119 Int)) (let ((.cse10 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_261))) (let ((.cse11 (store (select .cse10 v_arrayElimCell_119) .cse6 v_prenex_262))) (or (< v_prenex_259 0) (= (select (select (store .cse10 v_arrayElimCell_119 .cse11) v_prenex_260) v_prenex_259) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 v_prenex_259)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_244 Int) (v_prenex_245 Int) (v_prenex_263 Int) (v_prenex_246 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse12 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_246))) (store .cse12 v_arrayElimCell_119 (store (select .cse12 v_arrayElimCell_119) .cse6 v_prenex_244))) v_prenex_263) v_prenex_245)) (< v_prenex_245 0)))))))) .cse0) (or .cse13 .cse14 (forall ((v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_299 (Array Int Int))) (or (< v_prenex_297 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_299) v_prenex_298) v_prenex_297)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_297)))) (or .cse0 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_300 Int) (v_prenex_301 (Array Int Int)) (v_arrayElimCell_119 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_300) (< v_prenex_300 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_301) v_arrayElimCell_119) v_prenex_300))))) (or .cse5 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_239 (Array Int Int)) (v_prenex_237 Int) (v_prenex_238 Int) (v_prenex_235 Int) (v_prenex_236 Int)) (let ((.cse15 (let ((.cse16 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_239))) (store .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 v_prenex_235))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_prenex_238) v_prenex_236)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_prenex_237) v_prenex_236)) (< v_prenex_236 0)))))) (or .cse4 (forall ((v_prenex_258 Int) (v_prenex_233 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_234 (Array Int Int))) (let ((.cse17 (let ((.cse18 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_234))) (store .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 v_prenex_231))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_232 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_prenex_258) v_prenex_232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_prenex_233) v_prenex_232)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_ArrVal_2196 Int) (v_prenex_255 Int) (v_prenex_256 Int) (v_prenex_257 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_257))) (let ((.cse20 (store (select .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 v_ArrVal_2196))) (or (< v_prenex_255 0) (= (select (select (store .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse20) v_prenex_256) v_prenex_255) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 v_prenex_255)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_227 Int) (v_prenex_230 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse21 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_230))) (store .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 v_prenex_227))) v_prenex_229) v_prenex_228)) (< v_prenex_228 0)))))) .cse0) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_299 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_297 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_297) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_299) v_prenex_298) v_prenex_297)))) .cse0) (or .cse13 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int)) (let ((.cse22 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 v_prenex_285) v_prenex_284)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select (select .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_284) |c_ULTIMATE.start_main_~data~0#1|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_284) (< v_prenex_284 0))))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_300 Int) (v_prenex_301 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_301) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_300)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_300) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (< v_prenex_300 0))) .cse13) (or .cse5 .cse4 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_266 Int) (v_prenex_264 Int) (v_prenex_272 Int) (v_prenex_269 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse23 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_269))) (let ((.cse24 (store (select .cse23 v_arrayElimCell_119) .cse6 v_prenex_272))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse23 v_arrayElimCell_119 .cse24) v_prenex_266) v_prenex_264)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 v_prenex_264)) (< v_prenex_264 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_270 (Array Int Int)) (v_prenex_273 Int) (v_prenex_271 Int)) (or (< v_prenex_271 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_270) v_arrayElimCell_119) .cse6 v_prenex_273) v_prenex_271)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_277 Int) (v_prenex_275 Int) (v_prenex_274 Int) (v_prenex_268 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse25 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_268))) (store .cse25 v_arrayElimCell_119 (store (select .cse25 v_arrayElimCell_119) .cse6 v_prenex_274))) v_prenex_277) v_prenex_275)) (< v_prenex_275 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_278 Int) (v_prenex_282 Int) (v_prenex_267 (Array Int Int)) (v_prenex_280 Int)) (or (< v_prenex_282 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse26 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_267))) (store .cse26 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 v_prenex_280))) v_prenex_278) v_prenex_282)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_279 Int) (v_prenex_276 Int) (v_prenex_265 (Array Int Int)) (v_prenex_283 Int) (v_prenex_281 Int) (v_arrayElimCell_119 Int)) (let ((.cse27 (let ((.cse28 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_265))) (store .cse28 v_arrayElimCell_119 (store (select .cse28 v_arrayElimCell_119) .cse6 v_prenex_283))))) (or (< v_prenex_279 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse27 v_prenex_276) v_prenex_279)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse27 v_prenex_281) v_prenex_279)))))))) .cse0) (or (and (forall ((v_arrayElimArr_18 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_18) v_prenex_229) v_prenex_228)) (< v_prenex_228 0))) (or (forall ((v_prenex_256 Int) (v_arrayElimArr_19 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_19) v_prenex_256) .cse6)))) (< .cse6 0)) (forall ((v_prenex_255 Int)) (or (forall ((v_prenex_256 Int) (v_arrayElimArr_19 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 v_prenex_255)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_19) v_prenex_256) v_prenex_255)))) (< v_prenex_255 0))) (forall ((v_prenex_255 Int)) (or (forall ((v_prenex_256 Int) (v_arrayElimArr_19 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 v_prenex_255)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_19) v_prenex_256) v_prenex_255)))) (< v_prenex_255 0) (= .cse6 v_prenex_255)))) .cse13 .cse14) (or .cse5 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_244 Int) (v_prenex_245 Int) (v_prenex_263 Int) (v_prenex_246 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse29 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_246))) (store .cse29 v_arrayElimCell_119 (store (select .cse29 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_244))) v_prenex_263) v_prenex_245)) (< v_prenex_245 0))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_227 Int) (v_arrayElimCell_121 Int) (v_prenex_230 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (or (< v_prenex_228 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse30 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_230))) (store .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_227))) v_prenex_229) v_prenex_228)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_259 Int) (v_prenex_261 (Array Int Int)) (v_arrayElimCell_121 Int) (v_prenex_262 Int) (v_prenex_260 Int) (v_arrayElimCell_119 Int)) (let ((.cse31 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_261))) (let ((.cse32 (store (select .cse31 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_262))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse31 v_arrayElimCell_119 .cse32) v_prenex_260) v_prenex_259)) (< v_prenex_259 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse32 v_prenex_259)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_prenex_253 Int) (v_arrayElimCell_121 Int) (v_prenex_251 Int) (v_prenex_254 (Array Int Int)) (v_prenex_252 Int) (v_prenex_250 Int) (v_arrayElimCell_119 Int)) (let ((.cse33 (let ((.cse34 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_254))) (store .cse34 v_arrayElimCell_119 (store (select .cse34 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_250))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse33 v_prenex_252) v_prenex_251)) (< v_prenex_251 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse33 v_prenex_253) v_prenex_251))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_300 Int) (v_prenex_301 (Array Int Int)) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (< v_prenex_300 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_301) v_arrayElimCell_119) v_prenex_300)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_299 (Array Int Int))) (or (< v_prenex_297 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_299) v_prenex_298) v_prenex_297)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_239 (Array Int Int)) (v_prenex_237 Int) (v_prenex_238 Int) (v_prenex_235 Int) (v_prenex_236 Int) (v_arrayElimCell_121 Int)) (let ((.cse35 (let ((.cse36 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_239))) (store .cse36 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse36 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_235))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse35 v_prenex_237) v_prenex_236)) (< v_prenex_236 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse35 v_prenex_238) v_prenex_236))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_242 Int) (v_arrayElimCell_121 Int) (v_prenex_240 Int) (v_prenex_243 (Array Int Int)) (v_prenex_241 Int)) (or (< v_prenex_241 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse37 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_243))) (store .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_240))) v_prenex_242) v_prenex_241)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_248 Int) (v_prenex_247 Int) (v_prenex_249 (Array Int Int))) (or (< v_prenex_248 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_249) v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_247) v_prenex_248)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (or .cse4 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_222 Int) (v_prenex_221 Int) (v_arrayElimCell_112 Int) (v_prenex_223 (Array Int Int))) (let ((.cse38 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_223))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse38 v_prenex_222) v_prenex_221)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse38 v_arrayElimCell_112) v_prenex_221)) (< v_prenex_221 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_25| Int) (v_arrayElimCell_111 Int) (v_ArrVal_2194 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_25| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_ArrVal_2194) v_arrayElimCell_111) |v_ULTIMATE.start_main_~ptr~0#1.offset_25|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_224 Int) (v_prenex_225 Int) (v_prenex_226 (Array Int Int))) (or (< v_prenex_224 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_226) v_prenex_225) v_prenex_224)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int) (v_arrayElimCell_119 Int)) (let ((.cse39 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 v_prenex_285) v_prenex_284)) (< v_prenex_284 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 v_arrayElimCell_119) v_prenex_284))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int)) (let ((.cse40 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_prenex_285) v_prenex_284)) (= (select (select .cse40 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_284) |c_ULTIMATE.start_main_~data~0#1|) (< v_prenex_284 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_289 Int) (v_prenex_295 (Array Int Int)) (v_prenex_287 Int)) (or (< v_prenex_287 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_295) v_prenex_289) v_prenex_287)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_294 (Array Int Int)) (v_prenex_293 Int) (v_prenex_292 Int) (v_prenex_290 Int)) (let ((.cse41 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_294))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse41 v_prenex_293) v_prenex_292)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse41 v_prenex_290) v_prenex_292)) (< v_prenex_292 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_288 Int) (v_prenex_296 (Array Int Int)) (v_prenex_291 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_296) v_prenex_291) v_prenex_288)) (< v_prenex_288 0))))) (or .cse4 (forall ((v_prenex_258 Int) (v_prenex_233 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_arrayElimCell_121 Int) (v_prenex_234 (Array Int Int))) (let ((.cse42 (let ((.cse43 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_234))) (store .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_231))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 v_prenex_233) v_prenex_232)) (< v_prenex_232 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 v_prenex_258) v_prenex_232)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_ArrVal_2196 Int) (v_prenex_255 Int) (v_prenex_256 Int) (v_arrayElimCell_121 Int) (v_prenex_257 (Array Int Int))) (let ((.cse44 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_257))) (let ((.cse45 (store (select .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_ArrVal_2196))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse45) v_prenex_256) v_prenex_255)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 v_prenex_255)) (< v_prenex_255 0))))))) (or .cse4 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_278 Int) (v_arrayElimCell_121 Int) (v_prenex_282 Int) (v_prenex_267 (Array Int Int)) (v_prenex_280 Int)) (or (< v_prenex_282 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse46 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_267))) (store .cse46 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse46 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_280))) v_prenex_278) v_prenex_282)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_279 Int) (v_arrayElimCell_121 Int) (v_prenex_276 Int) (v_prenex_265 (Array Int Int)) (v_prenex_283 Int) (v_prenex_281 Int) (v_arrayElimCell_119 Int)) (let ((.cse47 (let ((.cse48 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_265))) (store .cse48 v_arrayElimCell_119 (store (select .cse48 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_283))))) (or (< v_prenex_279 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_prenex_281) v_prenex_279)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_prenex_276) v_prenex_279))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_266 Int) (v_prenex_264 Int) (v_arrayElimCell_121 Int) (v_prenex_272 Int) (v_prenex_269 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse49 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_269))) (let ((.cse50 (store (select .cse49 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_272))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse49 v_arrayElimCell_119 .cse50) v_prenex_266) v_prenex_264)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 v_prenex_264)) (< v_prenex_264 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_270 (Array Int Int)) (v_prenex_273 Int) (v_prenex_271 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_270) v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_273) v_prenex_271)) (< v_prenex_271 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_277 Int) (v_prenex_275 Int) (v_prenex_274 Int) (v_prenex_268 (Array Int Int))) (or (< v_prenex_275 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse51 (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_268))) (store .cse51 v_arrayElimCell_119 (store (select .cse51 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_274))) v_prenex_277) v_prenex_275))))))))))) .cse0))) is different from false [2024-11-10 15:29:32,009 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse10 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse6 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (.cse7 (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse1 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1)) (.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0))) (and (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_289 Int) (v_prenex_295 (Array Int Int)) (v_prenex_287 Int)) (or (< v_prenex_287 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_295) v_prenex_289) v_prenex_287)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_287))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_288 Int) (v_prenex_296 (Array Int Int)) (v_prenex_291 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_288) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_296) v_prenex_291) v_prenex_288)) (< v_prenex_288 0))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_294 (Array Int Int)) (v_prenex_293 Int) (v_prenex_292 Int) (v_prenex_290 Int)) (let ((.cse0 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_294))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_292) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 v_prenex_293) v_prenex_292)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 v_prenex_290) v_prenex_292)) (< v_prenex_292 0))))))) .cse1) (or .cse2 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int) (v_ArrVal_2187 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_284) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse3 v_prenex_285) v_prenex_284)) (< v_prenex_284 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_284)))))) (or .cse1 (forall ((v_prenex_300 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int)) (v_prenex_301 (Array Int Int)) (v_arrayElimCell_119 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_300) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_301) v_arrayElimCell_119) v_prenex_300)) (< v_prenex_300 0)))) (or .cse4 .cse1 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_224 Int) (v_prenex_225 Int) (v_prenex_226 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_226) v_prenex_225) v_prenex_224)) (< v_prenex_224 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_224))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_222 Int) (v_prenex_221 Int) (v_arrayElimCell_112 Int) (v_prenex_223 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_223))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_221) (< v_prenex_221 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 v_arrayElimCell_112) v_prenex_221)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 v_prenex_222) v_prenex_221))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_25| Int) (v_arrayElimCell_111 Int) (v_ArrVal_2194 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_25| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_25|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_ArrVal_2194) v_arrayElimCell_111) |v_ULTIMATE.start_main_~ptr~0#1.offset_25|)))))))) (or .cse2 (forall ((v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_299 (Array Int Int)) (v_ArrVal_2187 (Array Int Int))) (or (< v_prenex_297 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_297) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_299) v_prenex_298) v_prenex_297)))) .cse6) (or .cse7 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_259 Int) (v_prenex_261 (Array Int Int)) (v_prenex_262 Int) (v_prenex_260 Int) (v_arrayElimCell_119 Int)) (let ((.cse9 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_261))) (let ((.cse8 (store (select .cse9 v_arrayElimCell_119) .cse10 v_prenex_262))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 v_prenex_259)) (< v_prenex_259 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse9 v_arrayElimCell_119 .cse8) v_prenex_260) v_prenex_259)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_253 Int) (v_prenex_251 Int) (v_prenex_254 (Array Int Int)) (v_prenex_252 Int) (v_prenex_250 Int) (v_arrayElimCell_119 Int)) (let ((.cse11 (let ((.cse12 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_254))) (store .cse12 v_arrayElimCell_119 (store (select .cse12 v_arrayElimCell_119) .cse10 v_prenex_250))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_prenex_253) v_prenex_251)) (< v_prenex_251 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_prenex_252) v_prenex_251))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_244 Int) (v_prenex_245 Int) (v_prenex_263 Int) (v_prenex_246 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse13 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_246))) (store .cse13 v_arrayElimCell_119 (store (select .cse13 v_arrayElimCell_119) .cse10 v_prenex_244))) v_prenex_263) v_prenex_245)) (< v_prenex_245 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_248 Int) (v_prenex_247 Int) (v_prenex_249 (Array Int Int))) (or (< v_prenex_248 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_249) v_arrayElimCell_119) .cse10 v_prenex_247) v_prenex_248)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_242 Int) (v_prenex_240 Int) (v_prenex_243 (Array Int Int)) (v_prenex_241 Int)) (or (< v_prenex_241 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse14 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_243))) (store .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_prenex_240))) v_prenex_242) v_prenex_241))))))) .cse1) (or .cse7 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_ArrVal_2196 Int) (v_prenex_255 Int) (v_prenex_256 Int) (v_prenex_257 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_257))) (let ((.cse16 (store (select .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_ArrVal_2196))) (or (< v_prenex_255 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse16) v_prenex_256) v_prenex_255)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 v_prenex_255)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_239 (Array Int Int)) (v_prenex_237 Int) (v_prenex_238 Int) (v_prenex_235 Int) (v_prenex_236 Int)) (let ((.cse17 (let ((.cse18 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_239))) (store .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_prenex_235))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_prenex_237) v_prenex_236)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_prenex_238) v_prenex_236)) (< v_prenex_236 0)))))) (or (forall ((v_prenex_258 Int) (v_prenex_233 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_ArrVal_2187 (Array Int Int)) (v_prenex_234 (Array Int Int))) (let ((.cse19 (let ((.cse20 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_234))) (store .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_prenex_231))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_232 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_prenex_258) v_prenex_232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_prenex_233) v_prenex_232))))) .cse4) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_227 Int) (v_prenex_230 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse21 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_230))) (store .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_prenex_227))) v_prenex_229) v_prenex_228)) (< v_prenex_228 0)))))) .cse1) (or .cse7 .cse4 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_277 Int) (v_prenex_275 Int) (v_prenex_274 Int) (v_prenex_268 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse22 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_268))) (store .cse22 v_arrayElimCell_119 (store (select .cse22 v_arrayElimCell_119) .cse10 v_prenex_274))) v_prenex_277) v_prenex_275)) (< v_prenex_275 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (forall ((v_prenex_279 Int) (v_prenex_276 Int) (v_prenex_265 (Array Int Int)) (v_prenex_283 Int) (v_prenex_281 Int) (v_arrayElimCell_119 Int)) (let ((.cse23 (let ((.cse24 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_265))) (store .cse24 v_arrayElimCell_119 (store (select .cse24 v_arrayElimCell_119) .cse10 v_prenex_283))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 v_prenex_281) v_prenex_279)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 v_prenex_276) v_prenex_279)) (< v_prenex_279 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_270 (Array Int Int)) (v_prenex_273 Int) (v_prenex_271 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_270) v_arrayElimCell_119) .cse10 v_prenex_273) v_prenex_271)) (< v_prenex_271 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_278 Int) (v_prenex_282 Int) (v_prenex_267 (Array Int Int)) (v_prenex_280 Int)) (or (< v_prenex_282 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse25 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_267))) (store .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_prenex_280))) v_prenex_278) v_prenex_282)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_266 Int) (v_prenex_264 Int) (v_prenex_272 Int) (v_prenex_269 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse27 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_269))) (let ((.cse26 (store (select .cse27 v_arrayElimCell_119) .cse10 v_prenex_272))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 v_prenex_264)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse27 v_arrayElimCell_119 .cse26) v_prenex_266) v_prenex_264)) (< v_prenex_264 0)))))))) .cse1) (or .cse2 (forall ((v_prenex_300 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int)) (v_prenex_301 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_300) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (< v_prenex_300 0) (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_301) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_300) |c_ULTIMATE.start_main_~data~0#1|)))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_299 (Array Int Int)) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_297 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_297) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_299) v_prenex_298) v_prenex_297)))) .cse1) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int) (v_ArrVal_2187 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse28 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse28 v_arrayElimCell_119) v_prenex_284)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_284) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse28 v_prenex_285) v_prenex_284)) (< v_prenex_284 0)))) .cse1) (or .cse2 (and (or (< .cse10 0) (forall ((v_prenex_256 Int) (v_arrayElimArr_19 (Array Int Int)) (v_ArrVal_2187 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_19) v_prenex_256) .cse10)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 .cse10))))) (forall ((v_prenex_255 Int) (v_ArrVal_2187 (Array Int Int))) (or (< v_prenex_255 0) (forall ((v_prenex_256 Int) (v_arrayElimArr_19 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 v_prenex_255)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 .cse10)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_19) v_prenex_256) v_prenex_255)))))) (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_2187 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_18) v_prenex_229) v_prenex_228)) (< v_prenex_228 0))) (forall ((v_prenex_255 Int) (v_ArrVal_2187 (Array Int Int))) (or (< v_prenex_255 0) (= .cse10 v_prenex_255) (forall ((v_prenex_256 Int) (v_arrayElimArr_19 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 v_prenex_255)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_19) v_prenex_256) v_prenex_255))))))) .cse6) (or .cse7 .cse1 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_248 Int) (v_prenex_247 Int) (v_prenex_249 (Array Int Int))) (or (< v_prenex_248 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_249) v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_247) v_prenex_248)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_244 Int) (v_prenex_245 Int) (v_prenex_263 Int) (v_prenex_246 (Array Int Int))) (or (< v_prenex_245 0) (= (select (select (let ((.cse29 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_246))) (store .cse29 v_arrayElimCell_119 (store (select .cse29 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_244))) v_prenex_263) v_prenex_245) |c_ULTIMATE.start_main_~data~0#1|))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_289 Int) (v_prenex_295 (Array Int Int)) (v_prenex_287 Int)) (or (< v_prenex_287 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_295) v_prenex_289) v_prenex_287)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_288 Int) (v_prenex_296 (Array Int Int)) (v_prenex_291 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_296) v_prenex_291) v_prenex_288)) (< v_prenex_288 0))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_294 (Array Int Int)) (v_prenex_293 Int) (v_prenex_292 Int) (v_prenex_290 Int)) (let ((.cse30 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_294))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 v_prenex_293) v_prenex_292)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 v_prenex_290) v_prenex_292)) (< v_prenex_292 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_299 (Array Int Int))) (or (< v_prenex_297 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_299) v_prenex_298) v_prenex_297)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_259 Int) (v_prenex_261 (Array Int Int)) (v_arrayElimCell_121 Int) (v_prenex_262 Int) (v_prenex_260 Int) (v_arrayElimCell_119 Int)) (let ((.cse32 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_261))) (let ((.cse31 (store (select .cse32 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_262))) (or (< v_prenex_259 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 v_prenex_259)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse32 v_arrayElimCell_119 .cse31) v_prenex_260) v_prenex_259)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int)) (let ((.cse33 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse33 v_prenex_285) v_prenex_284)) (< v_prenex_284 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_284))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_239 (Array Int Int)) (v_prenex_237 Int) (v_prenex_238 Int) (v_prenex_235 Int) (v_prenex_236 Int) (v_arrayElimCell_121 Int)) (let ((.cse34 (let ((.cse35 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_239))) (store .cse35 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse35 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_235))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse34 v_prenex_238) v_prenex_236)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse34 v_prenex_237) v_prenex_236)) (< v_prenex_236 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_242 Int) (v_arrayElimCell_121 Int) (v_prenex_240 Int) (v_prenex_243 (Array Int Int)) (v_prenex_241 Int)) (or (< v_prenex_241 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse36 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_243))) (store .cse36 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse36 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_240))) v_prenex_242) v_prenex_241)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_227 Int) (v_arrayElimCell_121 Int) (v_prenex_230 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse37 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_230))) (store .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_227))) v_prenex_229) v_prenex_228)) (< v_prenex_228 0))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_300 Int) (v_prenex_301 (Array Int Int)) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_301) v_arrayElimCell_119) v_prenex_300)) (< v_prenex_300 0))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_ArrVal_2196 Int) (v_prenex_255 Int) (v_prenex_256 Int) (v_arrayElimCell_121 Int) (v_prenex_257 (Array Int Int))) (let ((.cse38 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_257))) (let ((.cse39 (store (select .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_ArrVal_2196))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse39) v_prenex_256) v_prenex_255)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse39 v_prenex_255)) (< v_prenex_255 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int) (v_arrayElimCell_119 Int)) (let ((.cse40 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_arrayElimCell_119) v_prenex_284)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_prenex_285) v_prenex_284)) (< v_prenex_284 0)))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_222 Int) (v_prenex_221 Int) (v_arrayElimCell_112 Int) (v_prenex_223 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_223))) (or (< v_prenex_221 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse41 v_arrayElimCell_112) v_prenex_221)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse41 v_prenex_222) v_prenex_221))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_224 Int) (v_prenex_225 Int) (v_prenex_226 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_226) v_prenex_225) v_prenex_224)) (< v_prenex_224 0))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_25| Int) (v_arrayElimCell_111 Int) (v_ArrVal_2194 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_25| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_ArrVal_2194) v_arrayElimCell_111) |v_ULTIMATE.start_main_~ptr~0#1.offset_25|))))))) .cse4) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_253 Int) (v_arrayElimCell_121 Int) (v_prenex_251 Int) (v_prenex_254 (Array Int Int)) (v_prenex_252 Int) (v_prenex_250 Int) (v_arrayElimCell_119 Int)) (let ((.cse42 (let ((.cse43 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_254))) (store .cse43 v_arrayElimCell_119 (store (select .cse43 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_250))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 v_prenex_252) v_prenex_251)) (< v_prenex_251 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 v_prenex_253) v_prenex_251))))))) (or (forall ((v_prenex_258 Int) (v_prenex_233 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_231 Int) (v_arrayElimCell_121 Int) (v_prenex_232 Int) (v_ArrVal_2187 (Array Int Int)) (v_prenex_234 (Array Int Int))) (let ((.cse44 (let ((.cse45 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_234))) (store .cse45 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse45 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_231))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_232 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_prenex_258) v_prenex_232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 v_prenex_233) v_prenex_232))))) .cse4) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_270 (Array Int Int)) (v_prenex_273 Int) (v_prenex_271 Int)) (or (< v_prenex_271 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_270) v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_273) v_prenex_271)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (forall ((v_prenex_277 Int) (v_prenex_275 Int) (v_prenex_274 Int) (v_prenex_268 (Array Int Int))) (or (< v_prenex_275 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse46 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_268))) (store .cse46 v_arrayElimCell_119 (store (select .cse46 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_274))) v_prenex_277) v_prenex_275)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_278 Int) (v_arrayElimCell_121 Int) (v_prenex_282 Int) (v_prenex_267 (Array Int Int)) (v_prenex_280 Int)) (or (< v_prenex_282 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse47 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_267))) (store .cse47 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse47 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_280))) v_prenex_278) v_prenex_282)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_279 Int) (v_arrayElimCell_121 Int) (v_prenex_276 Int) (v_prenex_265 (Array Int Int)) (v_prenex_283 Int) (v_prenex_281 Int) (v_arrayElimCell_119 Int)) (let ((.cse48 (let ((.cse49 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_265))) (store .cse49 v_arrayElimCell_119 (store (select .cse49 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_283))))) (or (< v_prenex_279 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse48 v_prenex_281) v_prenex_279)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse48 v_prenex_276) v_prenex_279))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_266 Int) (v_prenex_264 Int) (v_arrayElimCell_121 Int) (v_prenex_272 Int) (v_prenex_269 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse51 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_269))) (let ((.cse50 (store (select .cse51 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_272))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 v_prenex_264)) (< v_prenex_264 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse51 v_arrayElimCell_119 .cse50) v_prenex_266) v_prenex_264))))))))) .cse4))))) is different from false [2024-11-10 15:29:34,381 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse9 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse0 (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0)) (.cse3 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse7 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1))) (and (or .cse0 (and (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_ArrVal_2196 Int) (v_prenex_255 Int) (v_prenex_256 Int) (v_prenex_257 (Array Int Int))) (let ((.cse1 (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_257) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_2196))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_257) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) v_prenex_256) v_prenex_255)) (< v_prenex_255 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 v_prenex_255))))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_227 Int) (v_prenex_230 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_230) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_230) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_prenex_227)) v_prenex_229) v_prenex_228)) (< v_prenex_228 0))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (or .cse4 (forall ((v_prenex_258 Int) (v_prenex_233 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_ArrVal_2187 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_ArrVal_2186 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_234) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_234) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_prenex_231)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_232 0) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 v_prenex_233) v_prenex_232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 v_prenex_258) v_prenex_232)))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_239 (Array Int Int)) (v_prenex_237 Int) (v_prenex_238 Int) (v_prenex_235 Int) (v_prenex_236 Int)) (let ((.cse6 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_239) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_239) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_prenex_235)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 v_prenex_238) v_prenex_236)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 v_prenex_237) v_prenex_236)) (< v_prenex_236 0)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)))))) .cse7) (or .cse7 (forall ((v_prenex_300 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int)) (v_ArrVal_2186 (Array Int Int)) (v_prenex_301 (Array Int Int)) (v_arrayElimCell_119 Int)) (or (= (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_301) v_arrayElimCell_119) v_prenex_300) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_300) (< v_prenex_300 0) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186))))) (or .cse8 (forall ((v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_299 (Array Int Int)) (v_ArrVal_2187 (Array Int Int))) (or (< v_prenex_297 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_297) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_299) v_prenex_298) v_prenex_297)))) .cse9) (or .cse0 .cse4 (and (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (forall ((v_prenex_278 Int) (v_prenex_282 Int) (v_prenex_267 (Array Int Int)) (v_prenex_280 Int)) (or (< v_prenex_282 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_267) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_267) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_prenex_280)) v_prenex_278) v_prenex_282)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_277 Int) (v_prenex_275 Int) (v_prenex_274 Int) (v_prenex_268 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse10 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_268))) (store .cse10 v_arrayElimCell_119 (store (select .cse10 v_arrayElimCell_119) .cse2 v_prenex_274))) v_prenex_277) v_prenex_275)) (< v_prenex_275 0))))))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_270 (Array Int Int)) (v_prenex_273 Int) (v_prenex_271 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_270) v_arrayElimCell_119) .cse2 v_prenex_273) v_prenex_271)) (< v_prenex_271 0))))))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_279 Int) (v_prenex_276 Int) (v_prenex_265 (Array Int Int)) (v_prenex_283 Int) (v_prenex_281 Int) (v_arrayElimCell_119 Int)) (let ((.cse11 (let ((.cse12 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_265))) (store .cse12 v_arrayElimCell_119 (store (select .cse12 v_arrayElimCell_119) .cse2 v_prenex_283))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_prenex_281) v_prenex_279)) (< v_prenex_279 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_prenex_276) v_prenex_279))))))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_266 Int) (v_prenex_264 Int) (v_prenex_272 Int) (v_prenex_269 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse14 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_269))) (let ((.cse13 (store (select .cse14 v_arrayElimCell_119) .cse2 v_prenex_272))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 v_prenex_264)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 v_arrayElimCell_119 .cse13) v_prenex_266) v_prenex_264)) (< v_prenex_264 0)))))))))) .cse7) (or (forall ((v_prenex_300 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int)) (v_ArrVal_2186 (Array Int Int)) (v_prenex_301 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_300) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_301) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_300)) (< v_prenex_300 0) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) .cse8) (or (and (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_289 Int) (v_prenex_295 (Array Int Int)) (v_prenex_287 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_295) v_prenex_289) v_prenex_287)) (< v_prenex_287 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_287))))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_288 Int) (v_prenex_296 (Array Int Int)) (v_prenex_291 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_288) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_296) v_prenex_291) v_prenex_288)) (< v_prenex_288 0))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_294 (Array Int Int)) (v_prenex_293 Int) (v_prenex_292 Int) (v_prenex_290 Int)) (let ((.cse15 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_294))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_prenex_293) v_prenex_292)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_292) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_prenex_290) v_prenex_292)) (< v_prenex_292 0))))))))) .cse7) (or .cse4 .cse7 (and (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (forall ((v_prenex_222 Int) (v_prenex_221 Int) (v_arrayElimCell_112 Int) (v_prenex_223 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_223))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_221) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_prenex_222) v_prenex_221)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_112) v_prenex_221)) (< v_prenex_221 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_224 Int) (v_prenex_225 Int) (v_prenex_226 (Array Int Int))) (or (< v_prenex_224 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_226) v_prenex_225) v_prenex_224)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_224))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_25| Int) (v_arrayElimCell_111 Int) (v_ArrVal_2194 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_25| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_25|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_ArrVal_2194) v_arrayElimCell_111) |v_ULTIMATE.start_main_~ptr~0#1.offset_25|)))))))))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_299 (Array Int Int)) (v_ArrVal_2187 (Array Int Int)) (v_ArrVal_2186 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_299) v_prenex_298) v_prenex_297)) (< v_prenex_297 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_297) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) .cse7) (or .cse8 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int) (v_ArrVal_2187 (Array Int Int)) (v_ArrVal_2186 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_284) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (< v_prenex_284 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_prenex_285) v_prenex_284)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_284)))))) (or .cse8 (and (or (< .cse2 0) (forall ((v_prenex_256 Int) (v_arrayElimArr_19 (Array Int Int)) (v_ArrVal_2187 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_19) v_prenex_256) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 .cse2))))) (forall ((v_prenex_255 Int) (v_ArrVal_2187 (Array Int Int))) (or (< v_prenex_255 0) (forall ((v_prenex_256 Int) (v_arrayElimArr_19 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 v_prenex_255)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_19) v_prenex_256) v_prenex_255)))))) (forall ((v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_2187 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_18) v_prenex_229) v_prenex_228)) (< v_prenex_228 0))) (forall ((v_prenex_255 Int) (v_ArrVal_2187 (Array Int Int))) (or (< v_prenex_255 0) (= .cse2 v_prenex_255) (forall ((v_prenex_256 Int) (v_arrayElimArr_19 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_arrayElimArr_19 v_prenex_255)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_19) v_prenex_256) v_prenex_255))))))) .cse9) (or .cse0 (and (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_253 Int) (v_arrayElimCell_121 Int) (v_prenex_251 Int) (v_prenex_254 (Array Int Int)) (v_prenex_252 Int) (v_prenex_250 Int) (v_arrayElimCell_119 Int)) (let ((.cse18 (let ((.cse19 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_254))) (store .cse19 v_arrayElimCell_119 (store (select .cse19 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_250))))) (or (< v_prenex_251 0) (= (select (select .cse18 v_prenex_253) v_prenex_251) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_prenex_252) v_prenex_251))))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_244 Int) (v_prenex_245 Int) (v_prenex_263 Int) (v_prenex_246 (Array Int Int))) (or (< v_prenex_245 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse20 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_246))) (store .cse20 v_arrayElimCell_119 (store (select .cse20 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_244))) v_prenex_263) v_prenex_245)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_288 Int) (v_prenex_296 (Array Int Int)) (v_prenex_291 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_296) v_prenex_291) v_prenex_288)) (< v_prenex_288 0))))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_299 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_299) v_prenex_298) v_prenex_297)) (< v_prenex_297 0))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_239 (Array Int Int)) (v_prenex_237 Int) (v_prenex_238 Int) (v_prenex_235 Int) (v_prenex_236 Int) (v_arrayElimCell_121 Int)) (let ((.cse21 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_239) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_239) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_235)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 v_prenex_238) v_prenex_236)) (< v_prenex_236 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 v_prenex_237) v_prenex_236))))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_ArrVal_2196 Int) (v_prenex_255 Int) (v_prenex_256 Int) (v_arrayElimCell_121 Int) (v_prenex_257 (Array Int Int))) (let ((.cse22 (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_257) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_ArrVal_2196))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_257) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse22) v_prenex_256) v_prenex_255)) (< v_prenex_255 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 v_prenex_255))))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_259 Int) (v_prenex_261 (Array Int Int)) (v_arrayElimCell_121 Int) (v_prenex_262 Int) (v_prenex_260 Int) (v_arrayElimCell_119 Int)) (let ((.cse24 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_261))) (let ((.cse23 (store (select .cse24 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_262))) (or (< v_prenex_259 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_prenex_259)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse24 v_arrayElimCell_119 .cse23) v_prenex_260) v_prenex_259)))))))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_227 Int) (v_arrayElimCell_121 Int) (v_prenex_230 (Array Int Int)) (v_prenex_228 Int) (v_prenex_229 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_230) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_230) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_227)) v_prenex_229) v_prenex_228)) (< v_prenex_228 0))))))) (or .cse4 (forall ((v_prenex_258 Int) (v_prenex_233 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_231 Int) (v_arrayElimCell_121 Int) (v_prenex_232 Int) (v_ArrVal_2187 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_ArrVal_2186 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_234) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_234) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_231)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_232 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse25 v_prenex_233) v_prenex_232)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse25 v_prenex_258) v_prenex_232)) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_289 Int) (v_prenex_295 (Array Int Int)) (v_prenex_287 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_295) v_prenex_289) v_prenex_287)) (< v_prenex_287 0))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_248 Int) (v_prenex_247 Int) (v_prenex_249 (Array Int Int))) (or (< v_prenex_248 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_249) v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_247) v_prenex_248)))))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int) (v_arrayElimCell_119 Int)) (let ((.cse26 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (< v_prenex_284 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 v_prenex_285) v_prenex_284)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 v_arrayElimCell_119) v_prenex_284))))))))) (or (and (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_25| Int) (v_arrayElimCell_111 Int) (v_ArrVal_2194 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_25| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_ArrVal_2194) v_arrayElimCell_111) |v_ULTIMATE.start_main_~ptr~0#1.offset_25|)))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_224 Int) (v_prenex_225 Int) (v_prenex_226 (Array Int Int))) (or (< v_prenex_224 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_226) v_prenex_225) v_prenex_224)))))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_222 Int) (v_prenex_221 Int) (v_arrayElimCell_112 Int) (v_prenex_223 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_223))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse27 v_prenex_222) v_prenex_221)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse27 v_arrayElimCell_112) v_prenex_221)) (< v_prenex_221 0)))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186))))) .cse4) (or .cse4 (and (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_266 Int) (v_prenex_264 Int) (v_arrayElimCell_121 Int) (v_prenex_272 Int) (v_prenex_269 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse29 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_269))) (let ((.cse28 (store (select .cse29 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_272))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 v_prenex_264)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse29 v_arrayElimCell_119 .cse28) v_prenex_266) v_prenex_264)) (< v_prenex_264 0))))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_277 Int) (v_prenex_275 Int) (v_prenex_274 Int) (v_prenex_268 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse30 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_268))) (store .cse30 v_arrayElimCell_119 (store (select .cse30 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_274))) v_prenex_277) v_prenex_275)) (< v_prenex_275 0))))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (forall ((v_prenex_278 Int) (v_arrayElimCell_121 Int) (v_prenex_282 Int) (v_prenex_267 (Array Int Int)) (v_prenex_280 Int)) (or (< v_prenex_282 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_267) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_267) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_280)) v_prenex_278) v_prenex_282)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (forall ((v_prenex_279 Int) (v_arrayElimCell_121 Int) (v_prenex_276 Int) (v_prenex_265 (Array Int Int)) (v_prenex_283 Int) (v_prenex_281 Int) (v_arrayElimCell_119 Int)) (let ((.cse31 (let ((.cse32 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_265))) (store .cse32 v_arrayElimCell_119 (store (select .cse32 v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_283))))) (or (< v_prenex_279 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse31 v_prenex_276) v_prenex_279)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse31 v_prenex_281) v_prenex_279))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_270 (Array Int Int)) (v_prenex_273 Int) (v_prenex_271 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_270) v_arrayElimCell_119) (+ v_arrayElimCell_121 8) v_prenex_273) v_prenex_271)) (< v_prenex_271 0))))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_242 Int) (v_arrayElimCell_121 Int) (v_prenex_240 Int) (v_prenex_243 (Array Int Int)) (v_prenex_241 Int)) (or (< v_prenex_241 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_243) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_243) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_121 8) v_prenex_240)) v_prenex_242) v_prenex_241)))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int)) (let ((.cse33 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (< v_prenex_284 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse33 v_prenex_285) v_prenex_284)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_284))))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_294 (Array Int Int)) (v_prenex_293 Int) (v_prenex_292 Int) (v_prenex_290 Int)) (let ((.cse34 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_294))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse34 v_prenex_293) v_prenex_292)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse34 v_prenex_290) v_prenex_292)) (< v_prenex_292 0)))))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_300 Int) (v_prenex_301 (Array Int Int)) (v_arrayElimCell_119 Int)) (or (= (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_301) v_arrayElimCell_119) v_prenex_300) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (< v_prenex_300 0))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186))))) .cse7) (or .cse0 (and (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimCell_119 Int)) (or (forall ((v_prenex_248 Int) (v_prenex_247 Int) (v_prenex_249 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_249) v_arrayElimCell_119) .cse2 v_prenex_247) v_prenex_248)) (< v_prenex_248 0))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119))))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_242 Int) (v_prenex_240 Int) (v_prenex_243 (Array Int Int)) (v_prenex_241 Int)) (or (< v_prenex_241 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_243) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_243) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_prenex_240)) v_prenex_242) v_prenex_241)))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_259 Int) (v_prenex_261 (Array Int Int)) (v_prenex_262 Int) (v_prenex_260 Int) (v_arrayElimCell_119 Int)) (let ((.cse36 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_261))) (let ((.cse35 (store (select .cse36 v_arrayElimCell_119) .cse2 v_prenex_262))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 v_prenex_259)) (< v_prenex_259 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse36 v_arrayElimCell_119 .cse35) v_prenex_260) v_prenex_259)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_253 Int) (v_prenex_251 Int) (v_prenex_254 (Array Int Int)) (v_prenex_252 Int) (v_prenex_250 Int) (v_arrayElimCell_119 Int)) (let ((.cse37 (let ((.cse38 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_254))) (store .cse38 v_arrayElimCell_119 (store (select .cse38 v_arrayElimCell_119) .cse2 v_prenex_250))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 v_prenex_252) v_prenex_251)) (< v_prenex_251 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse37 v_prenex_253) v_prenex_251))))))) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)))) (forall ((v_ArrVal_2186 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_ArrVal_2187 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_119) (forall ((v_prenex_244 Int) (v_prenex_245 Int) (v_prenex_263 Int) (v_prenex_246 (Array Int Int))) (or (= (select (select (let ((.cse39 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_246))) (store .cse39 v_arrayElimCell_119 (store (select .cse39 v_arrayElimCell_119) .cse2 v_prenex_244))) v_prenex_263) v_prenex_245) |c_ULTIMATE.start_main_~data~0#1|) (< v_prenex_245 0)))))))))) .cse7) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_286 (Array Int Int)) (v_prenex_284 Int) (v_prenex_285 Int) (v_ArrVal_2187 (Array Int Int)) (v_ArrVal_2186 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse40 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2186) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_prenex_286))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_284) (not (= (store .cse3 .cse2 (select v_ArrVal_2186 .cse2)) v_ArrVal_2186)) (< v_prenex_284 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_prenex_285) v_prenex_284)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_arrayElimCell_119) v_prenex_284))))) .cse7))) is different from false