./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd --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 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:53:04,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:53:04,350 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 15:53:04,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:53:04,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:53:04,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:53:04,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:53:04,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:53:04,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:53:04,385 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:53:04,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:53:04,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:53:04,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:53:04,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:53:04,386 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:53:04,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:53:04,387 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:53:04,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:53:04,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:53:04,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:53:04,387 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 15:53:04,387 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 15:53:04,388 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 15:53:04,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:53:04,388 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:53:04,388 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:53:04,388 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:53:04,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:53:04,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:53:04,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:53:04,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:53:04,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:53:04,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:53:04,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:53:04,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:53:04,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:53:04,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:53:04,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:53:04,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:53:04,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:53:04,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:53:04,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:53:04,390 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd 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 -> 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 [2024-11-13 15:53:04,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:53:04,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:53:04,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:53:04,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:53:04,767 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:53:04,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/memsafety/test-0232-3.i Unable to find full path for "g++" [2024-11-13 15:53:06,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:53:06,993 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:53:06,998 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/sv-benchmarks/c/memsafety/test-0232-3.i [2024-11-13 15:53:07,013 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/data/0458d2fe3/ad010e92d5a84c0c91e4d59a895fba40/FLAG6d160a7a1 [2024-11-13 15:53:07,033 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/data/0458d2fe3/ad010e92d5a84c0c91e4d59a895fba40 [2024-11-13 15:53:07,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:53:07,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:53:07,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:53:07,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:53:07,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:53:07,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f6b08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07, skipping insertion in model container [2024-11-13 15:53:07,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:53:07,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:53:07,494 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:53:07,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:53:07,565 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:53:07,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07 WrapperNode [2024-11-13 15:53:07,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:53:07,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:53:07,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:53:07,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:53:07,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,601 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2024-11-13 15:53:07,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:53:07,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:53:07,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:53:07,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:53:07,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,633 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 13, 9]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 3, 2]. [2024-11-13 15:53:07,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:53:07,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:53:07,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:53:07,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:53:07,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07" (1/1) ... [2024-11-13 15:53:07,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:53:07,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:53:07,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:53:07,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:53:07,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:53:07,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:53:07,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 15:53:07,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 15:53:07,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 15:53:07,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 15:53:07,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 15:53:07,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 15:53:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 15:53:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:53:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 15:53:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 15:53:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 15:53:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:53:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:53:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 15:53:07,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:53:07,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:53:07,866 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:53:07,868 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:53:08,383 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-13 15:53:08,384 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:53:08,402 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:53:08,403 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 15:53:08,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:53:08 BoogieIcfgContainer [2024-11-13 15:53:08,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:53:08,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:53:08,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:53:08,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:53:08,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:53:07" (1/3) ... [2024-11-13 15:53:08,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0c10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:53:08, skipping insertion in model container [2024-11-13 15:53:08,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:53:07" (2/3) ... [2024-11-13 15:53:08,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0c10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:53:08, skipping insertion in model container [2024-11-13 15:53:08,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:53:08" (3/3) ... [2024-11-13 15:53:08,417 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232-3.i [2024-11-13 15:53:08,433 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:53:08,435 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0232-3.i that has 1 procedures, 108 locations, 1 initial locations, 2 loop locations, and 55 error locations. [2024-11-13 15:53:08,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:53:08,494 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;@7d1ccea1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:53:08,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-13 15:53:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 52 states have (on average 2.1923076923076925) internal successors, (114), 107 states have internal predecessors, (114), 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-13 15:53:08,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 15:53:08,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:08,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 15:53:08,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:08,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:08,508 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2024-11-13 15:53:08,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:08,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216567943] [2024-11-13 15:53:08,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:08,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:08,830 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-13 15:53:08,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:08,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216567943] [2024-11-13 15:53:08,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216567943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:08,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:08,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:53:08,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633530615] [2024-11-13 15:53:08,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:08,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:53:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:08,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:53:08,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:53:08,868 INFO L87 Difference]: Start difference. First operand has 108 states, 52 states have (on average 2.1923076923076925) internal successors, (114), 107 states have internal predecessors, (114), 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) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-13 15:53:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:09,170 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-11-13 15:53:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:53:09,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2024-11-13 15:53:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:09,181 INFO L225 Difference]: With dead ends: 101 [2024-11-13 15:53:09,181 INFO L226 Difference]: Without dead ends: 99 [2024-11-13 15:53:09,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-13 15:53:09,187 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 95 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:09,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 94 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:53:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-13 15:53:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-13 15:53:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 52 states have (on average 2.0) 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-13 15:53:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2024-11-13 15:53:09,232 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 4 [2024-11-13 15:53:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:09,232 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2024-11-13 15:53:09,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-13 15:53:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2024-11-13 15:53:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 15:53:09,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:09,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 15:53:09,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:53:09,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:09,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:09,235 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2024-11-13 15:53:09,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:09,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469541284] [2024-11-13 15:53:09,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:09,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:09,475 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-13 15:53:09,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:09,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469541284] [2024-11-13 15:53:09,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469541284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:09,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:09,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:53:09,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987430259] [2024-11-13 15:53:09,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:09,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:53:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:09,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:53:09,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:53:09,478 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-13 15:53:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:09,701 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2024-11-13 15:53:09,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:53:09,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2024-11-13 15:53:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:09,703 INFO L225 Difference]: With dead ends: 120 [2024-11-13 15:53:09,703 INFO L226 Difference]: Without dead ends: 120 [2024-11-13 15:53:09,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-13 15:53:09,704 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 86 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:09,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 106 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:53:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-13 15:53:09,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2024-11-13 15:53:09,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.85) internal successors, (111), 101 states have internal predecessors, (111), 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-13 15:53:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2024-11-13 15:53:09,718 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 4 [2024-11-13 15:53:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:09,718 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2024-11-13 15:53:09,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-13 15:53:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2024-11-13 15:53:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 15:53:09,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:09,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 15:53:09,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:53:09,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:09,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:09,720 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2024-11-13 15:53:09,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:09,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624035503] [2024-11-13 15:53:09,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:09,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:09,809 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-13 15:53:09,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:09,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624035503] [2024-11-13 15:53:09,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624035503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:09,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:09,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:53:09,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660779933] [2024-11-13 15:53:09,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:09,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:53:09,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:09,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:53:09,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:53:09,814 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 15:53:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:09,933 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2024-11-13 15:53:09,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:53:09,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-13 15:53:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:09,937 INFO L225 Difference]: With dead ends: 98 [2024-11-13 15:53:09,937 INFO L226 Difference]: Without dead ends: 98 [2024-11-13 15:53:09,937 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-13 15:53:09,938 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 11 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:09,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 119 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:53:09,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-13 15:53:09,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-13 15:53:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.7833333333333334) internal successors, (107), 97 states have internal predecessors, (107), 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-13 15:53:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2024-11-13 15:53:09,944 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 5 [2024-11-13 15:53:09,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:09,945 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2024-11-13 15:53:09,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 15:53:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-11-13 15:53:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 15:53:09,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:09,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 15:53:09,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:53:09,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:09,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:09,948 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2024-11-13 15:53:09,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:09,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840915710] [2024-11-13 15:53:09,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:09,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:10,095 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-13 15:53:10,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:10,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840915710] [2024-11-13 15:53:10,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840915710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:10,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:10,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:53:10,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389877961] [2024-11-13 15:53:10,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:10,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:53:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:10,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:53:10,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:53:10,097 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 15:53:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:10,184 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2024-11-13 15:53:10,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:53:10,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-13 15:53:10,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:10,185 INFO L225 Difference]: With dead ends: 94 [2024-11-13 15:53:10,186 INFO L226 Difference]: Without dead ends: 94 [2024-11-13 15:53:10,186 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-13 15:53:10,187 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:10,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 126 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:53:10,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-13 15:53:10,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-13 15:53:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 93 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-13 15:53:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2024-11-13 15:53:10,201 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 5 [2024-11-13 15:53:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:10,201 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2024-11-13 15:53:10,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 15:53:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2024-11-13 15:53:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 15:53:10,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:10,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:10,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:53:10,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:10,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2024-11-13 15:53:10,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:10,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219846687] [2024-11-13 15:53:10,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:10,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:10,610 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-13 15:53:10,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:10,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219846687] [2024-11-13 15:53:10,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219846687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:10,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:10,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:53:10,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752015222] [2024-11-13 15:53:10,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:10,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:53:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:10,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:53:10,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:53:10,612 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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-13 15:53:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:10,842 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2024-11-13 15:53:10,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:53:10,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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-13 15:53:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:10,843 INFO L225 Difference]: With dead ends: 103 [2024-11-13 15:53:10,844 INFO L226 Difference]: Without dead ends: 103 [2024-11-13 15:53:10,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:53:10,845 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 18 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:10,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 454 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:53:10,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-13 15:53:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2024-11-13 15:53:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 99 states have internal predecessors, (109), 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-13 15:53:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-13 15:53:10,851 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 10 [2024-11-13 15:53:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:10,852 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-13 15:53:10,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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-13 15:53:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-13 15:53:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 15:53:10,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:10,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:10,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:53:10,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:10,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1869096854, now seen corresponding path program 1 times [2024-11-13 15:53:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:10,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826175036] [2024-11-13 15:53:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:11,135 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-13 15:53:11,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:11,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826175036] [2024-11-13 15:53:11,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826175036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:11,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:11,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:53:11,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608206328] [2024-11-13 15:53:11,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:11,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:53:11,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:11,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:53:11,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:53:11,138 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-13 15:53:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:11,381 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2024-11-13 15:53:11,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:53:11,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 17 [2024-11-13 15:53:11,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:11,386 INFO L225 Difference]: With dead ends: 120 [2024-11-13 15:53:11,387 INFO L226 Difference]: Without dead ends: 120 [2024-11-13 15:53:11,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:53:11,388 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 68 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:11,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 162 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:53:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-13 15:53:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 99. [2024-11-13 15:53:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 98 states have internal predecessors, (108), 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-13 15:53:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-13 15:53:11,402 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 17 [2024-11-13 15:53:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:11,402 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-13 15:53:11,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-13 15:53:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-13 15:53:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 15:53:11,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:11,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:11,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:53:11,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:11,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:11,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1869096855, now seen corresponding path program 1 times [2024-11-13 15:53:11,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:11,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320658809] [2024-11-13 15:53:11,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:11,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:11,847 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-13 15:53:11,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:11,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320658809] [2024-11-13 15:53:11,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320658809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:11,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:11,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:53:11,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231786428] [2024-11-13 15:53:11,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:11,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:53:11,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:11,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:53:11,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:53:11,849 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-13 15:53:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:12,095 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2024-11-13 15:53:12,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:53:12,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 17 [2024-11-13 15:53:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:12,097 INFO L225 Difference]: With dead ends: 121 [2024-11-13 15:53:12,097 INFO L226 Difference]: Without dead ends: 121 [2024-11-13 15:53:12,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:53:12,098 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 77 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:12,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 166 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:53:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-13 15:53:12,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2024-11-13 15:53:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.621212121212121) internal successors, (107), 97 states have internal predecessors, (107), 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-13 15:53:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2024-11-13 15:53:12,111 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 17 [2024-11-13 15:53:12,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:12,111 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2024-11-13 15:53:12,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-13 15:53:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-11-13 15:53:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 15:53:12,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:12,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:12,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:53:12,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:12,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:12,113 INFO L85 PathProgramCache]: Analyzing trace with hash 938290527, now seen corresponding path program 1 times [2024-11-13 15:53:12,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:12,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111981132] [2024-11-13 15:53:12,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:12,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:12,361 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-13 15:53:12,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:12,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111981132] [2024-11-13 15:53:12,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111981132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:12,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:12,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:53:12,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028059973] [2024-11-13 15:53:12,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:12,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:53:12,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:12,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:53:12,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:53:12,362 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-13 15:53:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:12,501 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-13 15:53:12,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:53:12,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2024-11-13 15:53:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:12,502 INFO L225 Difference]: With dead ends: 93 [2024-11-13 15:53:12,502 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 15:53:12,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:53:12,503 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 43 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:12,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 221 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:53:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 15:53:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-11-13 15:53:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 89 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-13 15:53:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2024-11-13 15:53:12,515 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 19 [2024-11-13 15:53:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:12,515 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2024-11-13 15:53:12,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-13 15:53:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2024-11-13 15:53:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 15:53:12,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:12,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:12,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:53:12,516 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:12,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:12,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1986586294, now seen corresponding path program 1 times [2024-11-13 15:53:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:12,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936638196] [2024-11-13 15:53:12,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:12,790 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-13 15:53:12,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:12,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936638196] [2024-11-13 15:53:12,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936638196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:12,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:12,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:53:12,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846926990] [2024-11-13 15:53:12,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:12,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:53:12,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:12,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:53:12,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:53:12,792 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-13 15:53:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:12,992 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-13 15:53:12,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:53:12,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2024-11-13 15:53:12,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:12,993 INFO L225 Difference]: With dead ends: 92 [2024-11-13 15:53:12,994 INFO L226 Difference]: Without dead ends: 92 [2024-11-13 15:53:12,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:53:12,995 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 37 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:12,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 178 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:53:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-13 15:53:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-11-13 15:53:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 58 states have (on average 1.603448275862069) internal successors, (93), 88 states have internal predecessors, (93), 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-13 15:53:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2024-11-13 15:53:13,003 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 20 [2024-11-13 15:53:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:13,003 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2024-11-13 15:53:13,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-13 15:53:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2024-11-13 15:53:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 15:53:13,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:13,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:13,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:53:13,008 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:13,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:13,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1986586293, now seen corresponding path program 1 times [2024-11-13 15:53:13,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:13,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793295771] [2024-11-13 15:53:13,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:13,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:13,417 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-13 15:53:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:13,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793295771] [2024-11-13 15:53:13,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793295771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:13,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:13,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:53:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159697068] [2024-11-13 15:53:13,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:13,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:53:13,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:13,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:53:13,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:53:13,418 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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-13 15:53:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:13,638 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2024-11-13 15:53:13,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:53:13,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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 20 [2024-11-13 15:53:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:13,640 INFO L225 Difference]: With dead ends: 91 [2024-11-13 15:53:13,640 INFO L226 Difference]: Without dead ends: 91 [2024-11-13 15:53:13,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:53:13,641 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 38 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:13,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 240 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:53:13,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-13 15:53:13,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2024-11-13 15:53:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 87 states have internal predecessors, (92), 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-13 15:53:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2024-11-13 15:53:13,645 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 20 [2024-11-13 15:53:13,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:13,645 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2024-11-13 15:53:13,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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-13 15:53:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2024-11-13 15:53:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 15:53:13,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:13,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:13,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:53:13,646 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:13,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1454632935, now seen corresponding path program 1 times [2024-11-13 15:53:13,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:13,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460479687] [2024-11-13 15:53:13,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:13,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:14,101 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-13 15:53:14,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:14,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460479687] [2024-11-13 15:53:14,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460479687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:14,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:14,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:53:14,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338897102] [2024-11-13 15:53:14,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:14,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:53:14,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:14,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:53:14,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:53:14,103 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-13 15:53:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:14,397 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2024-11-13 15:53:14,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:53:14,397 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 21 [2024-11-13 15:53:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:14,398 INFO L225 Difference]: With dead ends: 128 [2024-11-13 15:53:14,398 INFO L226 Difference]: Without dead ends: 128 [2024-11-13 15:53:14,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:53:14,399 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 42 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:14,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 344 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:53:14,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-13 15:53:14,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 101. [2024-11-13 15:53:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 100 states have internal predecessors, (106), 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-13 15:53:14,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2024-11-13 15:53:14,403 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 21 [2024-11-13 15:53:14,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:14,403 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2024-11-13 15:53:14,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-13 15:53:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2024-11-13 15:53:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 15:53:14,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:14,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:14,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:53:14,404 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:14,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:14,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1770460516, now seen corresponding path program 1 times [2024-11-13 15:53:14,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:14,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419902811] [2024-11-13 15:53:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:14,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:14,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:14,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419902811] [2024-11-13 15:53:14,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419902811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:53:14,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999916762] [2024-11-13 15:53:14,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:14,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:14,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:53:14,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:53:14,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:53:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:14,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 15:53:14,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:53:15,018 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-13 15:53:15,069 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-13 15:53:15,070 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 23 treesize of output 24 [2024-11-13 15:53:15,099 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 25 treesize of output 13 [2024-11-13 15:53:15,134 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-13 15:53:15,180 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 25 treesize of output 13 [2024-11-13 15:53:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:15,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:53:15,339 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 38 treesize of output 34 [2024-11-13 15:53:15,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:15,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2024-11-13 15:53:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:16,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999916762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:53:16,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:53:16,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-13 15:53:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498497672] [2024-11-13 15:53:16,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:53:16,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:53:16,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:16,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:53:16,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:53:16,745 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 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-13 15:53:17,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:17,223 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2024-11-13 15:53:17,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:53:17,224 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 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 21 [2024-11-13 15:53:17,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:17,224 INFO L225 Difference]: With dead ends: 103 [2024-11-13 15:53:17,224 INFO L226 Difference]: Without dead ends: 103 [2024-11-13 15:53:17,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-11-13 15:53:17,225 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 103 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:17,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 358 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:53:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-13 15:53:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2024-11-13 15:53:17,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 99 states have internal predecessors, (105), 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-13 15:53:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2024-11-13 15:53:17,229 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 21 [2024-11-13 15:53:17,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:17,229 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2024-11-13 15:53:17,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 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-13 15:53:17,230 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2024-11-13 15:53:17,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 15:53:17,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:17,230 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:17,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:53:17,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:17,434 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:17,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:17,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1770460515, now seen corresponding path program 1 times [2024-11-13 15:53:17,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:17,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251246781] [2024-11-13 15:53:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:17,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:17,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:17,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251246781] [2024-11-13 15:53:17,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251246781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:53:17,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371090933] [2024-11-13 15:53:17,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:17,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:17,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:53:17,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:53:17,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:53:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:18,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 15:53:18,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:53:18,118 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-13 15:53:18,125 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-13 15:53:18,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:53:18,209 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-13 15:53:18,226 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:53:18,227 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-13 15:53:18,296 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-13 15:53:18,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:53:18,350 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 15:53:18,350 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 18 treesize of output 21 [2024-11-13 15:53:18,369 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 15:53:18,370 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-13 15:53:18,403 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 25 treesize of output 13 [2024-11-13 15:53:18,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:53:18,449 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-13 15:53:18,509 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 25 treesize of output 13 [2024-11-13 15:53:18,515 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 7 treesize of output 3 [2024-11-13 15:53:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:18,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:53:18,802 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-13 15:53:18,809 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 102 treesize of output 94 [2024-11-13 15:53:18,852 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 32 treesize of output 28 [2024-11-13 15:53:19,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:19,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2024-11-13 15:53:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:19,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371090933] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:53:19,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:53:19,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-11-13 15:53:19,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103204606] [2024-11-13 15:53:19,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:53:19,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 15:53:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:19,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 15:53:19,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-13 15:53:19,523 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 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-13 15:53:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:20,356 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2024-11-13 15:53:20,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:53:20,357 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 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 21 [2024-11-13 15:53:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:20,357 INFO L225 Difference]: With dead ends: 102 [2024-11-13 15:53:20,357 INFO L226 Difference]: Without dead ends: 102 [2024-11-13 15:53:20,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2024-11-13 15:53:20,358 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 49 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:20,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 612 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:53:20,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-13 15:53:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2024-11-13 15:53:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.4647887323943662) 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-13 15:53:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2024-11-13 15:53:20,362 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 21 [2024-11-13 15:53:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:20,362 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2024-11-13 15:53:20,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 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-13 15:53:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2024-11-13 15:53:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 15:53:20,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:20,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:20,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 15:53:20,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 15:53:20,567 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:20,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:20,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2143947926, now seen corresponding path program 1 times [2024-11-13 15:53:20,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:20,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003448409] [2024-11-13 15:53:20,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:20,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:20,939 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-13 15:53:20,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:20,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003448409] [2024-11-13 15:53:20,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003448409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:20,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:20,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:53:20,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712413974] [2024-11-13 15:53:20,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:20,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:53:20,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:20,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:53:20,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:53:20,943 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-13 15:53:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:21,318 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2024-11-13 15:53:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:53:21,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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 22 [2024-11-13 15:53:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:21,320 INFO L225 Difference]: With dead ends: 123 [2024-11-13 15:53:21,320 INFO L226 Difference]: Without dead ends: 123 [2024-11-13 15:53:21,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:53:21,321 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 36 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:21,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 274 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:53:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-13 15:53:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 100. [2024-11-13 15:53:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 99 states have internal predecessors, (105), 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-13 15:53:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2024-11-13 15:53:21,326 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 22 [2024-11-13 15:53:21,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:21,327 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2024-11-13 15:53:21,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-13 15:53:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2024-11-13 15:53:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 15:53:21,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:21,328 INFO L215 NwaCegarLoop]: trace histogram [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-13 15:53:21,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:53:21,328 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:21,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2037876165, now seen corresponding path program 1 times [2024-11-13 15:53:21,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:21,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793662926] [2024-11-13 15:53:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:21,635 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-13 15:53:21,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:21,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793662926] [2024-11-13 15:53:21,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793662926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:21,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:21,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:53:21,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284795976] [2024-11-13 15:53:21,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:21,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:53:21,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:21,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:53:21,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:53:21,637 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-13 15:53:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:21,953 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2024-11-13 15:53:21,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:53:21,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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 23 [2024-11-13 15:53:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:21,954 INFO L225 Difference]: With dead ends: 114 [2024-11-13 15:53:21,954 INFO L226 Difference]: Without dead ends: 114 [2024-11-13 15:53:21,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:53:21,955 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 24 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:21,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 236 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:53:21,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-13 15:53:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2024-11-13 15:53:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.452054794520548) internal successors, (106), 100 states have internal predecessors, (106), 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-13 15:53:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2024-11-13 15:53:21,961 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 23 [2024-11-13 15:53:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:21,962 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2024-11-13 15:53:21,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-13 15:53:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2024-11-13 15:53:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 15:53:21,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:21,962 INFO L215 NwaCegarLoop]: trace histogram [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-13 15:53:21,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 15:53:21,963 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:21,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1250348429, now seen corresponding path program 1 times [2024-11-13 15:53:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:21,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583093155] [2024-11-13 15:53:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:21,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:22,179 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-13 15:53:22,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:22,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583093155] [2024-11-13 15:53:22,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583093155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:22,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:22,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:53:22,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737875127] [2024-11-13 15:53:22,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:22,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:53:22,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:22,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:53:22,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:53:22,181 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 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-13 15:53:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:22,381 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2024-11-13 15:53:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:53:22,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 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-13 15:53:22,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:22,382 INFO L225 Difference]: With dead ends: 100 [2024-11-13 15:53:22,382 INFO L226 Difference]: Without dead ends: 100 [2024-11-13 15:53:22,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:53:22,384 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 196 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:22,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 78 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:53:22,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-13 15:53:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-13 15:53:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 99 states have internal predecessors, (105), 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-13 15:53:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2024-11-13 15:53:22,389 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 24 [2024-11-13 15:53:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:22,389 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2024-11-13 15:53:22,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 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-13 15:53:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2024-11-13 15:53:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 15:53:22,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:22,390 INFO L215 NwaCegarLoop]: trace histogram [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-13 15:53:22,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 15:53:22,390 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:22,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:22,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1250348430, now seen corresponding path program 1 times [2024-11-13 15:53:22,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:22,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732298090] [2024-11-13 15:53:22,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:22,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:22,449 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-13 15:53:22,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:22,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732298090] [2024-11-13 15:53:22,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732298090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:22,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:22,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:53:22,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056972676] [2024-11-13 15:53:22,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:22,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:53:22,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:22,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:53:22,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:53:22,451 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 4 states, 3 states have (on average 8.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-13 15:53:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:22,515 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-13 15:53:22,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:53:22,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.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-13 15:53:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:22,517 INFO L225 Difference]: With dead ends: 93 [2024-11-13 15:53:22,517 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 15:53:22,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:53:22,517 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 58 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:22,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 48 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:53:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 15:53:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-13 15:53:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 92 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-13 15:53:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-13 15:53:22,521 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 24 [2024-11-13 15:53:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:22,521 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-13 15:53:22,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.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-13 15:53:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-13 15:53:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 15:53:22,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:22,522 INFO L215 NwaCegarLoop]: trace histogram [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-13 15:53:22,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 15:53:22,522 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:22,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:22,523 INFO L85 PathProgramCache]: Analyzing trace with hash 106095679, now seen corresponding path program 1 times [2024-11-13 15:53:22,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:22,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953619212] [2024-11-13 15:53:22,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:22,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:22,633 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-13 15:53:22,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:22,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953619212] [2024-11-13 15:53:22,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953619212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:22,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:22,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:53:22,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956347474] [2024-11-13 15:53:22,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:22,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:53:22,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:22,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:53:22,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:53:22,635 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 5 states, 4 states have (on average 6.25) 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-13 15:53:22,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:22,710 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-13 15:53:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:53:22,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) 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 25 [2024-11-13 15:53:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:22,711 INFO L225 Difference]: With dead ends: 92 [2024-11-13 15:53:22,711 INFO L226 Difference]: Without dead ends: 92 [2024-11-13 15:53:22,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:53:22,712 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 26 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:22,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 186 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:53:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-13 15:53:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-13 15:53:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 91 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-13 15:53:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-13 15:53:22,715 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 25 [2024-11-13 15:53:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:22,715 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-13 15:53:22,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) 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-13 15:53:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-13 15:53:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 15:53:22,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:22,716 INFO L215 NwaCegarLoop]: trace histogram [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-13 15:53:22,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 15:53:22,716 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:22,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:22,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1006001139, now seen corresponding path program 1 times [2024-11-13 15:53:22,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:22,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61108467] [2024-11-13 15:53:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:22,858 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-13 15:53:22,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:22,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61108467] [2024-11-13 15:53:22,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61108467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:22,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:22,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:53:22,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695757879] [2024-11-13 15:53:22,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:22,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:53:22,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:22,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:53:22,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:53:22,860 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-13 15:53:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:22,980 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2024-11-13 15:53:22,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:53:22,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2024-11-13 15:53:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:22,982 INFO L225 Difference]: With dead ends: 94 [2024-11-13 15:53:22,982 INFO L226 Difference]: Without dead ends: 94 [2024-11-13 15:53:22,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:53:22,982 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 26 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:22,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 161 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:53:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-13 15:53:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2024-11-13 15:53:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.3013698630136987) 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-13 15:53:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2024-11-13 15:53:22,985 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 26 [2024-11-13 15:53:22,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:22,986 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2024-11-13 15:53:22,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-13 15:53:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2024-11-13 15:53:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 15:53:22,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:22,987 INFO L215 NwaCegarLoop]: trace histogram [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-13 15:53:22,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 15:53:22,987 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:22,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1121264127, now seen corresponding path program 1 times [2024-11-13 15:53:22,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:22,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750059660] [2024-11-13 15:53:22,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:22,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:23,454 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-13 15:53:23,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:23,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750059660] [2024-11-13 15:53:23,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750059660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:23,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:23,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:53:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700451900] [2024-11-13 15:53:23,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:23,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:53:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:23,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:53:23,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:53:23,456 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 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-13 15:53:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:23,928 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2024-11-13 15:53:23,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:53:23,929 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 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 27 [2024-11-13 15:53:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:23,929 INFO L225 Difference]: With dead ends: 111 [2024-11-13 15:53:23,929 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 15:53:23,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-13 15:53:23,930 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 66 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:23,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 250 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:53:23,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 15:53:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2024-11-13 15:53:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 94 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-13 15:53:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-13 15:53:23,934 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 27 [2024-11-13 15:53:23,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:23,934 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-13 15:53:23,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 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-13 15:53:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-13 15:53:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 15:53:23,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:23,936 INFO L215 NwaCegarLoop]: trace histogram [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-13 15:53:23,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 15:53:23,936 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:23,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:23,937 INFO L85 PathProgramCache]: Analyzing trace with hash -399449456, now seen corresponding path program 1 times [2024-11-13 15:53:23,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:23,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379761868] [2024-11-13 15:53:23,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:23,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:24,143 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-13 15:53:24,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379761868] [2024-11-13 15:53:24,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379761868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:24,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:24,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:53:24,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689924070] [2024-11-13 15:53:24,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:24,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:53:24,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:24,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:53:24,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:53:24,144 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-13 15:53:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:24,289 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2024-11-13 15:53:24,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:53:24,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2024-11-13 15:53:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:24,290 INFO L225 Difference]: With dead ends: 94 [2024-11-13 15:53:24,290 INFO L226 Difference]: Without dead ends: 94 [2024-11-13 15:53:24,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:53:24,291 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 80 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:24,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 114 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:53:24,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-13 15:53:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-13 15:53:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.2727272727272727) 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-13 15:53:24,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2024-11-13 15:53:24,297 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 28 [2024-11-13 15:53:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:24,297 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-13 15:53:24,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-13 15:53:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2024-11-13 15:53:24,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 15:53:24,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:24,298 INFO L215 NwaCegarLoop]: trace histogram [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-13 15:53:24,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 15:53:24,299 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:24,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:24,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1440446192, now seen corresponding path program 1 times [2024-11-13 15:53:24,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:24,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410572884] [2024-11-13 15:53:24,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:24,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:25,030 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-13 15:53:25,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:25,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410572884] [2024-11-13 15:53:25,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410572884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:25,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:25,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:53:25,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307249582] [2024-11-13 15:53:25,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:25,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:53:25,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:25,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:53:25,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:53:25,032 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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-13 15:53:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:25,367 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2024-11-13 15:53:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:53:25,368 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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 33 [2024-11-13 15:53:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:25,368 INFO L225 Difference]: With dead ends: 121 [2024-11-13 15:53:25,369 INFO L226 Difference]: Without dead ends: 121 [2024-11-13 15:53:25,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:53:25,370 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 31 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:25,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 445 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:53:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-13 15:53:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2024-11-13 15:53:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.22) internal successors, (122), 116 states have internal predecessors, (122), 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-13 15:53:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2024-11-13 15:53:25,378 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 33 [2024-11-13 15:53:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:25,378 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2024-11-13 15:53:25,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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-13 15:53:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2024-11-13 15:53:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 15:53:25,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:25,378 INFO L215 NwaCegarLoop]: trace histogram [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-13 15:53:25,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 15:53:25,378 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:25,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:25,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1440445580, now seen corresponding path program 1 times [2024-11-13 15:53:25,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:25,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338836428] [2024-11-13 15:53:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:26,737 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-13 15:53:26,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:26,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338836428] [2024-11-13 15:53:26,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338836428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:26,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:26,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 15:53:26,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199937575] [2024-11-13 15:53:26,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:26,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:53:26,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:53:26,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:53:26,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:53:26,740 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 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-13 15:53:27,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:27,794 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2024-11-13 15:53:27,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:53:27,795 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 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 33 [2024-11-13 15:53:27,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:27,796 INFO L225 Difference]: With dead ends: 120 [2024-11-13 15:53:27,796 INFO L226 Difference]: Without dead ends: 100 [2024-11-13 15:53:27,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2024-11-13 15:53:27,797 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 96 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:27,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 386 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:53:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-13 15:53:27,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-13 15:53:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 98 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-13 15:53:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2024-11-13 15:53:27,801 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 33 [2024-11-13 15:53:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:27,802 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2024-11-13 15:53:27,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 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-13 15:53:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2024-11-13 15:53:27,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 15:53:27,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:27,803 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 15:53:27,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 15:53:27,803 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-13 15:53:27,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:27,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1271817329, now seen corresponding path program 1 times [2024-11-13 15:53:27,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:53:27,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209193478] [2024-11-13 15:53:27,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:27,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:53:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:28,876 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:53:28,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:53:28,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209193478] [2024-11-13 15:53:28,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209193478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:53:28,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796201705] [2024-11-13 15:53:28,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:28,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:28,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:53:28,879 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:53:28,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9161e720-2cad-4227-bf63-0a74d3d0ac42/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:53:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:29,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-13 15:53:29,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:53:29,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:53:29,271 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-13 15:53:29,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:53:29,348 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 15:53:29,348 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-13 15:53:29,532 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 27 treesize of output 26 [2024-11-13 15:53:29,545 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-13 15:53:30,181 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 52 treesize of output 36 [2024-11-13 15:53:30,195 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:53:30,200 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 15:53:30,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-11-13 15:53:30,376 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:53:30,377 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-13 15:53:30,385 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:53:30,385 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-13 15:53:30,753 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 32 treesize of output 16 [2024-11-13 15:53:30,894 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:53:30,895 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 38 treesize of output 22 [2024-11-13 15:53:30,909 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:53:30,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:30,912 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 15 treesize of output 10 [2024-11-13 15:53:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:53:30,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:53:31,890 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-13 15:53:31,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 182 treesize of output 180 [2024-11-13 15:53:31,983 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-13 15:53:31,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 286 treesize of output 272 [2024-11-13 15:53:32,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:32,012 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 196 treesize of output 194 [2024-11-13 15:53:32,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:32,038 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 190 treesize of output 188 [2024-11-13 15:53:32,063 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 6 treesize of output 4 [2024-11-13 15:53:32,080 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 6 treesize of output 4 [2024-11-13 15:53:32,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:32,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 315 treesize of output 329 [2024-11-13 15:53:59,186 WARN L286 SmtUtils]: Spent 25.95s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 15:53:59,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:59,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3233 treesize of output 3167 [2024-11-13 15:54:56,698 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse30 (< |c_ULTIMATE.start_append_~plist#1.offset| 1)) (.cse1 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 1))) (let ((.cse6 (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|)) (.cse3 (or .cse30 .cse1)) (.cse4 (or .cse1 (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ 2 |c_ULTIMATE.start_append_~plist#1.offset|)))) (.cse2 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|))) (let ((.cse317 (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse730 (+ v_prenex_25 4))) (let ((.cse729 (let ((.cse732 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25))) (store .cse732 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse732) |c_ULTIMATE.start_append_~item~0#1.base|) .cse730))))) (let ((.cse731 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse729) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse729 .cse730) 0) (= (select .cse731 .cse730) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse731 4) 0))))))) (.cse31 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse498 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_30 Int) (v_prenex_31 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse727 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_31))) (store .cse727 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse727) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_31 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_30 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_23 Int) (v_prenex_22 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse728 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse728 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse728) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_23 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_22 4)) 0)))))) (.cse32 (< |c_ULTIMATE.start_append_~plist#1.offset| 0)) (.cse33 (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse39 (not .cse2)) (.cse27 (and .cse3 .cse4)) (.cse497 (forall ((v_prenex_36 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int)) (let ((.cse724 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse725 (+ v_prenex_21 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse723 (store .cse724 0 v_prenex_36))) (store .cse723 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse723) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_36 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse725) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse726 (store .cse724 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse726 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse726) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse725) 0)))))) (let ((.cse29 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse722 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse722 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse722) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse9 (or .cse497 .cse1 .cse2)) (.cse18 (or .cse27 (forall ((v_prenex_18 Int) (v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse719 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse720 (+ v_prenex_17 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse718 (store .cse719 0 v_prenex_18))) (store .cse718 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse718) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_18 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse720) 0) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse721 (store .cse719 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse721 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse721) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse720)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse20 (or .cse32 .cse33 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse717 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse717 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse717) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_19 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse39)) (.cse12 (or .cse1 .cse498)) (.cse21 (or .cse1 (forall ((v_prenex_16 Int) (v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse714 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse715 (+ v_prenex_15 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse713 (store .cse714 0 v_prenex_16))) (store .cse713 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse713) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_16 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse715) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse716 (store .cse714 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse716 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse716) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse715) 0)))))) (.cse83 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_14 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse711 (+ v_prenex_14 4)) (.cse710 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse709 (store .cse710 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse709 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse709) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse711) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse712 (store .cse710 0 v_prenex_14))) (store .cse712 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse712) v_arrayElimCell_45) .cse711)))) v_arrayElimCell_57) 4) 0))))))) (.cse82 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_25 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse708 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25)) (.cse705 (+ v_prenex_25 4))) (let ((.cse707 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse708) v_arrayElimCell_45) .cse705))) (let ((.cse706 (store .cse708 4 .cse707))) (let ((.cse704 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse706) v_arrayElimCell_57))) (or (= (select .cse704 4) 0) (= (select .cse704 .cse705) 0) (= (select .cse706 .cse705) 0) (= .cse707 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse84 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_prenex_22 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse703 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse703 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse703) v_arrayElimCell_45) (+ v_prenex_23 4))))) v_arrayElimCell_57) (+ v_prenex_22 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse87 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_25 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse701 (+ v_prenex_25 4))) (let ((.cse700 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse702 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25))) (store .cse702 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse702) v_arrayElimCell_45) .cse701)))) v_arrayElimCell_57))) (or (= (select .cse700 4) 0) (= (select .cse700 .cse701) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse91 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_24 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (= (let ((.cse699 (+ v_prenex_24 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse698 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_24))) (store .cse698 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse698) v_arrayElimCell_45) .cse699)))) v_arrayElimCell_57) .cse699)) 0))))) (.cse100 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_25 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse695 (+ v_prenex_25 4))) (let ((.cse696 (let ((.cse697 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25))) (store .cse697 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse697) v_arrayElimCell_45) .cse695))))) (let ((.cse694 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse696) v_arrayElimCell_57))) (or (= (select .cse694 4) 0) (= (select .cse694 .cse695) 0) (= (select .cse696 .cse695) 0))))))))) (.cse101 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_30 Int) (v_arrayElimCell_57 Int) (v_prenex_31 Int) (v_arrayElimCell_45 Int)) (let ((.cse690 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_31))) (let ((.cse691 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse690)) (.cse692 (+ v_prenex_31 4)) (.cse693 (+ v_prenex_30 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse690 4 (select (select .cse691 v_arrayElimCell_45) .cse692))) v_arrayElimCell_57) .cse693) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse690 4 (select (select .cse691 |c_ULTIMATE.start_append_~item~0#1.base|) .cse692))) v_arrayElimCell_57) .cse693) 0)))))))) (.cse85 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_29 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse687 (+ v_prenex_29 4))) (let ((.cse688 (let ((.cse689 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (store .cse689 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse689) v_arrayElimCell_45) .cse687))))) (let ((.cse686 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse688) v_arrayElimCell_57))) (or (= (select .cse686 .cse687) 0) (= (select .cse688 .cse687) 0) (= (select .cse686 4) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse36 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse683 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse684 (+ v_prenex_15 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse682 (store .cse683 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse682 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse682) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse684) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse685 (store .cse683 0 v_prenex_16))) (store .cse685 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse685) v_arrayElimCell_45) (+ v_prenex_16 4))))) v_arrayElimCell_57) .cse684) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse80 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse679 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_12))) (let ((.cse680 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse679)) (.cse681 (+ v_prenex_12 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse679 4 (select (select .cse680 |c_ULTIMATE.start_append_~item~0#1.base|) .cse681))) v_arrayElimCell_57) .cse6) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse679 4 (select (select .cse680 v_arrayElimCell_45) .cse681))) v_arrayElimCell_57) .cse6) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse86 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_29 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse678 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29)) (.cse675 (+ v_prenex_29 4))) (let ((.cse676 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse678) v_arrayElimCell_45) .cse675))) (let ((.cse677 (store .cse678 4 .cse676))) (let ((.cse674 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse677) v_arrayElimCell_57))) (or (= (select .cse674 .cse675) 0) (= .cse676 0) (= (select .cse677 .cse675) 0) (= (select .cse674 4) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse88 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse671 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse672 (+ v_prenex_17 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse670 (store .cse671 0 v_prenex_18))) (store .cse670 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse670) v_arrayElimCell_45) (+ v_prenex_18 4))))) v_arrayElimCell_57) .cse672) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse673 (store .cse671 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse673 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse673) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse672) 0))))))) (.cse89 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_28 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (= (let ((.cse669 (+ v_prenex_28 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse668 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_28))) (store .cse668 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse668) v_arrayElimCell_45) .cse669)))) v_arrayElimCell_57) .cse669)) 0))))) (.cse90 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_27 Int) (v_prenex_35 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse664 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_35))) (let ((.cse665 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse664)) (.cse666 (+ v_prenex_35 4)) (.cse667 (+ v_prenex_27 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse664 4 (select (select .cse665 |c_ULTIMATE.start_append_~item~0#1.base|) .cse666))) v_arrayElimCell_57) .cse667) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse664 4 (select (select .cse665 v_arrayElimCell_45) .cse666))) v_arrayElimCell_57) .cse667) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse103 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse663 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_44))) (store .cse663 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse663) v_arrayElimCell_45) (+ 4 v_arrayElimCell_44))))) v_arrayElimCell_57) .cse6) 0))))) (.cse92 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_29 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse661 (+ v_prenex_29 4))) (let ((.cse660 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse662 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (store .cse662 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse662) v_arrayElimCell_45) .cse661)))) v_arrayElimCell_57))) (or (= (select .cse660 .cse661) 0) (= (select .cse660 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse37 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_57 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse659 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse659 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse659) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse6) 0))))) (.cse97 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse658 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse656 (store .cse658 0 v_prenex_14)) (.cse654 (+ v_prenex_14 4))) (let ((.cse653 (let ((.cse657 (store .cse658 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse657 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse657) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) (.cse655 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse656) v_arrayElimCell_45) .cse654))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse653) v_arrayElimCell_57) .cse654) 0) (= (select .cse653 .cse654) 0) (= .cse655 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse656 4 .cse655)) v_arrayElimCell_57) 4) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse104 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse652 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse652 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse652) v_arrayElimCell_45) .cse6)))) v_arrayElimCell_57) .cse6) 0))))) (.cse76 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_39 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (= (let ((.cse651 (+ v_prenex_39 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse650 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_39))) (store .cse650 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse650) v_arrayElimCell_45) .cse651)))) v_arrayElimCell_57) .cse651)) 0))))) (.cse77 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_38 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse649 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38)) (.cse647 (+ v_prenex_38 4))) (let ((.cse645 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse649) v_arrayElimCell_45) .cse647))) (let ((.cse648 (store .cse649 4 .cse645))) (let ((.cse646 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse648) v_arrayElimCell_57))) (or (= .cse645 0) (= 0 (select .cse646 .cse647)) (= (select .cse646 4) 0) (= (select .cse648 .cse647) 0)))))))))) (.cse79 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_38 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse643 (+ v_prenex_38 4))) (let ((.cse642 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse644 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38))) (store .cse644 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse644) v_arrayElimCell_45) .cse643)))) v_arrayElimCell_57))) (or (= 0 (select .cse642 .cse643)) (= (select .cse642 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse81 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_38 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse639 (+ v_prenex_38 4))) (let ((.cse640 (let ((.cse641 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38))) (store .cse641 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse641) v_arrayElimCell_45) .cse639))))) (let ((.cse638 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse640) v_arrayElimCell_57))) (or (= 0 (select .cse638 .cse639)) (= (select .cse638 4) 0) (= (select .cse640 .cse639) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse102 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_41 Int) (v_arrayElimCell_57 Int) (v_prenex_40 Int) (v_arrayElimCell_45 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse637 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_40))) (store .cse637 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse637) v_arrayElimCell_45) (+ v_prenex_40 4))))) v_arrayElimCell_57) (+ v_prenex_41 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse105 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_37 Int) (v_arrayElimCell_57 Int) (v_prenex_43 Int) (v_arrayElimCell_45 Int)) (let ((.cse633 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_43))) (let ((.cse634 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse633)) (.cse635 (+ v_prenex_43 4)) (.cse636 (+ v_prenex_37 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse633 4 (select (select .cse634 v_arrayElimCell_45) .cse635))) v_arrayElimCell_57) .cse636) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse633 4 (select (select .cse634 |c_ULTIMATE.start_append_~item~0#1.base|) .cse635))) v_arrayElimCell_57) .cse636) 0)))))))) (.cse98 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_14 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (let ((.cse631 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse628 (let ((.cse632 (store .cse631 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse632 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse632) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) (.cse629 (+ v_prenex_14 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse628) v_arrayElimCell_57) .cse629) 0) (= (select .cse628 .cse629) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse630 (store .cse631 0 v_prenex_14))) (store .cse630 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse630) v_arrayElimCell_45) .cse629)))) v_arrayElimCell_57) 4) 0)))))))) (.cse99 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_33 Int) (v_arrayElimCell_57 Int) (v_prenex_32 Int) (v_arrayElimCell_45 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse627 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_32))) (store .cse627 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse627) v_arrayElimCell_45) (+ v_prenex_32 4))))) v_arrayElimCell_57) (+ v_prenex_33 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse68 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_57 Int) (v_prenex_20 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse626 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse626 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse626) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) (+ v_prenex_20 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse0 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse625 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_13))) (store .cse625 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse625) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_13 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse7 (or (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse623 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29)) (.cse624 (+ v_prenex_29 4))) (let ((.cse622 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse623) |c_ULTIMATE.start_append_~item~0#1.base|) .cse624))) (or (= .cse622 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (store .cse623 4 .cse622) .cse624) 0))))) .cse31)) (.cse24 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int)) (let ((.cse620 (+ v_prenex_14 4)) (.cse619 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse618 (store .cse619 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse618 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse618) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse620) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse621 (store .cse619 0 v_prenex_14))) (store .cse621 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse621) |c_ULTIMATE.start_append_~item~0#1.base|) .cse620)))) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse26 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int)) (let ((.cse616 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse613 (let ((.cse617 (store .cse616 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse617 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse617) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) (.cse614 (+ v_prenex_14 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse613) |c_ULTIMATE.start_append_~item~0#1.base|) .cse614) 0) (= (select .cse613 .cse614) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse615 (store .cse616 0 v_prenex_14))) (store .cse615 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse615) |c_ULTIMATE.start_append_~item~0#1.base|) .cse614)))) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse8 (or .cse27 (forall ((v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (let ((.cse612 (+ v_prenex_28 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse611 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_28))) (store .cse611 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse611) |c_ULTIMATE.start_append_~item~0#1.base|) .cse612)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse612)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse10 (or .cse27 (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse609 (+ v_prenex_29 4))) (let ((.cse608 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse610 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (store .cse610 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse610) |c_ULTIMATE.start_append_~item~0#1.base|) .cse609)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse608 .cse609) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse608 4) 0))))))) (.cse19 (or (forall ((v_prenex_34 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_34)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_34 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse31)) (.cse11 (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_26)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_26 4)) 0))) .cse31)) (.cse13 (or .cse31 .cse317)) (.cse14 (or .cse27 (forall ((v_prenex_24 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (let ((.cse607 (+ v_prenex_24 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse606 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_24))) (store .cse606 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse606) |c_ULTIMATE.start_append_~item~0#1.base|) .cse607)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse607)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse15 (or (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse605 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25)) (.cse603 (+ v_prenex_25 4))) (let ((.cse604 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse605) |c_ULTIMATE.start_append_~item~0#1.base|) .cse603))) (let ((.cse602 (store .cse605 4 .cse604))) (or (= (select .cse602 .cse603) 0) (= .cse604 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse602) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0)))))) .cse31)) (.cse16 (or .cse27 (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse600 (+ v_prenex_25 4))) (let ((.cse599 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse601 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25))) (store .cse601 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse601) |c_ULTIMATE.start_append_~item~0#1.base|) .cse600)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse599 .cse600) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse599 4) 0))))))) (.cse17 (or .cse31 (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse596 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25)) (.cse598 (+ v_prenex_25 4))) (let ((.cse597 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse596) |c_ULTIMATE.start_append_~item~0#1.base|) .cse598))) (or (= (select (store .cse596 4 .cse597) .cse598) 0) (= .cse597 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) (.cse22 (or .cse27 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_27 Int) (v_prenex_35 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse594 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_35))) (store .cse594 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse594) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_35 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_27 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_33 Int) (v_prenex_32 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse595 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_32))) (store .cse595 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse595) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_32 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_33 4)) 0))))))) (.cse23 (or (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse591 (+ v_prenex_29 4))) (let ((.cse592 (let ((.cse593 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (store .cse593 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse593) |c_ULTIMATE.start_append_~item~0#1.base|) .cse591))))) (let ((.cse590 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse592) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse590 .cse591) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse590 4) 0) (= (select .cse592 .cse591) 0)))))) .cse31)) (.cse35 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_arrayElimCell_45 Int)) (let ((.cse587 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse588 (+ v_prenex_15 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse586 (store .cse587 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse586 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse586) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse588) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse589 (store .cse587 0 v_prenex_16))) (store .cse589 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse589) v_arrayElimCell_45) (+ v_prenex_16 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse588) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse25 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_20 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse585 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse585 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse585) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_20 4)) 0))))) (.cse28 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|))) (and (or .cse0 .cse1 .cse2) (or (and (or .cse1 .cse2) .cse3 .cse4) (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse5 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_12))) (store .cse5 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse5) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_12 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6) 0)))) (or (and .cse7 .cse8 .cse9 .cse10 (or (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse2) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (or (and .cse24 .cse25 .cse26) .cse27)) .cse28) (or .cse29 (and (or .cse30 .cse31) (or (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ |c_ULTIMATE.start_append_~plist#1.offset| 1)) .cse31) (or .cse31 .cse2))) (or .cse32 .cse33 (and .cse29 (or .cse28 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_19 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse34 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse34 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse34) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_19 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse35)) (or .cse28 (and .cse36 .cse37 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_57 Int) (v_prenex_19 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse38 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse38 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse38) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) (+ v_prenex_19 4))))))))) .cse39) (or (let ((.cse48 (or (forall ((v_prenex_25 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse186 (+ v_prenex_25 4))) (let ((.cse185 (let ((.cse188 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25))) (store .cse188 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse188) v_arrayElimCell_57) .cse186))))) (let ((.cse187 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse185) v_arrayElimCell_57))) (or (= (select .cse185 .cse186) 0) (= (select .cse187 .cse186) 0) (= (select .cse187 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse31)) (.cse49 (or .cse27 (forall ((v_prenex_25 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse183 (+ v_prenex_25 4))) (let ((.cse182 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse184 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25))) (store .cse184 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse184) v_arrayElimCell_57) .cse183)))) v_arrayElimCell_57))) (or (= (select .cse182 .cse183) 0) (= (select .cse182 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) (.cse50 (or .cse27 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_27 Int) (v_prenex_35 Int) (v_arrayElimCell_57 Int)) (let ((.cse177 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_35))) (let ((.cse178 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse177)) (.cse179 (+ v_prenex_35 4)) (.cse180 (+ v_prenex_27 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse177 4 (select (select .cse178 |c_ULTIMATE.start_append_~item~0#1.base|) .cse179))) v_arrayElimCell_57) .cse180) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse177 4 (select (select .cse178 v_arrayElimCell_57) .cse179))) v_arrayElimCell_57) .cse180) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_33 Int) (v_arrayElimCell_57 Int) (v_prenex_32 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse181 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_32))) (store .cse181 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse181) v_arrayElimCell_57) (+ v_prenex_32 4))))) v_arrayElimCell_57) (+ v_prenex_33 4)) 0))))))) (.cse51 (or .cse27 (forall ((v_prenex_24 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (let ((.cse176 (+ v_prenex_24 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse175 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_24))) (store .cse175 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse175) v_arrayElimCell_57) .cse176)))) v_arrayElimCell_57) .cse176)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse61 (or (forall ((v_prenex_29 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse173 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29)) (.cse174 (+ v_prenex_29 4))) (let ((.cse172 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse173) v_arrayElimCell_57) .cse174))) (or (= .cse172 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (store .cse173 4 .cse172) .cse174) 0))))) .cse31)) (.cse62 (or (forall ((v_prenex_26 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_26)) v_arrayElimCell_57) (+ v_prenex_26 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse31)) (.cse63 (or (forall ((v_prenex_25 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse171 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25)) (.cse169 (+ v_prenex_25 4))) (let ((.cse170 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse171) v_arrayElimCell_57) .cse169))) (let ((.cse168 (store .cse171 4 .cse170))) (or (= (select .cse168 .cse169) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse168) v_arrayElimCell_57) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse170 0)))))) .cse31)) (.cse64 (or .cse27 (forall ((v_prenex_29 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse166 (+ v_prenex_29 4))) (let ((.cse165 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse167 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (store .cse167 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse167) v_arrayElimCell_57) .cse166)))) v_arrayElimCell_57))) (or (= (select .cse165 .cse166) 0) (= (select .cse165 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) (.cse52 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_30 Int) (v_arrayElimCell_57 Int) (v_prenex_31 Int)) (let ((.cse160 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_31))) (let ((.cse161 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse160)) (.cse162 (+ v_prenex_31 4)) (.cse163 (+ v_prenex_30 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse160 4 (select (select .cse161 v_arrayElimCell_57) .cse162))) v_arrayElimCell_57) .cse163) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse160 4 (select (select .cse161 |c_ULTIMATE.start_append_~item~0#1.base|) .cse162))) v_arrayElimCell_57) .cse163) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_prenex_22 Int) (v_arrayElimCell_57 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse164 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse164 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse164) v_arrayElimCell_57) (+ v_prenex_23 4))))) v_arrayElimCell_57) (+ v_prenex_22 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse65 (or .cse27 (forall ((v_prenex_28 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse159 (+ v_prenex_28 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse158 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_28))) (store .cse158 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse158) v_arrayElimCell_57) .cse159)))) v_arrayElimCell_57) .cse159)) 0))))) (.cse67 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_57 Int)) (let ((.cse156 (+ v_prenex_14 4)) (.cse155 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse154 (store .cse155 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse154 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse154) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse156) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse157 (store .cse155 0 v_prenex_14))) (store .cse157 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse157) v_arrayElimCell_57) .cse156)))) v_arrayElimCell_57) 4) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse69 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_57 Int)) (let ((.cse152 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse149 (let ((.cse153 (store .cse152 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse153 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse153) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) (.cse150 (+ v_prenex_14 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse149) v_arrayElimCell_57) .cse150) 0) (= (select .cse149 .cse150) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse151 (store .cse152 0 v_prenex_14))) (store .cse151 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse151) v_arrayElimCell_57) .cse150)))) v_arrayElimCell_57) 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse66 (or (forall ((v_prenex_34 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_34)) v_arrayElimCell_57) (+ v_prenex_34 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse31)) (.cse70 (or (forall ((v_prenex_25 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse146 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25)) (.cse148 (+ v_prenex_25 4))) (let ((.cse147 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse146) v_arrayElimCell_57) .cse148))) (or (= (select (store .cse146 4 .cse147) .cse148) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse147 0))))) .cse31)) (.cse75 (or (forall ((v_prenex_29 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse143 (+ v_prenex_29 4))) (let ((.cse144 (let ((.cse145 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (store .cse145 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse145) v_arrayElimCell_57) .cse143))))) (let ((.cse142 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse144) v_arrayElimCell_57))) (or (= (select .cse142 .cse143) 0) (= (select .cse142 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse144 .cse143) 0)))))) .cse31))) (and (or .cse1 (forall ((v_prenex_39 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (let ((.cse41 (+ v_prenex_39 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse40 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_39))) (store .cse40 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse40) v_arrayElimCell_57) .cse41)))) v_arrayElimCell_57) .cse41)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse27 (forall ((v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_44 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse42 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_44))) (store .cse42 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse42) v_arrayElimCell_57) (+ 4 v_arrayElimCell_44))))) v_arrayElimCell_57) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse27 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_57 Int)) (let ((.cse43 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_12))) (let ((.cse44 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse43)) (.cse45 (+ v_prenex_12 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse43 4 (select (select .cse44 |c_ULTIMATE.start_append_~item~0#1.base|) .cse45))) v_arrayElimCell_57) .cse6) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse43 4 (select (select .cse44 v_arrayElimCell_57) .cse45))) v_arrayElimCell_57) .cse6) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_57 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse46 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_44))) (store .cse46 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse46) v_arrayElimCell_57) (+ 4 v_arrayElimCell_44))))) v_arrayElimCell_57) .cse6) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_57 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse47 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_13))) (store .cse47 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse47) v_arrayElimCell_57) (+ v_prenex_13 4))))) v_arrayElimCell_57) .cse6))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or (and .cse48 .cse49 .cse50 .cse51 (or .cse52 .cse1) (or (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse54 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse55 (+ v_prenex_15 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse53 (store .cse54 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse53 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse53) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse55) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse56 (store .cse54 0 v_prenex_16))) (store .cse56 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse56) v_arrayElimCell_57) (+ v_prenex_16 4))))) v_arrayElimCell_57) .cse55) 0)))) .cse1) (or (forall ((v_prenex_36 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int)) (let ((.cse58 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse59 (+ v_prenex_21 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse57 (store .cse58 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse57 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse57) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse59) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse60 (store .cse58 0 v_prenex_36))) (store .cse60 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse60) v_arrayElimCell_57) (+ v_prenex_36 4))))) v_arrayElimCell_57) .cse59) 0)))) .cse1) .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 (or (and .cse67 .cse68 .cse69) .cse27) .cse70 (or (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse72 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse73 (+ v_prenex_17 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse71 (store .cse72 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse71 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse71) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse73) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse74 (store .cse72 0 v_prenex_18))) (store .cse74 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse74) v_arrayElimCell_57) (+ v_prenex_18 4))))) v_arrayElimCell_57) .cse73) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse27) .cse75) .cse28) (or (forall ((v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_42 Int)) (or (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_42)) v_arrayElimCell_57) (+ v_prenex_42 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse31) (or (and .cse76 .cse77 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_13 Int) (v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse78 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_13))) (store .cse78 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse78) v_arrayElimCell_45) (+ v_prenex_13 4))))) v_arrayElimCell_57) .cse6) 0)))) .cse79 .cse80 .cse81 (or (and .cse82 .cse83 .cse84 .cse68 .cse85 .cse36 .cse86 .cse87 .cse88 .cse89 .cse90 .cse91 .cse92 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_36 Int) (v_arrayElimCell_57 Int) (v_prenex_21 Int) (v_arrayElimCell_45 Int)) (let ((.cse94 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse95 (+ v_prenex_21 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse93 (store .cse94 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse93 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse93) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse95) 0) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse96 (store .cse94 0 v_prenex_36))) (store .cse96 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse96) v_arrayElimCell_45) (+ v_prenex_36 4))))) v_arrayElimCell_57) .cse95))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse97 .cse98 .cse99 .cse100 .cse101) .cse28) .cse102 .cse103 .cse104 .cse105) .cse27) (or (forall ((v_prenex_38 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse107 (+ v_prenex_38 4))) (let ((.cse106 (let ((.cse109 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38))) (store .cse109 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse109) v_arrayElimCell_57) .cse107))))) (let ((.cse108 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse106) v_arrayElimCell_57))) (or (= (select .cse106 .cse107) 0) (= (select .cse108 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse108 .cse107) 0)))))) .cse1) (or .cse1 (forall ((v_prenex_12 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse110 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_12))) (let ((.cse111 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse110)) (.cse112 (+ v_prenex_12 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse110 4 (select (select .cse111 |c_ULTIMATE.start_append_~item~0#1.base|) .cse112))) v_arrayElimCell_57) .cse6) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse110 4 (select (select .cse111 v_arrayElimCell_57) .cse112))) v_arrayElimCell_57) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (or .cse28 (and .cse48 .cse49 .cse50 .cse51 .cse61 .cse62 .cse63 .cse64 (or .cse52 .cse27) .cse65 (or .cse27 (and .cse67 .cse68 .cse69 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_arrayElimCell_57 Int)) (let ((.cse114 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse115 (+ v_prenex_15 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse113 (store .cse114 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse113 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse113) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse115) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse116 (store .cse114 0 v_prenex_16))) (store .cse116 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse116) v_arrayElimCell_57) (+ v_prenex_16 4))))) v_arrayElimCell_57) .cse115) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_36 Int) (v_arrayElimCell_57 Int) (v_prenex_21 Int)) (let ((.cse118 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse119 (+ v_prenex_21 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse117 (store .cse118 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse117 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse117) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse119) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse120 (store .cse118 0 v_prenex_36))) (store .cse120 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse120) v_arrayElimCell_57) (+ v_prenex_36 4))))) v_arrayElimCell_57) .cse119) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_arrayElimCell_57 Int)) (let ((.cse122 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse123 (+ v_prenex_17 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse121 (store .cse122 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse121 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse121) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse123) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse124 (store .cse122 0 v_prenex_18))) (store .cse124 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse124) v_arrayElimCell_57) (+ v_prenex_18 4))))) v_arrayElimCell_57) .cse123) 0)))))))) .cse66 .cse70 .cse75)) (or .cse1 (forall ((v_prenex_38 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse126 (+ v_prenex_38 4))) (let ((.cse125 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse127 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38))) (store .cse127 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse127) v_arrayElimCell_57) .cse126)))) v_arrayElimCell_57))) (or (= (select .cse125 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse125 .cse126) 0)))))) (or (forall ((v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse128 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse128 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse128) v_arrayElimCell_57) .cse6)))) v_arrayElimCell_57) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse31) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_37 Int) (v_arrayElimCell_57 Int) (v_prenex_43 Int)) (let ((.cse129 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_43))) (let ((.cse130 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse129)) (.cse131 (+ v_prenex_43 4)) (.cse132 (+ v_prenex_37 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse129 4 (select (select .cse130 v_arrayElimCell_57) .cse131))) v_arrayElimCell_57) .cse132) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse129 4 (select (select .cse130 |c_ULTIMATE.start_append_~item~0#1.base|) .cse131))) v_arrayElimCell_57) .cse132) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_41 Int) (v_arrayElimCell_57 Int) (v_prenex_40 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse133 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_40))) (store .cse133 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse133) v_arrayElimCell_57) (+ v_prenex_40 4))))) v_arrayElimCell_57) (+ v_prenex_41 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse1) (or (forall ((v_prenex_38 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse137 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38)) (.cse135 (+ v_prenex_38 4))) (let ((.cse136 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse137) v_arrayElimCell_57) .cse135))) (let ((.cse134 (store .cse137 4 .cse136))) (or (= (select .cse134 .cse135) 0) (= .cse136 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse134) v_arrayElimCell_57) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse31) (or (forall ((v_prenex_38 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse138 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38)) (.cse140 (+ v_prenex_38 4))) (let ((.cse139 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse138) v_arrayElimCell_57) .cse140))) (or (= (select (store .cse138 4 .cse139) .cse140) 0) (= .cse139 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse31) (or .cse1 (forall ((v_prenex_13 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse141 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_13))) (store .cse141 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse141) v_arrayElimCell_57) (+ v_prenex_13 4))))) v_arrayElimCell_57) .cse6))))))) .cse2) (or .cse28 (let ((.cse207 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_45 Int)) (let ((.cse464 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse467 (store .cse464 0 v_prenex_14)) (.cse465 (+ v_prenex_14 4))) (let ((.cse466 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse467) v_arrayElimCell_45) .cse465))) (or (= (select (let ((.cse463 (store .cse464 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse463 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse463) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6))) .cse465) 0) (= .cse466 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse467 4 .cse466)) v_arrayElimCell_45) 4) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse209 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_14 Int) (v_arrayElimCell_45 Int)) (let ((.cse461 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse458 (let ((.cse462 (store .cse461 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse462 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse462) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) (.cse459 (+ v_prenex_14 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse458) v_arrayElimCell_45) .cse459) 0) (= (select .cse458 .cse459) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse460 (store .cse461 0 v_prenex_14))) (store .cse460 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse460) v_arrayElimCell_45) .cse459)))) v_arrayElimCell_45) 4) 0)))))))) (.cse210 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_45 Int)) (let ((.cse456 (+ v_prenex_14 4)) (.cse455 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse454 (store .cse455 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse454 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse454) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_45) .cse456) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse457 (store .cse455 0 v_prenex_14))) (store .cse457 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse457) v_arrayElimCell_45) .cse456)))) v_arrayElimCell_45) 4) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse211 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_20 Int) (v_arrayElimCell_45 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse453 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse453 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse453) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_45) (+ v_prenex_20 4)) 0))))) (.cse208 (forall ((v_prenex_36 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_45 Int)) (let ((.cse450 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse451 (+ v_prenex_21 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse449 (store .cse450 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse449 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse449) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_45) .cse451) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse452 (store .cse450 0 v_prenex_36))) (store .cse452 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse452) v_arrayElimCell_45) (+ v_prenex_36 4))))) v_arrayElimCell_45) .cse451) 0))))) (.cse277 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse448 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_13))) (store .cse448 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse448) v_arrayElimCell_45) (+ v_prenex_13 4))))) v_arrayElimCell_45) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse284 (forall ((v_prenex_13 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse447 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_13))) (store .cse447 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse447) v_arrayElimCell_45) (+ v_prenex_13 4))))) v_arrayElimCell_57) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse223 (forall ((v_prenex_13 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse445 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse444 (store .cse445 0 v_prenex_13))) (store .cse444 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse444) v_arrayElimCell_45) (+ v_prenex_13 4))))) v_arrayElimCell_57) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse446 (store .cse445 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse446 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse446) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse6) 0))))) (.cse270 (forall ((v_prenex_36 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_45 Int)) (let ((.cse441 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse442 (+ v_prenex_21 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse440 (store .cse441 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse440 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse440) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse442) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse443 (store .cse441 0 v_prenex_36))) (store .cse443 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse443) v_arrayElimCell_45) (+ v_prenex_36 4))))) v_arrayElimCell_57) .cse442)))))) (.cse229 (forall ((v_prenex_38 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse437 (+ v_prenex_38 4))) (let ((.cse438 (let ((.cse439 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38))) (store .cse439 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse439) v_arrayElimCell_45) .cse437))))) (let ((.cse436 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse438) v_arrayElimCell_45))) (or (= (select .cse436 4) 0) (= (select .cse436 .cse437) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse438 .cse437) 0))))))) (.cse232 (forall ((v_prenex_39 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse435 (+ v_prenex_39 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse434 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_39))) (store .cse434 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse434) v_arrayElimCell_45) .cse435)))) v_arrayElimCell_45) .cse435)) 0)))) (.cse230 (or .cse31 (forall ((v_prenex_38 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse432 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38)) (.cse433 (+ v_prenex_38 4))) (let ((.cse431 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse432) v_arrayElimCell_45) .cse433))) (or (= .cse431 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (store .cse432 4 .cse431) .cse433) 0))))))) (.cse237 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_42 Int) (v_arrayElimCell_45 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_42)) v_arrayElimCell_45) (+ v_prenex_42 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse31)) (.cse246 (or .cse31 (forall ((v_prenex_38 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse430 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38)) (.cse429 (+ v_prenex_38 4))) (let ((.cse427 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse430) v_arrayElimCell_45) .cse429))) (let ((.cse428 (store .cse430 4 .cse427))) (or (= .cse427 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse428) v_arrayElimCell_45) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse428 .cse429) 0)))))))) (.cse263 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_37 Int) (v_prenex_43 Int) (v_arrayElimCell_45 Int)) (let ((.cse422 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_43))) (let ((.cse423 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse422)) (.cse424 (+ v_prenex_43 4)) (.cse425 (+ v_prenex_37 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse422 4 (select (select .cse423 |c_ULTIMATE.start_append_~item~0#1.base|) .cse424))) v_arrayElimCell_45) .cse425) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse422 4 (select (select .cse423 v_arrayElimCell_45) .cse424))) v_arrayElimCell_45) .cse425) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_41 Int) (v_prenex_40 Int) (v_arrayElimCell_45 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse426 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_40))) (store .cse426 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse426) v_arrayElimCell_45) (+ v_prenex_40 4))))) v_arrayElimCell_45) (+ v_prenex_41 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse220 (forall ((v_prenex_38 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse420 (+ v_prenex_38 4))) (let ((.cse419 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse421 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38))) (store .cse421 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse421) v_arrayElimCell_45) .cse420)))) v_arrayElimCell_45))) (or (= (select .cse419 4) 0) (= (select .cse419 .cse420) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse233 (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_26)) v_arrayElimCell_45) (+ v_prenex_26 4)) 0))) .cse31)) (.cse242 (or .cse27 (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse416 (+ v_prenex_25 4))) (let ((.cse415 (let ((.cse418 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25))) (store .cse418 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse418) v_arrayElimCell_45) .cse416))))) (let ((.cse417 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse415) v_arrayElimCell_45))) (or (= (select .cse415 .cse416) 0) (= (select .cse417 .cse416) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse417 4) 0)))))))) (.cse269 (or (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse412 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25)) (.cse414 (+ v_prenex_25 4))) (let ((.cse413 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse412) v_arrayElimCell_45) .cse414))) (or (= (select (store .cse412 4 .cse413) .cse414) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse413 0))))) .cse31)) (.cse231 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_30 Int) (v_prenex_31 Int) (v_arrayElimCell_45 Int)) (let ((.cse407 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_31))) (let ((.cse408 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse407)) (.cse409 (+ v_prenex_31 4)) (.cse410 (+ v_prenex_30 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse407 4 (select (select .cse408 v_arrayElimCell_45) .cse409))) v_arrayElimCell_45) .cse410) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse407 4 (select (select .cse408 |c_ULTIMATE.start_append_~item~0#1.base|) .cse409))) v_arrayElimCell_45) .cse410) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_prenex_22 Int) (v_arrayElimCell_45 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse411 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse411 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse411) v_arrayElimCell_45) (+ v_prenex_23 4))))) v_arrayElimCell_45) (+ v_prenex_22 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse275 (or .cse27 (forall ((v_prenex_24 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (or (= 0 (let ((.cse406 (+ v_prenex_24 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse405 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_24))) (store .cse405 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse405) v_arrayElimCell_45) .cse406)))) v_arrayElimCell_45) .cse406))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse276 (or (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse404 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25)) (.cse402 (+ v_prenex_25 4))) (let ((.cse403 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse404) v_arrayElimCell_45) .cse402))) (let ((.cse401 (store .cse404 4 .cse403))) (or (= (select .cse401 .cse402) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse401) v_arrayElimCell_45) 4) 0) (= .cse403 0)))))) .cse31)) (.cse285 (or (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse399 (+ v_prenex_25 4))) (let ((.cse398 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse400 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25))) (store .cse400 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse400) v_arrayElimCell_45) .cse399)))) v_arrayElimCell_45))) (or (= (select .cse398 .cse399) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse398 4) 0))))) .cse27)) (.cse326 (forall ((v_prenex_13 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse397 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_13))) (store .cse397 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse397) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_13 4))))) v_arrayElimCell_57) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (and .cse7 (or (forall ((v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse190 (+ v_prenex_28 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse189 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_28))) (store .cse189 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse189) v_arrayElimCell_45) .cse190)))) v_arrayElimCell_45) .cse190)) 0))) .cse27) (or (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse192 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29)) (.cse193 (+ v_prenex_29 4))) (let ((.cse191 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse192) v_arrayElimCell_45) .cse193))) (or (= .cse191 0) (= (select (store .cse192 4 .cse191) .cse193) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse31) (or (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse195 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse196 (+ v_prenex_15 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse194 (store .cse195 0 v_prenex_16))) (store .cse194 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse194) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_16 4))))) v_arrayElimCell_57) .cse196) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse197 (store .cse195 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse197 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse197) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse196) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse1) .cse8 (or (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse199 (+ v_prenex_29 4))) (let ((.cse198 (let ((.cse201 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (store .cse201 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse201) v_arrayElimCell_45) .cse199))))) (let ((.cse200 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse198) v_arrayElimCell_45))) (or (= (select .cse198 .cse199) 0) (= (select .cse200 .cse199) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse200 4) 0)))))) .cse31) .cse9 .cse10 (or .cse27 (and .cse24 .cse25 .cse26 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int)) (let ((.cse204 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse206 (store .cse204 0 v_prenex_14)) (.cse205 (+ v_prenex_14 4))) (let ((.cse202 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse206) |c_ULTIMATE.start_append_~item~0#1.base|) .cse205))) (or (= .cse202 0) (= (select (let ((.cse203 (store .cse204 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse203 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse203) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6))) .cse205) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse206 4 .cse202)) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or (and .cse207 (or .cse208 .cse2) .cse209 .cse210 .cse211 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_arrayElimCell_45 Int)) (let ((.cse213 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse214 (+ v_prenex_17 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse212 (store .cse213 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse212 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse212) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_45) .cse214) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse215 (store .cse213 0 v_prenex_18))) (store .cse215 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse215) v_arrayElimCell_45) (+ v_prenex_18 4))))) v_arrayElimCell_45) .cse214) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_arrayElimCell_45 Int)) (let ((.cse217 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse218 (+ v_prenex_15 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse216 (store .cse217 0 v_prenex_16))) (store .cse216 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse216) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_16 4))))) v_arrayElimCell_45) .cse218) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse219 (store .cse217 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse219 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse219) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_45) .cse218) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse27) (or (and (or .cse220 .cse1) (or .cse1 (forall ((v_prenex_39 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (or (= (let ((.cse222 (+ v_prenex_39 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse221 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_39))) (store .cse221 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse221) v_arrayElimCell_45) .cse222)))) v_arrayElimCell_57) .cse222)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse1 .cse223) (or .cse27 (forall ((v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse224 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_44))) (store .cse224 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse224) v_arrayElimCell_45) (+ 4 v_arrayElimCell_44))))) v_arrayElimCell_57) .cse6) 0)))) (or .cse1 (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse226 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse227 (+ v_prenex_15 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse225 (store .cse226 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse225 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse225) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse227) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse228 (store .cse226 0 v_prenex_16))) (store .cse228 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse228) v_arrayElimCell_45) (+ v_prenex_16 4))))) v_arrayElimCell_57) .cse227) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or .cse229 .cse1) .cse230 (or .cse231 .cse1) (or .cse232 .cse1) .cse233 (or .cse27 (forall ((v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int) (v_arrayElimCell_44 Int)) (let ((.cse235 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse234 (store .cse235 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse234 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse234) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse6) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse236 (store .cse235 0 v_arrayElimCell_44))) (store .cse236 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse236) v_arrayElimCell_45) (+ 4 v_arrayElimCell_44))))) v_arrayElimCell_57) .cse6) 0))))) .cse237 (or (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse239 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse240 (+ v_prenex_17 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse238 (store .cse239 0 v_prenex_18))) (store .cse238 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse238) v_arrayElimCell_45) (+ v_prenex_18 4))))) v_arrayElimCell_57) .cse240) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse241 (store .cse239 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse241 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse241) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse240) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse27) (or (and .cse85 .cse86 .cse89 .cse90 .cse92 .cse99) .cse27) .cse242 (or .cse1 (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse243 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_12))) (let ((.cse244 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse243)) (.cse245 (+ v_prenex_12 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse243 4 (select (select .cse244 |c_ULTIMATE.start_append_~item~0#1.base|) .cse245))) v_arrayElimCell_45) .cse6) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse243 4 (select (select .cse244 v_arrayElimCell_45) .cse245))) v_arrayElimCell_45) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (or (and .cse207 .cse209 .cse210 .cse211) .cse27) .cse246 (or .cse1 (forall ((v_prenex_38 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse248 (+ v_prenex_38 4))) (let ((.cse247 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse249 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38))) (store .cse249 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse249) v_arrayElimCell_45) .cse248)))) v_arrayElimCell_57))) (or (= 0 (select .cse247 .cse248)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse247 4) 0)))))) (or .cse27 (forall ((v_prenex_18 Int) (v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse251 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse252 (+ v_prenex_17 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse250 (store .cse251 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse250 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse250) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_45) .cse252) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse253 (store .cse251 0 v_prenex_18))) (store .cse253 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse253) v_arrayElimCell_45) (+ v_prenex_18 4))))) v_arrayElimCell_45) .cse252) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or .cse1 (forall ((v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse254 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse254 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse254) v_arrayElimCell_45) .cse6)))) v_arrayElimCell_57) .cse6) 0)))) (or .cse27 (and .cse83 .cse68 .cse97 .cse98)) (or (forall ((v_prenex_38 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse256 (+ v_prenex_38 4))) (let ((.cse257 (let ((.cse258 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38))) (store .cse258 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse258) v_arrayElimCell_45) .cse256))))) (let ((.cse255 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse257) v_arrayElimCell_57))) (or (= 0 (select .cse255 .cse256)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse255 4) 0) (= (select .cse257 .cse256) 0)))))) .cse1) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int) (v_arrayElimCell_44 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse259 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_44))) (store .cse259 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse259) v_arrayElimCell_45) (+ 4 v_arrayElimCell_44))))) v_arrayElimCell_45) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse27) (or .cse1 (forall ((v_prenex_12 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse260 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_12))) (let ((.cse261 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse260)) (.cse262 (+ v_prenex_12 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse260 4 (select (select .cse261 |c_ULTIMATE.start_append_~item~0#1.base|) .cse262))) v_arrayElimCell_57) .cse6) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse260 4 (select (select .cse261 v_arrayElimCell_45) .cse262))) v_arrayElimCell_57) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (or .cse1 .cse263) (or (forall ((v_prenex_38 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse268 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38)) (.cse266 (+ v_prenex_38 4))) (let ((.cse264 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse268) v_arrayElimCell_45) .cse266))) (let ((.cse267 (store .cse268 4 .cse264))) (let ((.cse265 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse267) v_arrayElimCell_57))) (or (= .cse264 0) (= 0 (select .cse265 .cse266)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse265 4) 0) (= (select .cse267 .cse266) 0))))))) .cse1) .cse269 (or .cse270 .cse1) (or .cse1 (forall ((v_prenex_30 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_31 Int) (v_arrayElimCell_45 Int)) (let ((.cse271 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_31))) (let ((.cse272 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse271)) (.cse273 (+ v_prenex_31 4)) (.cse274 (+ v_prenex_30 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse271 4 (select (select .cse272 v_arrayElimCell_45) .cse273))) v_arrayElimCell_57) .cse274) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse271 4 (select (select .cse272 |c_ULTIMATE.start_append_~item~0#1.base|) .cse273))) v_arrayElimCell_57) .cse274) 0)))))) (or .cse27 (and .cse82 .cse87 .cse91 .cse100)) .cse275 .cse276 (or .cse1 .cse277) (or (forall ((v_prenex_16 Int) (v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse279 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse280 (+ v_prenex_15 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse278 (store .cse279 0 v_prenex_16))) (store .cse278 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse278) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_16 4))))) v_arrayElimCell_45) .cse280) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse281 (store .cse279 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse281 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse281) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_45) .cse280) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse1) (or (forall ((v_prenex_41 Int) (v_prenex_40 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse282 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_40))) (store .cse282 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse282) v_arrayElimCell_45) (+ v_prenex_40 4))))) v_arrayElimCell_57) (+ v_prenex_41 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse1) (or (forall ((v_prenex_23 Int) (v_prenex_22 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse283 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse283 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse283) v_arrayElimCell_45) (+ v_prenex_23 4))))) v_arrayElimCell_57) (+ v_prenex_22 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse1) (or .cse208 .cse1) (or .cse284 .cse1) .cse285 (or (forall ((v_prenex_37 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_43 Int) (v_arrayElimCell_45 Int)) (let ((.cse286 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_43))) (let ((.cse287 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse286)) (.cse288 (+ v_prenex_43 4)) (.cse289 (+ v_prenex_37 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse286 4 (select (select .cse287 v_arrayElimCell_45) .cse288))) v_arrayElimCell_57) .cse289) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse286 4 (select (select .cse287 |c_ULTIMATE.start_append_~item~0#1.base|) .cse288))) v_arrayElimCell_57) .cse289) 0))))) .cse1)) .cse2) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse291 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse290 (store .cse291 0 v_prenex_12))) (store .cse290 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse290) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_12 4))))) v_arrayElimCell_57) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse292 (store .cse291 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse292 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse292) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse6) 0)))) .cse1) .cse18 .cse19 (or (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse294 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse295 (+ v_prenex_17 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse293 (store .cse294 0 v_prenex_18))) (store .cse293 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse293) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_18 4))))) v_arrayElimCell_57) .cse295) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse296 (store .cse294 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse296 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse296) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse295) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse27) (or .cse27 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_45 Int)) (let ((.cse297 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_12))) (let ((.cse298 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse297)) (.cse299 (+ v_prenex_12 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse297 4 (select (select .cse298 |c_ULTIMATE.start_append_~item~0#1.base|) .cse299))) v_arrayElimCell_45) .cse6) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse297 4 (select (select .cse298 v_arrayElimCell_45) .cse299))) v_arrayElimCell_45) .cse6) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_45 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse300 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_44))) (store .cse300 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse300) v_arrayElimCell_45) (+ 4 v_arrayElimCell_44))))) v_arrayElimCell_45) .cse6) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or .cse277 .cse2))) (or (and (or .cse27 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_25 Int) (v_arrayElimCell_57 Int)) (let ((.cse305 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25)) (.cse303 (+ v_prenex_25 4))) (let ((.cse304 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse305) |c_ULTIMATE.start_append_~item~0#1.base|) .cse303))) (let ((.cse302 (store .cse305 4 .cse304))) (let ((.cse301 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse302) v_arrayElimCell_57))) (or (= (select .cse301 4) 0) (= (select .cse302 .cse303) 0) (= (select .cse301 .cse303) 0) (= .cse304 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_25 Int) (v_arrayElimCell_57 Int)) (let ((.cse308 (+ v_prenex_25 4))) (let ((.cse307 (let ((.cse309 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25))) (store .cse309 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse309) |c_ULTIMATE.start_append_~item~0#1.base|) .cse308))))) (let ((.cse306 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse307) v_arrayElimCell_57))) (or (= (select .cse306 4) 0) (= (select .cse307 .cse308) 0) (= (select .cse306 .cse308) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_24 Int) (v_arrayElimCell_57 Int)) (= (let ((.cse311 (+ v_prenex_24 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse310 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_24))) (store .cse310 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse310) |c_ULTIMATE.start_append_~item~0#1.base|) .cse311)))) v_arrayElimCell_57) .cse311)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_25 Int) (v_arrayElimCell_57 Int)) (let ((.cse313 (+ v_prenex_25 4))) (let ((.cse312 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse314 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25))) (store .cse314 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse314) |c_ULTIMATE.start_append_~item~0#1.base|) .cse313)))) v_arrayElimCell_57))) (or (= (select .cse312 4) 0) (= (select .cse312 .cse313) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or (forall ((v_prenex_30 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_31 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse315 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_31))) (store .cse315 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse315) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_31 4))))) v_arrayElimCell_57) (+ v_prenex_30 4)) 0))) .cse1) (or .cse1 (forall ((v_prenex_23 Int) (v_prenex_22 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse316 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse316 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse316) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_23 4))))) v_arrayElimCell_57) (+ v_prenex_22 4)) 0))))) .cse2) .cse20 (or (and .cse11 .cse12 .cse14 (or .cse27 .cse317) .cse15 .cse16 .cse17) .cse2) .cse21 .cse22 .cse23 (or (and .cse83 (or (and .cse82 .cse84 .cse87 .cse91 .cse100 .cse101) .cse2) .cse68 .cse85 .cse36 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_57 Int)) (let ((.cse319 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse318 (store .cse319 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse318 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse318) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse6) 0) (forall ((v_prenex_12 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse320 (store .cse319 0 v_prenex_12))) (store .cse320 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse320) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_12 4))))) v_arrayElimCell_57) .cse6) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse80 .cse86 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_57 Int) (v_arrayElimCell_45 Int) (v_arrayElimCell_44 Int)) (let ((.cse322 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse321 (store .cse322 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse321 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse321) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse6) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse323 (store .cse322 0 v_arrayElimCell_44))) (store .cse323 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse323) v_arrayElimCell_45) (+ 4 v_arrayElimCell_44))))) v_arrayElimCell_57) .cse6) 0)))))) .cse88 .cse89 .cse90 (or .cse284 .cse2) .cse103 .cse92 .cse37 .cse97 (or .cse223 .cse2) .cse104 (or (and .cse76 .cse77 .cse79 .cse81 .cse102 .cse105) .cse2) (or .cse270 .cse2) .cse98 .cse99) .cse27) (or (and (or (forall ((v_prenex_12 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse324 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_12))) (store .cse324 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse324) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_12 4))))) v_arrayElimCell_57) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse1) (or .cse27 (forall ((v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse325 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_44))) (store .cse325 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse325) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_44))))) v_arrayElimCell_57) .cse6) 0)))) (or .cse1 .cse326)) .cse2) (or .cse27 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_27 Int) (v_prenex_35 Int) (v_arrayElimCell_57 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse327 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_35))) (store .cse327 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse327) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_35 4))))) v_arrayElimCell_57) (+ v_prenex_27 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_28 Int) (v_arrayElimCell_57 Int)) (= (let ((.cse329 (+ v_prenex_28 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse328 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_28))) (store .cse328 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse328) |c_ULTIMATE.start_append_~item~0#1.base|) .cse329)))) v_arrayElimCell_57) .cse329)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_33 Int) (v_arrayElimCell_57 Int) (v_prenex_32 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse330 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_32))) (store .cse330 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse330) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_32 4))))) v_arrayElimCell_57) (+ v_prenex_33 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_29 Int) (v_arrayElimCell_57 Int)) (let ((.cse332 (+ v_prenex_29 4))) (let ((.cse331 (let ((.cse334 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (store .cse334 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse334) |c_ULTIMATE.start_append_~item~0#1.base|) .cse332))))) (let ((.cse333 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse331) v_arrayElimCell_57))) (or (= (select .cse331 .cse332) 0) (= (select .cse333 .cse332) 0) (= (select .cse333 4) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_29 Int) (v_arrayElimCell_57 Int)) (let ((.cse336 (+ v_prenex_29 4))) (let ((.cse335 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse337 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (store .cse337 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse337) |c_ULTIMATE.start_append_~item~0#1.base|) .cse336)))) v_arrayElimCell_57))) (or (= (select .cse335 .cse336) 0) (= (select .cse335 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_29 Int) (v_arrayElimCell_57 Int)) (let ((.cse342 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29)) (.cse340 (+ v_prenex_29 4))) (let ((.cse338 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse342) |c_ULTIMATE.start_append_~item~0#1.base|) .cse340))) (let ((.cse339 (store .cse342 4 .cse338))) (let ((.cse341 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse339) v_arrayElimCell_57))) (or (= .cse338 0) (= (select .cse339 .cse340) 0) (= (select .cse341 .cse340) 0) (= (select .cse341 4) 0))))))))))) (or .cse27 (forall ((v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_44 Int)) (let ((.cse344 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse343 (store .cse344 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse343 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse343) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse6) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse345 (store .cse344 0 v_arrayElimCell_44))) (store .cse345 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse345) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_44))))) v_arrayElimCell_57) .cse6) 0))))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_33 Int) (v_prenex_32 Int) (v_arrayElimCell_45 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse346 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_32))) (store .cse346 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse346) v_arrayElimCell_45) (+ v_prenex_32 4))))) v_arrayElimCell_45) (+ v_prenex_33 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_27 Int) (v_prenex_35 Int) (v_arrayElimCell_45 Int)) (let ((.cse347 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_35))) (let ((.cse348 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse347)) (.cse349 (+ v_prenex_35 4)) (.cse350 (+ v_prenex_27 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse347 4 (select (select .cse348 v_arrayElimCell_45) .cse349))) v_arrayElimCell_45) .cse350) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse347 4 (select (select .cse348 |c_ULTIMATE.start_append_~item~0#1.base|) .cse349))) v_arrayElimCell_45) .cse350) 0)))))))) .cse27) (or .cse2 (and (or .cse229 .cse27) (or .cse232 .cse27) .cse230 .cse237 .cse246 (or .cse27 .cse263) (or .cse27 .cse220))) (or (and .cse233 .cse242 .cse269 (or .cse27 .cse231) .cse275 .cse276 .cse285) .cse2) (or (forall ((v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse351 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse351 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse351) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse6) 0))) .cse1) (or .cse1 (forall ((v_prenex_13 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse353 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse352 (store .cse353 0 v_prenex_13))) (store .cse352 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse352) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_13 4))))) v_arrayElimCell_57) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse354 (store .cse353 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse354 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse354) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse6) 0)))) .cse2) (or .cse32 .cse33 (forall ((v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse355 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse355 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse355) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) (+ v_prenex_19 4))))) .cse39) (or (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (let ((.cse357 (+ v_prenex_29 4))) (let ((.cse356 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse358 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (store .cse358 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse358) v_arrayElimCell_45) .cse357)))) v_arrayElimCell_45))) (or (= (select .cse356 .cse357) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse356 4) 0))))) .cse27) (or (forall ((v_prenex_36 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int)) (let ((.cse360 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse361 (+ v_prenex_21 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse359 (store .cse360 0 v_prenex_36))) (store .cse359 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse359) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_36 4))))) v_arrayElimCell_57) .cse361) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse362 (store .cse360 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse362 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse362) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse361) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse1 .cse2) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse363 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse363 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse363) v_arrayElimCell_45) .cse6)))) v_arrayElimCell_45) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse31) (or .cse31 (forall ((v_prenex_34 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_34)) v_arrayElimCell_45) (+ v_prenex_34 4)) 0)))) (or .cse27 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_14 Int) (v_arrayElimCell_57 Int)) (let ((.cse366 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse365 (+ v_prenex_14 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse364 (store .cse366 0 v_prenex_14))) (store .cse364 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse364) |c_ULTIMATE.start_append_~item~0#1.base|) .cse365)))) v_arrayElimCell_57) 4) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse367 (store .cse366 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse367 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse367) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) v_arrayElimCell_57) .cse365) 0)))))) .cse68 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_14 Int) (v_arrayElimCell_57 Int)) (let ((.cse370 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse371 (let ((.cse372 (store .cse370 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse372 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse372) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) (.cse369 (+ v_prenex_14 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse368 (store .cse370 0 v_prenex_14))) (store .cse368 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse368) |c_ULTIMATE.start_append_~item~0#1.base|) .cse369)))) v_arrayElimCell_57) 4) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse371) v_arrayElimCell_57) .cse369) 0) (= (select .cse371 .cse369) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_57 Int)) (let ((.cse378 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse373 (store .cse378 0 v_prenex_14)) (.cse376 (+ v_prenex_14 4))) (let ((.cse374 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse373) |c_ULTIMATE.start_append_~item~0#1.base|) .cse376)) (.cse375 (let ((.cse377 (store .cse378 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse377 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse377) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse373 4 .cse374)) v_arrayElimCell_57) 4) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse375) v_arrayElimCell_57) .cse376) 0) (= .cse374 0) (= (select .cse375 .cse376) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or .cse27 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_12 Int) (v_arrayElimCell_57 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse379 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_12))) (store .cse379 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse379) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_12 4))))) v_arrayElimCell_57) .cse6) 0)))) (or .cse326 .cse2) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_57 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse380 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_44))) (store .cse380 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse380) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_44))))) v_arrayElimCell_57) .cse6) 0)))))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_39 Int) (v_arrayElimCell_57 Int)) (= (let ((.cse382 (+ v_prenex_39 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse381 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_39))) (store .cse381 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse381) |c_ULTIMATE.start_append_~item~0#1.base|) .cse382)))) v_arrayElimCell_57) .cse382)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_38 Int) (v_arrayElimCell_57 Int)) (let ((.cse384 (+ v_prenex_38 4))) (let ((.cse383 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse385 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38))) (store .cse385 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse385) |c_ULTIMATE.start_append_~item~0#1.base|) .cse384)))) v_arrayElimCell_57))) (or (= (select .cse383 .cse384) 0) (= (select .cse383 4) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_37 Int) (v_arrayElimCell_57 Int) (v_prenex_43 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse386 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_43))) (store .cse386 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse386) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_43 4))))) v_arrayElimCell_57) (+ v_prenex_37 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_38 Int) (v_arrayElimCell_57 Int)) (let ((.cse391 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38)) (.cse389 (+ v_prenex_38 4))) (let ((.cse387 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse391) |c_ULTIMATE.start_append_~item~0#1.base|) .cse389))) (let ((.cse390 (store .cse391 4 .cse387))) (let ((.cse388 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse390) v_arrayElimCell_57))) (or (= .cse387 0) (= (select .cse388 .cse389) 0) (= (select .cse388 4) 0) (= (select .cse390 .cse389) 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_38 Int) (v_arrayElimCell_57 Int)) (let ((.cse393 (+ v_prenex_38 4))) (let ((.cse394 (let ((.cse395 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38))) (store .cse395 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse395) |c_ULTIMATE.start_append_~item~0#1.base|) .cse393))))) (let ((.cse392 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse394) v_arrayElimCell_57))) (or (= (select .cse392 .cse393) 0) (= (select .cse392 4) 0) (= (select .cse394 .cse393) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_41 Int) (v_arrayElimCell_57 Int) (v_prenex_40 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse396 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_40))) (store .cse396 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse396) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_40 4))))) v_arrayElimCell_57) (+ v_prenex_41 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse1 .cse2)))) (or .cse27 (and (or .cse0 .cse2) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse468 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_44))) (store .cse468 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse468) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_44))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_12 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse469 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_12))) (store .cse469 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse469) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_12 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6) 0)))))) (or (and (or .cse1 (forall ((v_prenex_39 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (let ((.cse471 (+ v_prenex_39 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse470 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_39))) (store .cse470 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse470) |c_ULTIMATE.start_append_~item~0#1.base|) .cse471)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse471)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or (forall ((v_prenex_38 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse473 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38)) (.cse474 (+ v_prenex_38 4))) (let ((.cse472 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse473) |c_ULTIMATE.start_append_~item~0#1.base|) .cse474))) (or (= .cse472 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (store .cse473 4 .cse472) .cse474) 0))))) .cse31) (or (forall ((v_prenex_38 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse478 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38)) (.cse477 (+ v_prenex_38 4))) (let ((.cse475 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse478) |c_ULTIMATE.start_append_~item~0#1.base|) .cse477))) (let ((.cse476 (store .cse478 4 .cse475))) (or (= .cse475 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse476) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse476 .cse477) 0)))))) .cse31) (or .cse1 (forall ((v_prenex_38 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse480 (+ v_prenex_38 4))) (let ((.cse479 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse481 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38))) (store .cse481 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse481) |c_ULTIMATE.start_append_~item~0#1.base|) .cse480)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse479 4) 0) (= (select .cse479 .cse480) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_37 Int) (v_prenex_43 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse482 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_43))) (store .cse482 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse482) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_43 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_37 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_41 Int) (v_prenex_40 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse483 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_40))) (store .cse483 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse483) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_40 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_41 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse1) (or .cse31 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_42 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_42)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_42 4)) 0)))) (or .cse1 (forall ((v_prenex_38 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse485 (+ v_prenex_38 4))) (let ((.cse486 (let ((.cse487 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38))) (store .cse487 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse487) |c_ULTIMATE.start_append_~item~0#1.base|) .cse485))))) (let ((.cse484 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse486) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse484 4) 0) (= (select .cse484 .cse485) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse486 .cse485) 0)))))))) .cse2) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_44 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse488 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_44))) (store .cse488 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse488) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_44))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse27) (or (and .cse7 (or (and .cse24 .cse25 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse490 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse491 (+ v_prenex_17 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse489 (store .cse490 0 v_prenex_18))) (store .cse489 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse489) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_18 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse491) 0) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse492 (store .cse490 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse492 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse492) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse491))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse26 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse494 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse495 (+ v_prenex_15 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse493 (store .cse494 0 v_prenex_16))) (store .cse493 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse493) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_16 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse495) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse496 (store .cse494 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse496 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse496) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse495) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or .cse497 .cse2)) .cse27) .cse8 .cse10 .cse19 (or (and .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 (or .cse27 .cse498)) .cse2) .cse22 .cse23) .cse28) (or (and (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_41 Int) (v_prenex_40 Int) (v_arrayElimCell_45 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse499 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_40))) (store .cse499 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse499) v_arrayElimCell_45) (+ v_prenex_40 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_41 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_38 Int) (v_arrayElimCell_45 Int)) (let ((.cse501 (+ v_prenex_38 4))) (let ((.cse502 (let ((.cse503 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38))) (store .cse503 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse503) v_arrayElimCell_45) .cse501))))) (let ((.cse500 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse502) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse500 .cse501) 0) (= (select .cse500 4) 0) (= (select .cse502 .cse501) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_37 Int) (v_prenex_43 Int) (v_arrayElimCell_45 Int)) (let ((.cse504 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_43))) (let ((.cse505 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse504)) (.cse506 (+ v_prenex_43 4)) (.cse507 (+ v_prenex_37 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse504 4 (select (select .cse505 |c_ULTIMATE.start_append_~item~0#1.base|) .cse506))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse507) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse504 4 (select (select .cse505 v_arrayElimCell_45) .cse506))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse507) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_38 Int) (v_arrayElimCell_45 Int)) (let ((.cse509 (+ v_prenex_38 4))) (let ((.cse508 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse510 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38))) (store .cse510 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse510) v_arrayElimCell_45) .cse509)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse508 .cse509) 0) (= (select .cse508 4) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_38 Int) (v_arrayElimCell_45 Int)) (let ((.cse515 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_38)) (.cse512 (+ v_prenex_38 4))) (let ((.cse513 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse515) v_arrayElimCell_45) .cse512))) (let ((.cse514 (store .cse515 4 .cse513))) (let ((.cse511 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse514) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse511 .cse512) 0) (= .cse513 0) (= (select .cse511 4) 0) (= (select .cse514 .cse512) 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_39 Int) (v_arrayElimCell_45 Int)) (= (let ((.cse517 (+ v_prenex_39 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse516 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_39))) (store .cse516 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse516) v_arrayElimCell_45) .cse517)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse517)) 0))))) .cse2) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_45 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse518 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse518 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse518) v_arrayElimCell_45) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_45 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse519 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_44))) (store .cse519 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse519) v_arrayElimCell_45) (+ 4 v_arrayElimCell_44))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6) 0)))) (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_45 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse520 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_13))) (store .cse520 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse520) v_arrayElimCell_45) (+ v_prenex_13 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse2) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_45 Int)) (let ((.cse521 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_12))) (let ((.cse522 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse521)) (.cse523 (+ v_prenex_12 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse521 4 (select (select .cse522 v_arrayElimCell_45) .cse523))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse521 4 (select (select .cse522 |c_ULTIMATE.start_append_~item~0#1.base|) .cse523))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_27 Int) (v_prenex_35 Int) (v_arrayElimCell_45 Int)) (let ((.cse524 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_35))) (let ((.cse525 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse524)) (.cse526 (+ v_prenex_35 4)) (.cse527 (+ v_prenex_27 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse524 4 (select (select .cse525 |c_ULTIMATE.start_append_~item~0#1.base|) .cse526))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse527) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse524 4 (select (select .cse525 v_arrayElimCell_45) .cse526))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse527) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_29 Int) (v_arrayElimCell_45 Int)) (let ((.cse529 (+ v_prenex_29 4))) (let ((.cse530 (let ((.cse531 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (store .cse531 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse531) v_arrayElimCell_45) .cse529))))) (let ((.cse528 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse530) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse528 4) 0) (= (select .cse528 .cse529) 0) (= (select .cse530 .cse529) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse35 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_14 Int) (v_arrayElimCell_45 Int)) (let ((.cse534 (+ v_prenex_14 4)) (.cse533 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse532 (store .cse533 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse532 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse532) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse534) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse535 (store .cse533 0 v_prenex_14))) (store .cse535 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse535) v_arrayElimCell_45) .cse534)))) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_45 Int)) (let ((.cse539 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse536 (let ((.cse540 (store .cse539 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse540 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse540) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) (.cse537 (+ v_prenex_14 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse536) |c_ULTIMATE.start_append_~item~0#1.base|) .cse537) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse538 (store .cse539 0 v_prenex_14))) (store .cse538 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse538) v_arrayElimCell_45) .cse537)))) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0) (= (select .cse536 .cse537) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or .cse2 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_25 Int) (v_arrayElimCell_45 Int)) (let ((.cse542 (+ v_prenex_25 4))) (let ((.cse543 (let ((.cse544 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25))) (store .cse544 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse544) v_arrayElimCell_45) .cse542))))) (let ((.cse541 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse543) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= 0 (select .cse541 .cse542)) (= (select .cse543 .cse542) 0) (= (select .cse541 4) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_prenex_22 Int) (v_arrayElimCell_45 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse545 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse545 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse545) v_arrayElimCell_45) (+ v_prenex_23 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_22 4)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_25 Int) (v_arrayElimCell_45 Int)) (let ((.cse547 (+ v_prenex_25 4))) (let ((.cse546 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse548 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25))) (store .cse548 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse548) v_arrayElimCell_45) .cse547)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= 0 (select .cse546 .cse547)) (= (select .cse546 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_25 Int) (v_arrayElimCell_45 Int)) (let ((.cse553 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25)) (.cse550 (+ v_prenex_25 4))) (let ((.cse552 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse553) v_arrayElimCell_45) .cse550))) (let ((.cse551 (store .cse553 4 .cse552))) (let ((.cse549 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse551) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= 0 (select .cse549 .cse550)) (= (select .cse551 .cse550) 0) (= (select .cse549 4) 0) (= .cse552 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_30 Int) (v_prenex_31 Int) (v_arrayElimCell_45 Int)) (let ((.cse554 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_31))) (let ((.cse555 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse554)) (.cse556 (+ v_prenex_31 4)) (.cse557 (+ v_prenex_30 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse554 4 (select (select .cse555 v_arrayElimCell_45) .cse556))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse557) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse554 4 (select (select .cse555 |c_ULTIMATE.start_append_~item~0#1.base|) .cse556))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse557) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_24 Int) (v_arrayElimCell_45 Int)) (= 0 (let ((.cse559 (+ v_prenex_24 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse558 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_24))) (store .cse558 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse558) v_arrayElimCell_45) .cse559)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse559)))))))) (or (forall ((v_prenex_36 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_45 Int)) (let ((.cse561 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse562 (+ v_prenex_21 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse560 (store .cse561 0 v_prenex_36))) (store .cse560 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse560) v_arrayElimCell_45) (+ v_prenex_36 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse562) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse563 (store .cse561 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse563 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse563) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse562) 0)))) .cse2) .cse25 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_arrayElimCell_45 Int)) (let ((.cse565 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse566 (+ v_prenex_17 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse564 (store .cse565 0 v_prenex_18))) (store .cse564 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse564) v_arrayElimCell_45) (+ v_prenex_18 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse566) 0) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse567 (store .cse565 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse567 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse567) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse566))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_45 Int)) (= (let ((.cse569 (+ v_prenex_28 4))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse568 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_28))) (store .cse568 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse568) v_arrayElimCell_45) .cse569)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse569)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_33 Int) (v_prenex_32 Int) (v_arrayElimCell_45 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse570 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_32))) (store .cse570 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse570) v_arrayElimCell_45) (+ v_prenex_32 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_33 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_29 Int) (v_arrayElimCell_45 Int)) (let ((.cse572 (+ v_prenex_29 4))) (let ((.cse571 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse573 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (store .cse573 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse573) v_arrayElimCell_45) .cse572)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse571 4) 0) (= (select .cse571 .cse572) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_29 Int) (v_arrayElimCell_45 Int)) (let ((.cse578 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29)) (.cse576 (+ v_prenex_29 4))) (let ((.cse574 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse578) v_arrayElimCell_45) .cse576))) (let ((.cse577 (store .cse578 4 .cse574))) (let ((.cse575 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse577) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= .cse574 0) (= (select .cse575 4) 0) (= (select .cse575 .cse576) 0) (= (select .cse577 .cse576) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_14 Int) (v_arrayElimCell_45 Int)) (let ((.cse584 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse581 (store .cse584 0 v_prenex_14)) (.cse580 (+ v_prenex_14 4))) (let ((.cse579 (let ((.cse583 (store .cse584 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse583 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse583) |c_ULTIMATE.start_append_~item~0#1.base|) .cse6)))) (.cse582 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse581) v_arrayElimCell_45) .cse580))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse579) |c_ULTIMATE.start_append_~item~0#1.base|) .cse580) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse581 4 .cse582)) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0) (= (select .cse579 .cse580) 0) (= .cse582 0))))))))) .cse28)) .cse27)))))) is different from true