./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:39:26,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:39:26,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:39:26,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:39:26,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:39:26,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:39:26,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:39:26,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:39:26,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:39:26,732 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:39:26,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:39:26,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:39:26,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:39:26,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:39:26,733 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:39:26,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:39:26,734 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:39:26,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:39:26,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:39:26,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:39:26,740 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:39:26,741 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:39:26,741 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:39:26,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:39:26,741 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:39:26,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:39:26,742 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:39:26,742 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:39:26,742 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:39:26,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:39:26,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:39:26,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:39:26,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:39:26,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:39:26,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:39:26,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:39:26,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:39:26,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:39:26,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:39:26,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:39:26,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:39:26,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:39:26,747 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 [2024-11-19 06:39:26,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:39:27,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:39:27,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:39:27,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:39:27,015 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:39:27,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2024-11-19 06:39:28,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:39:28,692 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:39:28,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2024-11-19 06:39:28,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83ccbcce/4f5e8306cc454b71ab8e428445f8b81f/FLAG94c49ce70 [2024-11-19 06:39:29,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83ccbcce/4f5e8306cc454b71ab8e428445f8b81f [2024-11-19 06:39:29,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:39:29,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:39:29,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:39:29,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:39:29,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:39:29,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:39:29" (1/1) ... [2024-11-19 06:39:29,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5170b7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29, skipping insertion in model container [2024-11-19 06:39:29,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:39:29" (1/1) ... [2024-11-19 06:39:29,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:39:29,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:39:29,446 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:39:29,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:39:29,524 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:39:29,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29 WrapperNode [2024-11-19 06:39:29,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:39:29,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:39:29,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:39:29,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:39:29,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29" (1/1) ... [2024-11-19 06:39:29,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29" (1/1) ... [2024-11-19 06:39:29,580 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2024-11-19 06:39:29,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:39:29,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:39:29,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:39:29,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:39:29,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29" (1/1) ... [2024-11-19 06:39:29,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29" (1/1) ... [2024-11-19 06:39:29,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29" (1/1) ... [2024-11-19 06:39:29,628 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 10, 8]. 50 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-19 06:39:29,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29" (1/1) ... [2024-11-19 06:39:29,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29" (1/1) ... [2024-11-19 06:39:29,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29" (1/1) ... [2024-11-19 06:39:29,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29" (1/1) ... [2024-11-19 06:39:29,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29" (1/1) ... [2024-11-19 06:39:29,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29" (1/1) ... [2024-11-19 06:39:29,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:39:29,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:39:29,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:39:29,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:39:29,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29" (1/1) ... [2024-11-19 06:39:29,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:39:29,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:29,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:39:29,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:39:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:39:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:39:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:39:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:39:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:39:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:39:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:39:29,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:39:29,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:39:29,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:39:29,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:39:29,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:39:29,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 06:39:29,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:39:29,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:39:29,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 06:39:29,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:39:29,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:39:29,854 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:39:29,855 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:39:30,238 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-19 06:39:30,238 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:39:30,259 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:39:30,259 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:39:30,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:39:30 BoogieIcfgContainer [2024-11-19 06:39:30,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:39:30,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:39:30,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:39:30,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:39:30,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:39:29" (1/3) ... [2024-11-19 06:39:30,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b88f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:39:30, skipping insertion in model container [2024-11-19 06:39:30,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:29" (2/3) ... [2024-11-19 06:39:30,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b88f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:39:30, skipping insertion in model container [2024-11-19 06:39:30,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:39:30" (3/3) ... [2024-11-19 06:39:30,271 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1-2.i [2024-11-19 06:39:30,285 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:39:30,285 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-19 06:39:30,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:39:30,335 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;@7b9e9a17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:39:30,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-19 06:39:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 45 states have (on average 2.111111111111111) internal successors, (95), 89 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-19 06:39:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:39:30,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:30,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:39:30,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:30,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:30,355 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2024-11-19 06:39:30,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:30,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344632578] [2024-11-19 06:39:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:30,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:30,752 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-19 06:39:30,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:30,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344632578] [2024-11-19 06:39:30,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344632578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:30,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:30,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:39:30,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953871320] [2024-11-19 06:39:30,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:30,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:39:30,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:30,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:39:30,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:39:30,788 INFO L87 Difference]: Start difference. First operand has 90 states, 45 states have (on average 2.111111111111111) internal successors, (95), 89 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) 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-19 06:39:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:30,965 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-19 06:39:30,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:39:30,968 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-19 06:39:30,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:30,978 INFO L225 Difference]: With dead ends: 84 [2024-11-19 06:39:30,978 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 06:39:30,979 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-19 06:39:30,982 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 83 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:30,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 81 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 06:39:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 06:39:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 81 states have internal predecessors, (85), 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-19 06:39:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2024-11-19 06:39:31,011 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 4 [2024-11-19 06:39:31,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:31,012 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-19 06:39:31,012 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-19 06:39:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2024-11-19 06:39:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:39:31,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:31,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:39:31,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:39:31,013 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:31,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:31,014 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2024-11-19 06:39:31,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:31,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316621942] [2024-11-19 06:39:31,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:31,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:31,184 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-19 06:39:31,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:31,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316621942] [2024-11-19 06:39:31,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316621942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:31,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:31,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:39:31,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508667184] [2024-11-19 06:39:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:31,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:39:31,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:31,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:39:31,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:39:31,191 INFO L87 Difference]: Start difference. First operand 82 states and 85 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-19 06:39:31,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:31,369 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-19 06:39:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:39:31,370 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-19 06:39:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:31,372 INFO L225 Difference]: With dead ends: 92 [2024-11-19 06:39:31,372 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 06:39:31,372 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-19 06:39:31,373 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 74 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:31,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 86 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 06:39:31,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2024-11-19 06:39:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.816326530612245) internal successors, (89), 82 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-19 06:39:31,390 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 4 [2024-11-19 06:39:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:31,391 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-19 06:39:31,391 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-19 06:39:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-19 06:39:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:39:31,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:31,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:39:31,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:39:31,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:31,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:31,395 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2024-11-19 06:39:31,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:31,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748328377] [2024-11-19 06:39:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:31,452 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-19 06:39:31,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:31,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748328377] [2024-11-19 06:39:31,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748328377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:31,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:31,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:39:31,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138813601] [2024-11-19 06:39:31,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:31,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:39:31,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:31,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:39:31,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:31,455 INFO L87 Difference]: Start difference. First operand 83 states and 89 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-19 06:39:31,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:31,533 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2024-11-19 06:39:31,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:39:31,534 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-19 06:39:31,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:31,536 INFO L225 Difference]: With dead ends: 79 [2024-11-19 06:39:31,537 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 06:39:31,537 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-19 06:39:31,538 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 11 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:31,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 95 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 06:39:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-19 06:39:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 78 states have internal predecessors, (85), 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-19 06:39:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2024-11-19 06:39:31,546 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 5 [2024-11-19 06:39:31,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:31,547 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-11-19 06:39:31,547 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-19 06:39:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2024-11-19 06:39:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:39:31,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:31,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:39:31,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:39:31,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:31,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:31,549 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2024-11-19 06:39:31,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:31,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241949940] [2024-11-19 06:39:31,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:31,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:31,642 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-19 06:39:31,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:31,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241949940] [2024-11-19 06:39:31,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241949940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:31,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:31,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:39:31,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734762779] [2024-11-19 06:39:31,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:31,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:39:31,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:31,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:39:31,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:31,644 INFO L87 Difference]: Start difference. First operand 79 states and 85 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-19 06:39:31,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:31,707 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-11-19 06:39:31,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:39:31,709 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-19 06:39:31,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:31,710 INFO L225 Difference]: With dead ends: 75 [2024-11-19 06:39:31,710 INFO L226 Difference]: Without dead ends: 75 [2024-11-19 06:39:31,711 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-19 06:39:31,711 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:31,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 101 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-19 06:39:31,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-19 06:39:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2024-11-19 06:39:31,721 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 5 [2024-11-19 06:39:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:31,722 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2024-11-19 06:39:31,722 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-19 06:39:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2024-11-19 06:39:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:39:31,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:31,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:31,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:39:31,723 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:31,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:31,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2024-11-19 06:39:31,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:31,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468125820] [2024-11-19 06:39:31,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:31,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:31,996 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-19 06:39:31,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:31,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468125820] [2024-11-19 06:39:31,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468125820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:31,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:31,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:39:31,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282932463] [2024-11-19 06:39:31,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:31,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:39:31,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:32,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:39:32,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:39:32,000 INFO L87 Difference]: Start difference. First operand 75 states and 81 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-19 06:39:32,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:32,146 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-11-19 06:39:32,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:39:32,147 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-19 06:39:32,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:32,149 INFO L225 Difference]: With dead ends: 84 [2024-11-19 06:39:32,149 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 06:39:32,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:39:32,150 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 18 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:32,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 368 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:32,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 06:39:32,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2024-11-19 06:39:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 80 states have internal predecessors, (87), 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-19 06:39:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2024-11-19 06:39:32,156 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 10 [2024-11-19 06:39:32,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:32,156 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2024-11-19 06:39:32,156 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-19 06:39:32,157 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2024-11-19 06:39:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:39:32,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:32,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:32,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:39:32,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:32,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:32,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1868053176, now seen corresponding path program 1 times [2024-11-19 06:39:32,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:32,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776741204] [2024-11-19 06:39:32,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:32,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:32,334 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-19 06:39:32,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:32,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776741204] [2024-11-19 06:39:32,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776741204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:32,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:32,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:39:32,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202417600] [2024-11-19 06:39:32,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:32,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:39:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:32,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:39:32,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:39:32,338 INFO L87 Difference]: Start difference. First operand 81 states and 87 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-19 06:39:32,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:32,461 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-19 06:39:32,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:39:32,465 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-19 06:39:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:32,465 INFO L225 Difference]: With dead ends: 92 [2024-11-19 06:39:32,465 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 06:39:32,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:39:32,466 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 56 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:32,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 132 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:32,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 06:39:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2024-11-19 06:39:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 79 states have internal predecessors, (86), 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-19 06:39:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-19 06:39:32,475 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 17 [2024-11-19 06:39:32,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:32,475 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-19 06:39:32,475 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-19 06:39:32,475 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-19 06:39:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:39:32,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:32,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:32,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:39:32,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:32,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:32,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1868053177, now seen corresponding path program 1 times [2024-11-19 06:39:32,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:32,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282258608] [2024-11-19 06:39:32,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:32,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:32,741 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-19 06:39:32,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:32,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282258608] [2024-11-19 06:39:32,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282258608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:32,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:32,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:39:32,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412702871] [2024-11-19 06:39:32,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:32,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:39:32,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:32,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:39:32,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:39:32,744 INFO L87 Difference]: Start difference. First operand 80 states and 86 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-19 06:39:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:32,899 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-11-19 06:39:32,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:39:32,899 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-19 06:39:32,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:32,900 INFO L225 Difference]: With dead ends: 92 [2024-11-19 06:39:32,900 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 06:39:32,900 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-19 06:39:32,901 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 58 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:32,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 164 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:32,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 06:39:32,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2024-11-19 06:39:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 78 states have internal predecessors, (85), 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-19 06:39:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2024-11-19 06:39:32,906 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2024-11-19 06:39:32,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:32,907 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-11-19 06:39:32,907 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-19 06:39:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2024-11-19 06:39:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:39:32,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:32,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:32,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:39:32,908 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:32,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:32,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2076126984, now seen corresponding path program 1 times [2024-11-19 06:39:32,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:32,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947824428] [2024-11-19 06:39:32,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:32,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:32,957 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-19 06:39:32,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:32,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947824428] [2024-11-19 06:39:32,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947824428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:32,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:32,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:39:32,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433725510] [2024-11-19 06:39:32,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:32,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:39:32,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:32,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:39:32,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:39:32,960 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-19 06:39:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:32,975 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2024-11-19 06:39:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:39:32,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:39:32,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:32,976 INFO L225 Difference]: With dead ends: 78 [2024-11-19 06:39:32,976 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 06:39:32,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:39:32,977 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:32,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 150 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:39:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 06:39:32,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-19 06:39:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.52) internal successors, (76), 73 states have internal predecessors, (76), 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-19 06:39:32,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2024-11-19 06:39:32,982 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 18 [2024-11-19 06:39:32,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:32,982 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-11-19 06:39:32,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-19 06:39:32,983 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2024-11-19 06:39:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:39:32,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:32,983 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-19 06:39:32,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:39:32,984 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:32,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:32,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1280939784, now seen corresponding path program 1 times [2024-11-19 06:39:32,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:32,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480329151] [2024-11-19 06:39:32,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:32,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:33,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:33,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480329151] [2024-11-19 06:39:33,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480329151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:33,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:33,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:39:33,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860959656] [2024-11-19 06:39:33,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:33,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:39:33,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:33,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:39:33,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:39:33,270 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-19 06:39:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:33,422 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2024-11-19 06:39:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:39:33,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-19 06:39:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:33,423 INFO L225 Difference]: With dead ends: 76 [2024-11-19 06:39:33,423 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 06:39:33,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:39:33,424 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 76 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:33,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 160 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 06:39:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2024-11-19 06:39:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.5) internal successors, (75), 72 states have internal predecessors, (75), 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-19 06:39:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2024-11-19 06:39:33,430 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 20 [2024-11-19 06:39:33,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:33,431 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2024-11-19 06:39:33,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-19 06:39:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2024-11-19 06:39:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:39:33,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:33,432 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-19 06:39:33,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:39:33,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:33,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:33,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1280939783, now seen corresponding path program 1 times [2024-11-19 06:39:33,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:33,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956253784] [2024-11-19 06:39:33,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:33,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:33,508 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-19 06:39:33,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:33,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956253784] [2024-11-19 06:39:33,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956253784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:33,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:33,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:39:33,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383169759] [2024-11-19 06:39:33,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:33,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:39:33,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:33,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:39:33,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:33,510 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-19 06:39:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:33,591 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2024-11-19 06:39:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:39:33,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-19 06:39:33,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:33,593 INFO L225 Difference]: With dead ends: 72 [2024-11-19 06:39:33,593 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 06:39:33,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:39:33,594 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:33,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 164 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 06:39:33,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-19 06:39:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.48) internal successors, (74), 71 states have internal predecessors, (74), 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-19 06:39:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2024-11-19 06:39:33,605 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 20 [2024-11-19 06:39:33,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:33,605 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2024-11-19 06:39:33,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-19 06:39:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2024-11-19 06:39:33,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:39:33,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:33,606 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-19 06:39:33,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:39:33,607 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:33,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:33,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1054427643, now seen corresponding path program 1 times [2024-11-19 06:39:33,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:33,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494619304] [2024-11-19 06:39:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:33,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:33,946 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-19 06:39:33,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:33,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494619304] [2024-11-19 06:39:33,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494619304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:33,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:33,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:39:33,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567519611] [2024-11-19 06:39:33,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:33,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:39:33,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:33,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:39:33,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:39:33,950 INFO L87 Difference]: Start difference. First operand 72 states and 74 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-19 06:39:34,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:34,143 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2024-11-19 06:39:34,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:39:34,144 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-19 06:39:34,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:34,144 INFO L225 Difference]: With dead ends: 112 [2024-11-19 06:39:34,144 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 06:39:34,145 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-19 06:39:34,145 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 42 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:34,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 239 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 06:39:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 85. [2024-11-19 06:39:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-19 06:39:34,149 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 21 [2024-11-19 06:39:34,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:34,149 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-19 06:39:34,149 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-19 06:39:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-19 06:39:34,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:39:34,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:34,150 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-19 06:39:34,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:39:34,150 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:34,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:34,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1672481337, now seen corresponding path program 1 times [2024-11-19 06:39:34,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:34,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780259529] [2024-11-19 06:39:34,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:34,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:34,667 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-19 06:39:34,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:34,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780259529] [2024-11-19 06:39:34,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780259529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:34,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:34,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:39:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021115226] [2024-11-19 06:39:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:34,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:39:34,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:34,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:39:34,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:39:34,669 INFO L87 Difference]: Start difference. First operand 85 states and 88 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-19 06:39:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:34,937 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2024-11-19 06:39:34,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:39:34,938 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-19 06:39:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:34,939 INFO L225 Difference]: With dead ends: 111 [2024-11-19 06:39:34,939 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 06:39:34,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-19 06:39:34,940 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 42 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:34,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 246 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:39:34,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 06:39:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2024-11-19 06:39:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.390625) internal successors, (89), 85 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2024-11-19 06:39:34,943 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 22 [2024-11-19 06:39:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:34,944 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2024-11-19 06:39:34,944 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-19 06:39:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2024-11-19 06:39:34,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:39:34,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:34,945 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:34,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:39:34,945 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:34,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash -428723026, now seen corresponding path program 1 times [2024-11-19 06:39:34,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:34,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775045883] [2024-11-19 06:39:34,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:34,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:35,233 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-19 06:39:35,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:35,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775045883] [2024-11-19 06:39:35,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775045883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:35,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318585233] [2024-11-19 06:39:35,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:35,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:35,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:35,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:39:35,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:39:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:35,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 06:39:35,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:35,460 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-19 06:39:35,517 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-19 06:39:35,517 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-19 06:39:35,542 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-19 06:39:35,573 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-19 06:39:35,605 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-19 06:39:35,609 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-19 06:39:35,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:35,761 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-19 06:39:36,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:36,146 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-19 06:39:36,687 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-19 06:39:36,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318585233] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:36,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:36,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-19 06:39:36,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184408059] [2024-11-19 06:39:36,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:36,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:39:36,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:36,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:39:36,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:39:36,689 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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-19 06:39:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:37,022 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2024-11-19 06:39:37,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:39:37,022 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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-19 06:39:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:37,023 INFO L225 Difference]: With dead ends: 88 [2024-11-19 06:39:37,023 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 06:39:37,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:39:37,024 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 87 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:37,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 271 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:39:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 06:39:37,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-11-19 06:39:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.375) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-19 06:39:37,027 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 22 [2024-11-19 06:39:37,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:37,027 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-19 06:39:37,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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-19 06:39:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-19 06:39:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:39:37,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:37,028 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:37,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:39:37,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 06:39:37,229 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:37,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash -428723025, now seen corresponding path program 1 times [2024-11-19 06:39:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:37,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613488140] [2024-11-19 06:39:37,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:37,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:37,638 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-19 06:39:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:37,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613488140] [2024-11-19 06:39:37,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613488140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:37,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031048779] [2024-11-19 06:39:37,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:37,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:37,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:37,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:39:37,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:39:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:37,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-19 06:39:37,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:37,789 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-19 06:39:37,795 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-19 06:39:37,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:37,873 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-19 06:39:37,881 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:37,882 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-19 06:39:37,941 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-19 06:39:37,946 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-19 06:39:37,986 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 06:39:37,986 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-19 06:39:38,003 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 06:39:38,003 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-19 06:39:38,027 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-19 06:39:38,054 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-19 06:39:38,060 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-19 06:39:38,105 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-19 06:39:38,111 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-19 06:39:38,114 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-19 06:39:38,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:38,321 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-19 06:39:38,336 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-19 06:39:38,340 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-19 06:39:38,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:38,504 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-19 06:39:38,845 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-19 06:39:38,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031048779] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:38,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:38,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-11-19 06:39:38,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209814555] [2024-11-19 06:39:38,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:38,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 06:39:38,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:38,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 06:39:38,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:39:38,848 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 20 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 20 states have internal predecessors, (56), 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-19 06:39:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:39,374 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-19 06:39:39,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:39:39,375 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 20 states have internal predecessors, (56), 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-19 06:39:39,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:39,375 INFO L225 Difference]: With dead ends: 87 [2024-11-19 06:39:39,375 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 06:39:39,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2024-11-19 06:39:39,376 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 76 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:39,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 494 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:39:39,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 06:39:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-19 06:39:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.359375) internal successors, (87), 83 states have internal predecessors, (87), 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-19 06:39:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2024-11-19 06:39:39,380 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 22 [2024-11-19 06:39:39,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:39,381 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2024-11-19 06:39:39,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 20 states have internal predecessors, (56), 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-19 06:39:39,381 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2024-11-19 06:39:39,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 06:39:39,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:39,383 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-19 06:39:39,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:39:39,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-19 06:39:39,588 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:39,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:39,588 INFO L85 PathProgramCache]: Analyzing trace with hash -307313795, now seen corresponding path program 1 times [2024-11-19 06:39:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:39,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033757603] [2024-11-19 06:39:39,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:39,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:39,857 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-19 06:39:39,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:39,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033757603] [2024-11-19 06:39:39,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033757603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:39,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:39,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:39:39,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119280851] [2024-11-19 06:39:39,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:39,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:39:39,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:39,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:39:39,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:39:39,859 INFO L87 Difference]: Start difference. First operand 84 states and 87 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-19 06:39:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:40,077 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2024-11-19 06:39:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:39:40,077 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-19 06:39:40,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:40,078 INFO L225 Difference]: With dead ends: 98 [2024-11-19 06:39:40,078 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 06:39:40,078 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-19 06:39:40,079 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 24 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:40,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 189 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 06:39:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2024-11-19 06:39:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.353846153846154) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-19 06:39:40,082 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 23 [2024-11-19 06:39:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:40,082 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-19 06:39:40,082 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-19 06:39:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-19 06:39:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:39:40,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:40,083 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-19 06:39:40,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:39:40,083 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:40,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash -936792950, now seen corresponding path program 1 times [2024-11-19 06:39:40,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:40,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521624241] [2024-11-19 06:39:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:40,232 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-19 06:39:40,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:40,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521624241] [2024-11-19 06:39:40,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521624241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:40,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:40,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:39:40,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415587895] [2024-11-19 06:39:40,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:40,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:39:40,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:40,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:39:40,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:39:40,234 INFO L87 Difference]: Start difference. First operand 85 states and 88 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-19 06:39:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:40,355 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-19 06:39:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:39:40,356 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-19 06:39:40,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:40,357 INFO L225 Difference]: With dead ends: 84 [2024-11-19 06:39:40,357 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 06:39:40,357 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-19 06:39:40,358 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:40,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 65 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:40,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 06:39:40,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-19 06:39:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 83 states have internal predecessors, (87), 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-19 06:39:40,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2024-11-19 06:39:40,360 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 24 [2024-11-19 06:39:40,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:40,361 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2024-11-19 06:39:40,361 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-19 06:39:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2024-11-19 06:39:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:39:40,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:40,362 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-19 06:39:40,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:39:40,362 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:40,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:40,362 INFO L85 PathProgramCache]: Analyzing trace with hash -936792949, now seen corresponding path program 1 times [2024-11-19 06:39:40,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:40,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768936961] [2024-11-19 06:39:40,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:40,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:40,410 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-19 06:39:40,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:40,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768936961] [2024-11-19 06:39:40,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768936961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:40,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:40,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:39:40,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132543604] [2024-11-19 06:39:40,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:40,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:39:40,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:40,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:39:40,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:39:40,411 INFO L87 Difference]: Start difference. First operand 84 states and 87 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-19 06:39:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:40,451 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2024-11-19 06:39:40,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:39:40,451 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-19 06:39:40,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:40,452 INFO L225 Difference]: With dead ends: 79 [2024-11-19 06:39:40,452 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 06:39:40,452 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-19 06:39:40,453 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 46 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:40,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 40 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:39:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 06:39:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-19 06:39:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-11-19 06:39:40,456 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 24 [2024-11-19 06:39:40,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:40,456 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-11-19 06:39:40,456 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-19 06:39:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-11-19 06:39:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:39:40,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:40,457 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-19 06:39:40,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:39:40,457 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:40,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:40,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1024189665, now seen corresponding path program 1 times [2024-11-19 06:39:40,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:40,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626958612] [2024-11-19 06:39:40,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:40,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:40,557 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-19 06:39:40,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:40,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626958612] [2024-11-19 06:39:40,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626958612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:40,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:40,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:39:40,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833319395] [2024-11-19 06:39:40,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:40,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:39:40,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:40,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:39:40,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:40,559 INFO L87 Difference]: Start difference. First operand 79 states and 82 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-19 06:39:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:40,614 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2024-11-19 06:39:40,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:39:40,614 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-19 06:39:40,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:40,615 INFO L225 Difference]: With dead ends: 78 [2024-11-19 06:39:40,615 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 06:39:40,615 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-19 06:39:40,616 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 26 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:40,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 139 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:39:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 06:39:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-19 06:39:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2024-11-19 06:39:40,618 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 25 [2024-11-19 06:39:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:40,619 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2024-11-19 06:39:40,619 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-19 06:39:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2024-11-19 06:39:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:39:40,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:40,620 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-19 06:39:40,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:39:40,620 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:40,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1685108650, now seen corresponding path program 1 times [2024-11-19 06:39:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:40,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458029532] [2024-11-19 06:39:40,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:40,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:40,744 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-19 06:39:40,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:40,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458029532] [2024-11-19 06:39:40,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458029532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:40,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:40,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:39:40,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80981775] [2024-11-19 06:39:40,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:40,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:39:40,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:40,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:39:40,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:40,747 INFO L87 Difference]: Start difference. First operand 78 states and 81 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-19 06:39:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:40,837 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-11-19 06:39:40,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:39:40,837 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-19 06:39:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:40,838 INFO L225 Difference]: With dead ends: 80 [2024-11-19 06:39:40,838 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 06:39:40,838 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-19 06:39:40,839 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 26 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:40,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 120 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 06:39:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-11-19 06:39:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 76 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2024-11-19 06:39:40,841 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 26 [2024-11-19 06:39:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:40,842 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2024-11-19 06:39:40,842 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-19 06:39:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2024-11-19 06:39:40,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:39:40,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:40,842 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-19 06:39:40,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 06:39:40,843 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:40,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:40,843 INFO L85 PathProgramCache]: Analyzing trace with hash 698760707, now seen corresponding path program 1 times [2024-11-19 06:39:40,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:40,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862199264] [2024-11-19 06:39:40,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:40,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:41,219 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-19 06:39:41,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:41,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862199264] [2024-11-19 06:39:41,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862199264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:41,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:41,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:39:41,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825397028] [2024-11-19 06:39:41,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:41,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:39:41,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:41,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:39:41,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:39:41,223 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 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-19 06:39:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:41,607 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2024-11-19 06:39:41,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:39:41,607 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 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-19 06:39:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:41,608 INFO L225 Difference]: With dead ends: 97 [2024-11-19 06:39:41,608 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 06:39:41,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:39:41,610 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 66 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:41,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 189 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:39:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 06:39:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 81. [2024-11-19 06:39:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 80 states have internal predecessors, (84), 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-19 06:39:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-19 06:39:41,616 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 27 [2024-11-19 06:39:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:41,616 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-19 06:39:41,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 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-19 06:39:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-19 06:39:41,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:39:41,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:41,617 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-19 06:39:41,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 06:39:41,617 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:41,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:41,617 INFO L85 PathProgramCache]: Analyzing trace with hash 186745549, now seen corresponding path program 1 times [2024-11-19 06:39:41,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:41,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22377120] [2024-11-19 06:39:41,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:41,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:41,767 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-19 06:39:41,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:41,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22377120] [2024-11-19 06:39:41,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22377120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:41,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:41,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:39:41,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876236211] [2024-11-19 06:39:41,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:41,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:39:41,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:39:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:39:41,769 INFO L87 Difference]: Start difference. First operand 81 states and 84 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-19 06:39:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:41,861 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-11-19 06:39:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:39:41,861 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-19 06:39:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:41,862 INFO L225 Difference]: With dead ends: 80 [2024-11-19 06:39:41,862 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 06:39:41,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:39:41,863 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 68 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:41,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 88 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:41,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 06:39:41,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 06:39:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-19 06:39:41,866 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 28 [2024-11-19 06:39:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:41,866 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-19 06:39:41,867 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-19 06:39:41,867 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-19 06:39:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:39:41,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:41,867 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] [2024-11-19 06:39:41,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 06:39:41,868 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:41,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:41,868 INFO L85 PathProgramCache]: Analyzing trace with hash -973971529, now seen corresponding path program 1 times [2024-11-19 06:39:41,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:41,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242794279] [2024-11-19 06:39:41,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:41,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:42,775 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-19 06:39:42,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:42,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242794279] [2024-11-19 06:39:42,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242794279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:42,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:42,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 06:39:42,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190056926] [2024-11-19 06:39:42,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:42,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:39:42,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:42,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:39:42,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:39:42,778 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 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-19 06:39:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:43,205 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2024-11-19 06:39:43,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:39:43,206 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 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 32 [2024-11-19 06:39:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:43,207 INFO L225 Difference]: With dead ends: 117 [2024-11-19 06:39:43,207 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 06:39:43,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:39:43,208 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 20 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:43,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 266 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:39:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 06:39:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2024-11-19 06:39:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 91 states have (on average 1.164835164835165) internal successors, (106), 101 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-19 06:39:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2024-11-19 06:39:43,211 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 32 [2024-11-19 06:39:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:43,212 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2024-11-19 06:39:43,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 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-19 06:39:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2024-11-19 06:39:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:39:43,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:43,213 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] [2024-11-19 06:39:43,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 06:39:43,214 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:43,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash -973970341, now seen corresponding path program 1 times [2024-11-19 06:39:43,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:43,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720539389] [2024-11-19 06:39:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:43,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:43,280 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-19 06:39:43,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:43,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720539389] [2024-11-19 06:39:43,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720539389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:43,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:43,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:39:43,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578184578] [2024-11-19 06:39:43,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:43,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:39:43,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:43,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:39:43,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:43,282 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-19 06:39:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:43,296 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2024-11-19 06:39:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:39:43,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2024-11-19 06:39:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:43,297 INFO L225 Difference]: With dead ends: 119 [2024-11-19 06:39:43,297 INFO L226 Difference]: Without dead ends: 103 [2024-11-19 06:39:43,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:43,299 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 14 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:43,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 154 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:39:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-19 06:39:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 86. [2024-11-19 06:39:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 85 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2024-11-19 06:39:43,301 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 32 [2024-11-19 06:39:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:43,302 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2024-11-19 06:39:43,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-19 06:39:43,302 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2024-11-19 06:39:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:39:43,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:43,303 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:43,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 06:39:43,303 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-19 06:39:43,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:43,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1880889347, now seen corresponding path program 1 times [2024-11-19 06:39:43,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:43,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076506188] [2024-11-19 06:39:43,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:43,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:44,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:39:44,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:44,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076506188] [2024-11-19 06:39:44,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076506188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:44,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237180578] [2024-11-19 06:39:44,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:44,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:44,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:44,237 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:39:44,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:39:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:44,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-19 06:39:44,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:44,488 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-19 06:39:44,550 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-19 06:39:44,553 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-19 06:39:44,619 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 06:39:44,619 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-19 06:39:44,737 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-19 06:39:44,755 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-19 06:39:44,911 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 19 treesize of output 11 [2024-11-19 06:39:45,159 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:39:45,165 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:39:45,165 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 50 treesize of output 54 [2024-11-19 06:39:45,321 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:39:45,322 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 66 treesize of output 39 [2024-11-19 06:39:45,329 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:39:45,330 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 61 treesize of output 34 [2024-11-19 06:39:45,805 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:39:45,806 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 40 treesize of output 24 [2024-11-19 06:39:45,813 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:39:45,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:45,816 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 22 treesize of output 13 [2024-11-19 06:39:45,892 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:39:45,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:45,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2024-11-19 06:39:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:45,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:47,424 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-19 06:39:47,425 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 204 treesize of output 194 [2024-11-19 06:39:47,499 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-19 06:39:47,499 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 294 treesize of output 280 [2024-11-19 06:39:47,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:47,526 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 202 treesize of output 200 [2024-11-19 06:39:47,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:47,558 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 206 treesize of output 202 [2024-11-19 06:39:47,577 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-19 06:39:47,606 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-19 06:39:47,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:47,668 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 318 treesize of output 332 [2024-11-19 06:39:48,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:48,459 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 1909 treesize of output 1883 [2024-11-19 06:40:12,985 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse296 (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ 2 |c_ULTIMATE.start_append_~plist#1.offset|))) (.cse276 (< |c_ULTIMATE.start_append_~plist#1.offset| 1)) (.cse12 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 1))) (let ((.cse453 (or .cse276 .cse12)) (.cse454 (or .cse12 .cse296)) (.cse34 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse42 (< |c_ULTIMATE.start_append_~plist#1.offset| 0)) (.cse43 (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse163 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse465 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse465 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse465) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_55) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) (.cse178 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (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_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_arrayElimCell_55 Int)) (let ((.cse463 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse464 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse464 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse464) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_55))) (or (= (select .cse463 .cse2) 0) (= (select .cse463 (+ v_ArrVal_683 4)) 0)))))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) (.cse44 (not .cse34)) (.cse348 (forall ((v_prenex_12 Int) (v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse461 (+ 4 v_arrayElimCell_58))) (let ((.cse460 (let ((.cse462 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse462 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse462) v_prenex_12) .cse461))))) (let ((.cse458 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse460) v_prenex_12)) (.cse459 (+ v_ArrVal_683 4))) (or (= (select .cse458 .cse459) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse460 .cse461) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse458 .cse461) 0) (= (select .cse460 .cse459) 0))))))) (.cse0 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse73 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_58 Int)) (or (forall ((v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse457 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse457 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse457) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_58)) 0)) (< v_arrayElimCell_58 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse77 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_58 Int)) (or (forall ((v_arrayElimCell_46 Int) (v_prenex_19 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse456 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse456 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse456) v_prenex_19) (+ 4 v_arrayElimCell_46))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_58)) 0)) (< v_arrayElimCell_58 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse72 (and .cse453 .cse454))) (let ((.cse162 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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 ((.cse455 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse455 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse455) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse81 (and (or .cse12 .cse34) .cse453 .cse454)) (.cse154 (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 ((.cse452 (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 .cse452 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse452) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse100 (or .cse12 (forall ((v_prenex_23 Int) (v_prenex_22 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (let ((.cse451 (+ 4 v_arrayElimCell_58))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse450 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse450 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse450) v_prenex_23) .cse451)))) v_prenex_22) .cse451)) 0))))) (.cse109 (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse447 (let ((.cse449 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse449 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 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|) (+ 4 v_arrayElimCell_46))))) (.cse448 (+ 4 v_arrayElimCell_58))) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse447) |c_ULTIMATE.start_append_~item~0#1.base|) .cse448) 0) (= (select .cse447 .cse448) 0)))) .cse12)) (.cse93 (or .cse12 (forall ((v_prenex_16 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse443 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse444 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse445 (+ 4 v_arrayElimCell_58))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse442 (store .cse444 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse442 .cse443 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse442) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16) .cse445) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select (let ((.cse446 (store .cse444 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse446 .cse443 (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|) (+ 4 v_arrayElimCell_46)))) .cse445) 0)))))) (.cse94 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_15 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int)) (let ((.cse435 (let ((.cse437 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse437 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse437) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46))))) (.cse436 (+ 4 v_arrayElimCell_58))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse435) v_prenex_15) .cse436) 0) (< v_arrayElimCell_58 0) (= (select .cse435 .cse436) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_arrayElimCell_58 Int)) (or (< v_arrayElimCell_58 0) (forall ((v_arrayElimCell_46 Int)) (let ((.cse439 (+ 4 v_arrayElimCell_58)) (.cse438 (let ((.cse441 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse441 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse441) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))))) (or (= (select .cse438 .cse439) 0) (forall ((v_prenex_15 Int)) (let ((.cse440 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse438) v_prenex_15))) (or (= (select .cse440 (+ v_ArrVal_683 4)) 0) (= (select .cse440 .cse439) 0)))))))))))))))) .cse72)) (.cse98 (or .cse72 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_58 Int) (v_arrayElimCell_46 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse422 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse422 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse422) v_prenex_14) (+ 4 v_arrayElimCell_46))))) v_prenex_14) (+ 4 v_arrayElimCell_58)) 0) (< v_arrayElimCell_58 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_47 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse423 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse423 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse423) v_arrayElimCell_47) (+ 4 v_arrayElimCell_46))))) v_prenex_13) (+ 4 v_arrayElimCell_58)) 0) (< v_arrayElimCell_58 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int)) (let ((.cse424 (let ((.cse426 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse426 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse426) v_prenex_12) (+ 4 v_arrayElimCell_46))))) (.cse425 (+ 4 v_arrayElimCell_58))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse424) v_prenex_12) .cse425) 0) (< v_arrayElimCell_58 0) (= (select .cse424 .cse425) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_arrayElimCell_58 Int)) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_46 Int)) (let ((.cse429 (let ((.cse431 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse431 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse431) v_prenex_12) (+ 4 v_arrayElimCell_46)))))) (let ((.cse428 (+ 4 v_arrayElimCell_58)) (.cse427 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse429) v_prenex_12)) (.cse430 (+ v_ArrVal_683 4))) (or (= (select .cse427 .cse428) 0) (= (select .cse429 .cse430) 0) (= (select .cse429 .cse428) 0) (= (select .cse427 .cse430) 0))))) (< v_arrayElimCell_58 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (forall ((v_arrayElimCell_58 Int)) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_46 Int)) (let ((.cse432 (let ((.cse434 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse434 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse434) v_prenex_12) (+ 4 v_arrayElimCell_46))))) (.cse433 (+ 4 v_arrayElimCell_58))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse432) v_prenex_12) .cse433) 0) (= (select .cse432 (+ v_ArrVal_683 4)) 0) (= (select .cse432 .cse433) 0)))) (< v_arrayElimCell_58 0))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))))) (.cse139 (or (forall ((v_prenex_16 Int) (v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse419 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse420 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse417 (+ 4 v_arrayElimCell_58)) (.cse416 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse421 (store .cse420 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse421 .cse419 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse421) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16))) (or (= (select .cse416 .cse417) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select (let ((.cse418 (store .cse420 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse418 .cse419 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse418) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))) .cse417) 0) (= (select .cse416 (+ v_ArrVal_683 4)) 0))))) .cse12)) (.cse101 (or (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= 0 (let ((.cse415 (+ 4 v_arrayElimCell_58))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse414 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse414 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse414) v_prenex_21) .cse415)))) v_prenex_21) .cse415))))) .cse12)) (.cse102 (or (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse412 (+ 4 v_arrayElimCell_58))) (let ((.cse411 (let ((.cse413 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse413 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse413) v_prenex_20) .cse412))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse411) v_prenex_20) .cse412) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse411 .cse412) 0))))) .cse12)) (.cse110 (or .cse72 (and .cse73 .cse77))) (.cse103 (or .cse12 (forall ((v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse409 (+ 4 v_arrayElimCell_58))) (let ((.cse408 (let ((.cse410 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse410 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse410) v_prenex_20) .cse409))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse408) v_prenex_20) .cse409) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse408 (+ v_ArrVal_683 4)) 0) (< v_arrayElimCell_58 0) (= (select .cse408 .cse409) 0))))))) (.cse104 (or (forall ((v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse404 (+ 4 v_arrayElimCell_58))) (let ((.cse406 (let ((.cse407 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse407 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse407) v_prenex_20) .cse404))))) (let ((.cse403 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse406) v_prenex_20)) (.cse405 (+ v_ArrVal_683 4))) (or (= (select .cse403 .cse404) 0) (= (select .cse403 .cse405) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse406 .cse405) 0) (< v_arrayElimCell_58 0) (= (select .cse406 .cse404) 0)))))) .cse12)) (.cse105 (or .cse0 (forall ((v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse400 (let ((.cse402 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse402 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse402) v_prenex_20) (+ 4 v_arrayElimCell_58))))) (.cse401 (+ v_ArrVal_683 4))) (or (< v_ArrVal_683 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse400) v_prenex_20) .cse401) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse400 .cse401) 0) (< v_arrayElimCell_58 0)))))) (.cse78 (or (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_19 Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (let ((.cse399 (+ 4 v_arrayElimCell_58))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse398 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse398 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse398) v_prenex_19) .cse399)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse399)) 0))) .cse72)) (.cse203 (and (or .cse276 .cse0) (or (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ |c_ULTIMATE.start_append_~plist#1.offset| 1)) .cse0))) (.cse62 (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= 0 (let ((.cse397 (+ 4 v_arrayElimCell_58))) (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_arrayElimCell_58))) (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|) .cse397)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse397))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0)))) (.cse106 (or (forall ((v_ArrVal_683 Int) (v_prenex_24 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (let ((.cse395 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse395 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse395) v_prenex_24) (+ 4 v_arrayElimCell_58)))) (+ v_ArrVal_683 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0))) .cse0)) (.cse107 (or (forall ((v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse393 (+ 4 v_arrayElimCell_58))) (let ((.cse392 (+ v_ArrVal_683 4)) (.cse391 (let ((.cse394 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse394 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse394) v_prenex_20) .cse393))))) (or (< v_ArrVal_683 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse391) v_prenex_20) .cse392) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse391 .cse392) 0) (< v_arrayElimCell_58 0) (= (select .cse391 .cse393) 0))))) .cse0)) (.cse108 (or (forall ((v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse388 (+ 4 v_arrayElimCell_58))) (let ((.cse389 (let ((.cse390 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse390 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse390) v_prenex_20) .cse388))))) (let ((.cse387 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse389) v_prenex_20))) (or (< v_ArrVal_683 0) (= (select .cse387 .cse388) 0) (= (select .cse387 (+ v_ArrVal_683 4)) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse389 .cse388) 0)))))) .cse0)) (.cse36 (or (forall ((v_prenex_16 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse383 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse385 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse384 (+ 4 v_arrayElimCell_58))) (or (= (select (let ((.cse382 (store .cse385 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse382 .cse383 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse382) |c_ULTIMATE.start_append_~item~0#1.base|) .cse384))) .cse384) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse386 (store .cse385 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse386 .cse383 (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|) .cse2)))) v_prenex_16) .cse384) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0)))) .cse12)) (.cse60 (or .cse0 (forall ((v_prenex_12 Int) (v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse380 (+ 4 v_arrayElimCell_58))) (let ((.cse378 (let ((.cse381 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse381 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse381) v_prenex_12) .cse380)))) (.cse379 (+ v_ArrVal_683 4))) (or (< v_ArrVal_683 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse378) v_prenex_12) .cse379) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse378 .cse380) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse378 .cse379) 0))))))) (.cse61 (or .cse348 .cse12 .cse296)) (.cse70 (or .cse72 (forall ((v_prenex_13 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_47 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (let ((.cse377 (+ 4 v_arrayElimCell_58))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse376 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse376 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse376) v_arrayElimCell_47) .cse377)))) v_prenex_13) .cse377)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0))))) (.cse71 (or (forall ((v_prenex_12 Int) (v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse374 (+ 4 v_arrayElimCell_58))) (let ((.cse373 (let ((.cse375 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse375 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse375) v_prenex_12) .cse374))))) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse373 .cse374) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse373) v_prenex_12) .cse374) 0) (= (select .cse373 (+ v_ArrVal_683 4)) 0))))) .cse72)) (.cse80 (or .cse12 (forall ((v_prenex_16 Int) (v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse368 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse370 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse369 (+ 4 v_arrayElimCell_58)) (.cse371 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse372 (store .cse370 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse372 .cse368 (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|) .cse2)))) v_prenex_16))) (or (= (select (let ((.cse367 (store .cse370 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse367 .cse368 (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|) .cse369))) .cse369) 0) (= (select .cse371 .cse369) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse371 (+ v_ArrVal_683 4)) 0))))))) (.cse95 (or (forall ((v_prenex_12 Int) (v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse364 (let ((.cse366 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse366 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse366) v_prenex_12) (+ 4 v_arrayElimCell_58))))) (.cse365 (+ v_ArrVal_683 4))) (or (< v_ArrVal_683 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse364) v_prenex_12) .cse365) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse364 .cse365) 0)))) .cse0)) (.cse96 (or (forall ((v_prenex_12 Int) (v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse362 (+ 4 v_arrayElimCell_58))) (let ((.cse361 (let ((.cse363 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse363 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse363) v_prenex_12) .cse362))))) (let ((.cse360 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse361) v_prenex_12))) (or (< v_ArrVal_683 0) (= (select .cse360 (+ v_ArrVal_683 4)) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse361 .cse362) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse360 .cse362) 0)))))) .cse0)) (.cse97 (or (forall ((v_prenex_17 Int) (v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< v_ArrVal_683 0) (= (select (let ((.cse359 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse359 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse359) v_prenex_17) (+ 4 v_arrayElimCell_58)))) (+ v_ArrVal_683 4)) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0))) .cse0)) (.cse99 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_15 Int) (v_arrayElimCell_58 Int)) (let ((.cse353 (+ 4 v_arrayElimCell_58))) (let ((.cse352 (let ((.cse354 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse354 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 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|) .cse353))))) (or (= (select .cse352 .cse353) 0) (< v_arrayElimCell_58 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse352) v_prenex_15) .cse353) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_arrayElimCell_58 Int)) (let ((.cse356 (+ 4 v_arrayElimCell_58))) (let ((.cse355 (let ((.cse358 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse358 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse358) |c_ULTIMATE.start_append_~item~0#1.base|) .cse356))))) (or (= (select .cse355 .cse356) 0) (forall ((v_prenex_15 Int)) (let ((.cse357 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse355) v_prenex_15))) (or (= (select .cse357 (+ v_ArrVal_683 4)) 0) (= (select .cse357 .cse356) 0)))) (< v_arrayElimCell_58 0)))))))))))) .cse72)) (.cse111 (or (forall ((v_prenex_12 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse350 (+ 4 v_arrayElimCell_58))) (let ((.cse349 (let ((.cse351 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse351 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse351) v_prenex_12) .cse350))))) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse349 .cse350) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse349) v_prenex_12) .cse350) 0))))) .cse72)) (.cse112 (or .cse348 .cse276 .cse12)) (.cse140 (or .cse72 (forall ((v_prenex_14 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (let ((.cse347 (+ 4 v_arrayElimCell_58))) (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|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse346 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse346) v_prenex_14) .cse347)))) v_prenex_14) .cse347)) 0))))) (.cse90 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (forall ((v_arrayElimCell_58 Int) (v_prenex_20 Int)) (let ((.cse344 (+ 4 v_arrayElimCell_58))) (let ((.cse343 (+ v_ArrVal_683 4)) (.cse342 (let ((.cse345 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse345 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse345) v_prenex_20) .cse344))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse342) v_prenex_20) .cse343) 0) (= (select .cse342 .cse343) 0) (= (select .cse342 .cse344) 0))))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse88 (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= 0 (let ((.cse341 (+ 4 v_arrayElimCell_58))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse340 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_58))) (store .cse340 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse340) |c_ULTIMATE.start_append_~item~0#1.base|) .cse341)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse341))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse91 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_prenex_24 Int) (v_arrayElimCell_58 Int)) (= (select (let ((.cse339 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse339 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse339) v_prenex_24) (+ 4 v_arrayElimCell_58)))) (+ v_ArrVal_683 4)) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse85 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (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_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_prenex_17 Int) (v_arrayElimCell_58 Int)) (= (select (let ((.cse338 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse338 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse338) v_prenex_17) (+ 4 v_arrayElimCell_58)))) (+ v_ArrVal_683 4)) 0)))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) (.cse86 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (forall ((v_prenex_12 Int) (v_arrayElimCell_58 Int)) (let ((.cse336 (+ 4 v_arrayElimCell_58))) (let ((.cse335 (let ((.cse337 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse337 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse337) v_prenex_12) .cse336))))) (let ((.cse334 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse335) v_prenex_12))) (or (= (select .cse334 (+ v_ArrVal_683 4)) 0) (= (select .cse335 .cse336) 0) (= (select .cse334 .cse336) 0)))))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683)))))))) (.cse87 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (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_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (forall ((v_prenex_12 Int) (v_arrayElimCell_58 Int)) (let ((.cse331 (let ((.cse333 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse333 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse333) v_prenex_12) (+ 4 v_arrayElimCell_58))))) (.cse332 (+ v_ArrVal_683 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse331) v_prenex_12) .cse332) 0) (= (select .cse331 .cse332) 0)))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) (.cse89 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_prenex_12 Int) (v_arrayElimCell_58 Int)) (let ((.cse329 (+ 4 v_arrayElimCell_58))) (let ((.cse327 (let ((.cse330 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse330 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse330) v_prenex_12) .cse329)))) (.cse328 (+ v_ArrVal_683 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse327) v_prenex_12) .cse328) 0) (= (select .cse327 .cse329) 0) (= (select .cse327 .cse328) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse92 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (forall ((v_arrayElimCell_58 Int) (v_prenex_20 Int)) (let ((.cse324 (let ((.cse326 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse326 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse326) v_prenex_20) (+ 4 v_arrayElimCell_58))))) (.cse325 (+ v_ArrVal_683 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse324) v_prenex_20) .cse325) 0) (= (select .cse324 .cse325) 0)))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse33 (< |c_ULTIMATE.start_append_~item~0#1.offset| 0)) (.cse234 (or .cse42 .cse43 (and .cse163 .cse178) .cse44)) (.cse35 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|))) (and (or (and (or .cse0 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_prenex_20 Int)) (let ((.cse1 (let ((.cse4 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse4 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse4) v_prenex_20) .cse2))))) (let ((.cse3 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse1) v_prenex_20))) (or (= (select .cse1 .cse2) 0) (= (select .cse3 (+ v_ArrVal_683 4)) 0) (= (select .cse3 .cse2) 0))))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (forall ((v_prenex_20 Int)) (let ((.cse5 (let ((.cse7 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse7 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse7) v_prenex_20) .cse2)))) (.cse6 (+ v_ArrVal_683 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse5) v_prenex_20) .cse6) 0) (= (select .cse5 .cse6) 0)))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_prenex_20 Int)) (let ((.cse8 (let ((.cse10 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse10 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse10) v_prenex_20) .cse2)))) (.cse9 (+ v_ArrVal_683 4))) (or (= (select .cse8 .cse2) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse8) v_prenex_20) .cse9) 0) (= (select .cse8 .cse9) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_prenex_24 Int)) (= (select (let ((.cse11 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse11 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse11) v_prenex_24) .cse2))) (+ v_ArrVal_683 4)) 0)))))))))) (or (and (or .cse12 (forall ((v_ArrVal_683 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse13 (let ((.cse14 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse14 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse14) v_prenex_20) .cse2))))) (or (= (select .cse13 .cse2) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse13 (+ v_ArrVal_683 4)) 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| .cse13) v_prenex_20) .cse2) 0))))) (or .cse12 (forall ((v_prenex_23 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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 ((.cse15 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse15 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse15) v_prenex_23) .cse2)))) v_prenex_22) .cse2) 0)))) (or (forall ((v_ArrVal_683 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse16 (let ((.cse18 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse18 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse18) v_prenex_20) .cse2))))) (let ((.cse17 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse16) v_prenex_20))) (or (< v_ArrVal_683 0) (= (select .cse16 .cse2) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (= (select .cse17 (+ v_ArrVal_683 4)) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse17 .cse2) 0))))) .cse0) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse19 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse19 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse19) v_prenex_21) .cse2)))) v_prenex_21) .cse2) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse12) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse20 (let ((.cse21 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse21 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse21) v_prenex_20) .cse2))))) (or (= (select .cse20 .cse2) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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| .cse20) v_prenex_20) .cse2) 0)))) .cse12) (or (forall ((v_ArrVal_683 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse22 (let ((.cse24 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse24 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse24) v_prenex_20) .cse2)))) (.cse23 (+ v_ArrVal_683 4))) (or (< v_ArrVal_683 0) (= (select .cse22 .cse2) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse22) v_prenex_20) .cse23) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse22 .cse23) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse0) (or (forall ((v_ArrVal_683 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse25 (let ((.cse28 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse28 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse28) v_prenex_20) .cse2))))) (let ((.cse27 (+ v_ArrVal_683 4)) (.cse26 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse25) v_prenex_20))) (or (= (select .cse25 .cse2) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (= (select .cse26 .cse27) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse25 .cse27) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse26 .cse2) 0))))) .cse12) (or .cse0 (forall ((v_ArrVal_683 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse29 (let ((.cse31 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse31 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse31) v_prenex_20) .cse2)))) (.cse30 (+ v_ArrVal_683 4))) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse29) v_prenex_20) .cse30) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse29 .cse30) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or (forall ((v_ArrVal_683 Int) (v_prenex_24 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (let ((.cse32 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse32 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse32) v_prenex_24) .cse2))) (+ v_ArrVal_683 4)) 0))) .cse0)) .cse33)) .cse34) (or .cse35 (let ((.cse79 (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse151 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse151 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse151) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_58)) 0)))) (.cse45 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (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_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_arrayElimCell_58 Int)) (or (forall ((v_arrayElimCell_55 Int)) (let ((.cse149 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse150 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse150 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse150) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_55))) (or (= (select .cse149 (+ v_ArrVal_683 4)) 0) (= (select .cse149 (+ 4 v_arrayElimCell_58)) 0)))) (< v_arrayElimCell_58 0))))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) (.cse46 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_58 Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse148 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse148 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse148) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_55) (+ 4 v_arrayElimCell_58)) 0) (< v_arrayElimCell_58 0))))))))) (and .cse36 (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse38 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse39 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse40 (+ 4 v_arrayElimCell_58))) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select (let ((.cse37 (store .cse39 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse37 .cse38 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse37) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))) .cse40) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse41 (store .cse39 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse41 .cse38 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse41) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse40) 0)))) .cse12) (or .cse42 .cse43 .cse44 (and .cse45 .cse46)) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_prenex_22 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int)) (or (= (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|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse47 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse47) v_prenex_23) (+ 4 v_arrayElimCell_46))))) v_prenex_22) (+ 4 v_arrayElimCell_58)) 0) (< v_arrayElimCell_58 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (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_58 Int) (v_arrayElimCell_46 Int) (v_prenex_21 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse48 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse48 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse48) v_prenex_21) (+ 4 v_arrayElimCell_46))))) v_prenex_21) (+ 4 v_arrayElimCell_58)) 0) (< v_arrayElimCell_58 0))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_arrayElimCell_58 Int)) (or (< v_arrayElimCell_58 0) (forall ((v_arrayElimCell_46 Int) (v_prenex_20 Int)) (let ((.cse51 (let ((.cse53 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse53 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse53) v_prenex_20) (+ 4 v_arrayElimCell_46)))))) (let ((.cse50 (+ v_ArrVal_683 4)) (.cse49 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse51) v_prenex_20)) (.cse52 (+ 4 v_arrayElimCell_58))) (or (= (select .cse49 .cse50) 0) (= (select .cse51 .cse50) 0) (= (select .cse49 .cse52) 0) (= (select .cse51 .cse52) 0))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (forall ((v_arrayElimCell_58 Int)) (or (forall ((v_arrayElimCell_46 Int) (v_prenex_20 Int)) (let ((.cse54 (let ((.cse56 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse56 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse56) v_prenex_20) (+ 4 v_arrayElimCell_46))))) (.cse55 (+ 4 v_arrayElimCell_58))) (or (= (select .cse54 (+ v_ArrVal_683 4)) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse54) v_prenex_20) .cse55) 0) (= (select .cse54 .cse55) 0)))) (< v_arrayElimCell_58 0))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_58 Int) (v_arrayElimCell_46 Int) (v_prenex_20 Int)) (let ((.cse57 (let ((.cse59 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse59 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse59) v_prenex_20) (+ 4 v_arrayElimCell_46))))) (.cse58 (+ 4 v_arrayElimCell_58))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse57) v_prenex_20) .cse58) 0) (< v_arrayElimCell_58 0) (= (select .cse57 .cse58) 0))))))))) .cse12 .cse34) .cse60 .cse61 (or .cse0 .cse62) (or .cse12 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_arrayElimCell_58 Int)) (let ((.cse64 (+ 4 v_arrayElimCell_58))) (let ((.cse63 (let ((.cse65 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse65 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse65) |c_ULTIMATE.start_append_~item~0#1.base|) .cse64))))) (or (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse63) v_prenex_18) .cse64)) (= (select .cse63 .cse64) 0) (< v_arrayElimCell_58 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_arrayElimCell_58 Int)) (let ((.cse67 (+ 4 v_arrayElimCell_58))) (let ((.cse66 (let ((.cse69 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse69 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse69) |c_ULTIMATE.start_append_~item~0#1.base|) .cse67))))) (or (= (select .cse66 .cse67) 0) (< v_arrayElimCell_58 0) (forall ((v_prenex_18 Int)) (let ((.cse68 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse66) v_prenex_18))) (or (= 0 (select .cse68 .cse67)) (= (select .cse68 (+ v_ArrVal_683 4)) 0))))))))))))))) .cse34) .cse70 .cse71 (or .cse72 (and .cse73 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (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_58 Int)) (or (forall ((v_arrayElimCell_46 Int)) (let ((.cse74 (let ((.cse76 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse76 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse76) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46))))) (.cse75 (+ 4 v_arrayElimCell_58))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse74) |c_ULTIMATE.start_append_~item~0#1.base|) .cse75) 0) (= (select .cse74 .cse75) 0)))) (< v_arrayElimCell_58 0))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) .cse77)) .cse78 (or .cse72 .cse79) .cse80 (or .cse81 (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse83 (+ 4 v_arrayElimCell_58))) (let ((.cse82 (let ((.cse84 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse84 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse84) |c_ULTIMATE.start_append_~item~0#1.base|) .cse83))))) (or (= (select .cse82 .cse83) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse82) |c_ULTIMATE.start_append_~item~0#1.base|) .cse83) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0)))))) (or (and .cse85 .cse86 .cse87 .cse88 .cse89 (or (and .cse90 .cse91 .cse92) .cse34)) .cse0) .cse93 .cse94 .cse95 .cse96 (or .cse42 .cse43 .cse44 .cse79) .cse97 .cse98 .cse99 (or (and .cse100 .cse101 .cse102 .cse103 .cse104 .cse105 .cse106 .cse107 .cse108) .cse34) (or (and .cse109 .cse110) .cse34) .cse111 .cse112 (or .cse42 .cse43 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_58 Int)) (or (< v_arrayElimCell_58 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse113 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse113 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 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|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_58)) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_16 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int)) (let ((.cse115 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse116 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse117 (+ 4 v_arrayElimCell_58))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse114 (store .cse116 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse114 .cse115 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse114) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16) .cse117) 0) (< v_arrayElimCell_58 0) (= (select (let ((.cse118 (store .cse116 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse118 .cse115 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse118) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))) .cse117) 0)))))))) .cse45 .cse46 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (forall ((v_prenex_16 Int)) (let ((.cse122 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse123 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse119 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse124 (store .cse123 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse124 .cse122 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse124) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16))) (or (forall ((v_arrayElimCell_58 Int)) (let ((.cse120 (+ 4 v_arrayElimCell_58))) (or (= (select .cse119 .cse120) 0) (forall ((v_arrayElimCell_46 Int)) (= (select (let ((.cse121 (store .cse123 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse121 .cse122 (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|) (+ 4 v_arrayElimCell_46)))) .cse120) 0)) (< v_arrayElimCell_58 0)))) (= (select .cse119 (+ v_ArrVal_683 4)) 0))))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_58 Int)) (let ((.cse128 (+ 4 v_arrayElimCell_58)) (.cse126 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse127 (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 ((.cse125 (store .cse127 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse125 .cse126 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse125) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16) .cse128) 0) (< v_arrayElimCell_58 0) (forall ((v_arrayElimCell_46 Int)) (let ((.cse129 (let ((.cse130 (store .cse127 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse130 .cse126 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse130) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))))) (or (= (select .cse129 (+ v_ArrVal_683 4)) 0) (= (select .cse129 .cse128) 0))))))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (forall ((v_prenex_16 Int)) (let ((.cse136 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse137 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse131 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse138 (store .cse137 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse138 .cse136 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse138) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16)) (.cse134 (+ v_ArrVal_683 4))) (or (forall ((v_arrayElimCell_58 Int)) (let ((.cse132 (+ 4 v_arrayElimCell_58))) (or (= (select .cse131 .cse132) 0) (< v_arrayElimCell_58 0) (forall ((v_arrayElimCell_46 Int)) (let ((.cse133 (let ((.cse135 (store .cse137 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse135 .cse136 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse135) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))))) (or (= (select .cse133 .cse134) 0) (= (select .cse133 .cse132) 0))))))) (= (select .cse131 .cse134) 0))))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse44) .cse139 .cse140 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_18 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int)) (let ((.cse141 (let ((.cse143 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse143 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse143) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46))))) (.cse142 (+ 4 v_arrayElimCell_58))) (or (< v_arrayElimCell_58 0) (= (select .cse141 .cse142) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse141) v_prenex_18) .cse142) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_arrayElimCell_58 Int)) (or (< v_arrayElimCell_58 0) (forall ((v_arrayElimCell_46 Int)) (let ((.cse146 (let ((.cse147 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse147 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse147) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46))))) (.cse145 (+ 4 v_arrayElimCell_58))) (or (forall ((v_prenex_18 Int)) (let ((.cse144 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse146) v_prenex_18))) (or (= (select .cse144 (+ v_ArrVal_683 4)) 0) (= (select .cse144 .cse145) 0)))) (= (select .cse146 .cse145) 0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse12 .cse34)))) (or .cse12 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse152 (let ((.cse153 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse153 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 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|) .cse2))))) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse152 .cse2) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse152) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse33) (or .cse42 (and (<= (+ |c_ULTIMATE.start_append_~item~0#1.offset| 1) 0) (not .cse35)) .cse43 (and .cse154 (or .cse35 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int)) (let ((.cse159 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse160 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse155 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse161 (store .cse160 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse161 .cse159 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse161) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16))) (or (= (select .cse155 .cse2) 0) (forall ((v_ArrVal_683 Int)) (let ((.cse156 (+ v_ArrVal_683 4))) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (= (select .cse155 .cse156) 0) (forall ((v_arrayElimCell_46 Int)) (let ((.cse157 (let ((.cse158 (store .cse160 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse158 .cse159 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse158) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))))) (or (= (select .cse157 .cse2) 0) (= (select .cse157 .cse156) 0))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse162 .cse163 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse166 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse167 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (forall ((v_prenex_16 Int) (v_ArrVal_683 Int)) (let ((.cse164 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse165 (store .cse167 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse165 .cse166 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse165) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16))) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (= (select .cse164 .cse2) 0) (= (select .cse164 (+ v_ArrVal_683 4)) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_46 Int)) (= (select (let ((.cse168 (store .cse167 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse168 .cse166 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse168) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))) .cse2) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse170 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse171 (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 ((.cse169 (store .cse171 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse169 .cse170 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse169) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16) .cse2) 0) (forall ((v_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_arrayElimCell_46 Int)) (let ((.cse172 (let ((.cse173 (store .cse171 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse173 .cse170 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse173) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))))) (or (= (select .cse172 .cse2) 0) (= (select .cse172 (+ v_ArrVal_683 4)) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse175 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse176 (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 ((.cse174 (store .cse176 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse174 .cse175 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse174) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_46 Int)) (= (select (let ((.cse177 (store .cse176 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse177 .cse175 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse177) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))) .cse2) 0))))))) .cse178)) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse180 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse181 (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 ((.cse179 (store .cse181 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse179 .cse180 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse179) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_arrayElimCell_46 Int)) (let ((.cse182 (let ((.cse183 (store .cse181 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse183 .cse180 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse183) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))))) (or (= (select .cse182 .cse2) 0) (= (select .cse182 (+ v_ArrVal_683 4)) 0))))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (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_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_arrayElimCell_55 Int)) (let ((.cse184 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse185 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse185 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse185) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_55))) (or (= (select .cse184 .cse2) 0) (= (select .cse184 (+ v_ArrVal_683 4)) 0)))))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 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 ((.cse186 (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 .cse186 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse186) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_55) .cse2) 0))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (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_16 Int)) (let ((.cse191 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse192 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse187 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse193 (store .cse192 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse193 .cse191 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse193) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16))) (or (forall ((v_ArrVal_683 Int)) (let ((.cse188 (+ v_ArrVal_683 4))) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (= (select .cse187 .cse188) 0) (forall ((v_arrayElimCell_46 Int)) (let ((.cse189 (let ((.cse190 (store .cse192 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse190 .cse191 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse190) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))))) (or (= (select .cse189 .cse2) 0) (= (select .cse189 .cse188) 0))))))) (= (select .cse187 .cse2) 0))))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((v_prenex_16 Int) (v_arrayElimCell_46 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|))) (or (= (select (let ((.cse194 (store .cse195 0 v_arrayElimCell_46))) (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|) (+ 4 v_arrayElimCell_46)))) .cse2) 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 ((.cse196 (store .cse195 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse196 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse196) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16) .cse2) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse199 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse200 (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)) (forall ((v_prenex_16 Int) (v_ArrVal_683 Int)) (let ((.cse197 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse198 (store .cse200 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse198 .cse199 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse198) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16))) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (= (select .cse197 .cse2) 0) (= (select .cse197 (+ v_ArrVal_683 4)) 0)))) (forall ((v_arrayElimCell_46 Int)) (= (select (let ((.cse201 (store .cse200 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse201 .cse199 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse201) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))) .cse2) 0)))))))) .cse35)) .cse44) (or (and (or .cse72 (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 ((.cse202 (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 .cse202 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse202) v_prenex_19) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse154 .cse203) (or (and .cse162 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (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 ((.cse204 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse204 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse204) v_prenex_19) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) .cse72)) .cse33) (or (and (or (and (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_18 Int) (v_arrayElimCell_46 Int)) (let ((.cse205 (let ((.cse206 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse206 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (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|) (+ 4 v_arrayElimCell_46)))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse205) v_prenex_18) .cse2) 0) (= (select .cse205 .cse2) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_arrayElimCell_46 Int)) (let ((.cse207 (let ((.cse209 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse209 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse209) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))))) (or (= (select .cse207 .cse2) 0) (forall ((v_prenex_18 Int)) (let ((.cse208 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse207) v_prenex_18))) (or (= (select .cse208 .cse2) 0) (= (select .cse208 (+ v_ArrVal_683 4)) 0)))))))))))))) .cse12 .cse34) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse211 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse212 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (let ((.cse210 (store .cse212 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse210 .cse211 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse210) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))) .cse2) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse213 (store .cse212 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse213 .cse211 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse213) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse12) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (forall ((v_arrayElimCell_46 Int)) (let ((.cse214 (let ((.cse216 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse216 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 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|) (+ 4 v_arrayElimCell_46)))))) (or (= (select .cse214 .cse2) 0) (forall ((v_prenex_15 Int)) (let ((.cse215 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse214) v_prenex_15))) (or (= (select .cse215 (+ v_ArrVal_683 4)) 0) (= (select .cse215 .cse2) 0))))))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_15 Int) (v_arrayElimCell_46 Int)) (let ((.cse217 (let ((.cse218 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse218 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse218) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))))) (or (= (select .cse217 .cse2) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse217) v_prenex_15) .cse2) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse72) (or (forall ((v_prenex_16 Int) (v_ArrVal_683 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse220 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse221 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse222 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse223 (store .cse221 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse223 .cse220 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse223) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_prenex_16))) (or (= (select (let ((.cse219 (store .cse221 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse219 .cse220 (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|) (+ 4 v_arrayElimCell_46)))) .cse2) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse222 .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse222 (+ v_ArrVal_683 4)) 0))))) .cse12) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_46 Int)) (let ((.cse225 (let ((.cse227 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse227 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse227) v_prenex_12) (+ 4 v_arrayElimCell_46)))))) (let ((.cse224 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse225) v_prenex_12)) (.cse226 (+ v_ArrVal_683 4))) (or (= (select .cse224 .cse2) 0) (= (select .cse225 .cse226) 0) (= (select .cse225 .cse2) 0) (= (select .cse224 .cse226) 0))))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_46 Int)) (let ((.cse228 (let ((.cse229 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse229 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse229) v_prenex_12) (+ 4 v_arrayElimCell_46)))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse228) v_prenex_12) .cse2) 0) (= (select .cse228 .cse2) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_prenex_12 Int) (v_arrayElimCell_46 Int)) (let ((.cse230 (let ((.cse231 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse231 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse231) v_prenex_12) (+ 4 v_arrayElimCell_46)))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse230) v_prenex_12) .cse2) 0) (= (select .cse230 (+ v_ArrVal_683 4)) 0) (= (select .cse230 .cse2) 0)))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_46 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse232 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse232 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse232) v_prenex_14) (+ 4 v_arrayElimCell_46))))) v_prenex_14) .cse2) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse233 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse233 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse233) v_arrayElimCell_47) (+ 4 v_arrayElimCell_46))))) v_prenex_13) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) .cse72) .cse234) .cse35) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_arrayElimCell_46 Int) (v_prenex_20 Int)) (let ((.cse235 (let ((.cse236 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse236 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse236) v_prenex_20) (+ 4 v_arrayElimCell_46)))))) (or (= (select .cse235 (+ v_ArrVal_683 4)) 0) (= (select .cse235 .cse2) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse235) v_prenex_20) .cse2) 0)))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_46 Int) (v_prenex_20 Int)) (let ((.cse237 (let ((.cse238 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse238 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse238) v_prenex_20) (+ 4 v_arrayElimCell_46)))))) (or (= (select .cse237 .cse2) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse237) v_prenex_20) .cse2) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_arrayElimCell_46 Int) (v_prenex_20 Int)) (let ((.cse241 (let ((.cse242 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse242 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse242) v_prenex_20) (+ 4 v_arrayElimCell_46)))))) (let ((.cse240 (+ v_ArrVal_683 4)) (.cse239 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse241) v_prenex_20))) (or (= (select .cse239 .cse240) 0) (= (select .cse241 .cse240) 0) (= (select .cse241 .cse2) 0) (= (select .cse239 .cse2) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_46 Int) (v_prenex_21 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse243 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse243 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse243) v_prenex_21) (+ 4 v_arrayElimCell_46))))) v_prenex_21) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_prenex_22 Int) (v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse244 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse244 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse244) v_prenex_23) (+ 4 v_arrayElimCell_46))))) v_prenex_22) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse12 .cse34) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_46 Int) (v_prenex_19 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse245 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse245 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse245) v_prenex_19) (+ 4 v_arrayElimCell_46))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse246 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse246 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse246) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse72) (or .cse81 (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse247 (let ((.cse248 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse248 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse248) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse247) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0) (= (select .cse247 .cse2) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse33) (or .cse154 .cse35 .cse0) (or (and .cse100 .cse109 (or (and (or (forall ((v_prenex_18 Int) (v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse250 (let ((.cse252 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse252 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse252) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46)))))) (let ((.cse249 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse250) v_prenex_18)) (.cse251 (+ 4 v_arrayElimCell_58))) (or (= (select .cse249 (+ v_ArrVal_683 4)) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse250 .cse251) 0) (= (select .cse249 .cse251) 0))))) .cse12) (or .cse12 (forall ((v_prenex_18 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse253 (let ((.cse255 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse255 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse255) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46))))) (.cse254 (+ 4 v_arrayElimCell_58))) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse253 .cse254) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse253) v_prenex_18) .cse254) 0))))) .cse93 .cse94 .cse98 .cse139) .cse35) .cse101 .cse102 (or (forall ((v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse258 (let ((.cse260 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse260 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse260) v_prenex_20) (+ 4 v_arrayElimCell_46)))))) (let ((.cse257 (+ v_ArrVal_683 4)) (.cse256 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse258) v_prenex_20)) (.cse259 (+ 4 v_arrayElimCell_58))) (or (= (select .cse256 .cse257) 0) (= (select .cse258 .cse257) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse256 .cse259) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse258 .cse259) 0))))) .cse12) .cse110 .cse103 .cse104 .cse105 .cse78 (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse261 (let ((.cse263 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse263 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse263) v_prenex_20) (+ 4 v_arrayElimCell_46))))) (.cse262 (+ 4 v_arrayElimCell_58))) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse261) v_prenex_20) .cse262) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse261 .cse262) 0)))) .cse12) (or .cse203 .cse62) .cse106 .cse107 .cse108 (or (forall ((v_prenex_23 Int) (v_prenex_22 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse264 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse264 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse264) v_prenex_23) (+ 4 v_arrayElimCell_46))))) v_prenex_22) (+ 4 v_arrayElimCell_58)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0))) .cse12) (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse265 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse265 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse265) v_prenex_21) (+ 4 v_arrayElimCell_46))))) v_prenex_21) (+ 4 v_arrayElimCell_58)) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0))) .cse12) (or .cse35 (and (or (forall ((v_prenex_18 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse267 (+ 4 v_arrayElimCell_58))) (let ((.cse266 (let ((.cse268 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse268 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse268) |c_ULTIMATE.start_append_~item~0#1.base|) .cse267))))) (or (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse266) v_prenex_18) .cse267)) (= (select .cse266 .cse267) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0))))) .cse12) .cse36 .cse60 .cse61 .cse70 .cse71 (or (forall ((v_prenex_18 Int) (v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse270 (+ 4 v_arrayElimCell_58))) (let ((.cse271 (let ((.cse272 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse272 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse272) |c_ULTIMATE.start_append_~item~0#1.base|) .cse270))))) (let ((.cse269 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse271) v_prenex_18))) (or (= 0 (select .cse269 .cse270)) (= (select .cse271 .cse270) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse269 (+ v_ArrVal_683 4)) 0)))))) .cse12) .cse80 .cse95 .cse96 .cse97 .cse99 .cse111 .cse112 .cse140)) (or .cse12 (forall ((v_ArrVal_683 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (let ((.cse273 (let ((.cse275 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse275 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse275) v_prenex_20) (+ 4 v_arrayElimCell_46))))) (.cse274 (+ 4 v_arrayElimCell_58))) (or (= (select .cse273 (+ v_ArrVal_683 4)) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse273) v_prenex_20) .cse274) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse273 .cse274) 0))))) (or (and .cse90 (or .cse35 .cse88) .cse91 (or .cse35 (and .cse85 .cse86 .cse87 .cse89)) .cse92) .cse0)) .cse34) (or (and (or .cse33 (let ((.cse277 (forall ((v_prenex_12 Int) (v_ArrVal_683 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse310 (let ((.cse313 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse313 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse313) v_prenex_12) .cse2))))) (let ((.cse312 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse310) v_prenex_12)) (.cse311 (+ v_ArrVal_683 4))) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse310 .cse311) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse312 .cse2) 0) (= (select .cse310 .cse2) 0) (= (select .cse312 .cse311) 0))))))) (and (or .cse276 .cse12 .cse277) (or (forall ((v_prenex_12 Int) (v_ArrVal_683 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse278 (let ((.cse280 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse280 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse280) v_prenex_12) .cse2)))) (.cse279 (+ v_ArrVal_683 4))) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse278 .cse279) 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| .cse278) v_prenex_12) .cse279) 0)))) .cse0) (or .cse72 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse281 (let ((.cse283 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse283 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse283) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2))))) (or (= (select .cse281 .cse2) 0) (forall ((v_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_prenex_15 Int)) (let ((.cse282 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse281) v_prenex_15))) (or (= (select .cse282 .cse2) 0) (= (select .cse282 (+ v_ArrVal_683 4)) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse284 (let ((.cse285 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse285 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse285) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2))))) (or (forall ((v_prenex_15 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse284) v_prenex_15) .cse2) 0)) (= (select .cse284 .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))))) (or (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse286 (let ((.cse287 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse287 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse287) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2))))) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse286) v_prenex_16) .cse2) 0) (= (select .cse286 .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse12) (or (forall ((v_prenex_17 Int) (v_ArrVal_683 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (let ((.cse288 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse288 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse288) v_prenex_17) .cse2))) (+ v_ArrVal_683 4)) 0))) .cse0) (or (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse289 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse289 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse289) v_prenex_14) .cse2)))) v_prenex_14) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse72) (or (forall ((v_prenex_12 Int) (v_ArrVal_683 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse290 (let ((.cse291 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse291 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse291) v_prenex_12) .cse2))))) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse290 (+ v_ArrVal_683 4)) 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| .cse290) v_prenex_12) .cse2) 0) (= (select .cse290 .cse2) 0)))) .cse72) (or (forall ((v_prenex_12 Int) (v_ArrVal_683 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse293 (let ((.cse294 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse294 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse294) v_prenex_12) .cse2))))) (let ((.cse292 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse293) v_prenex_12))) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse292 .cse2) 0) (= (select .cse293 .cse2) 0) (= (select .cse292 (+ v_ArrVal_683 4)) 0))))) .cse0) (or .cse72 (forall ((v_prenex_13 Int) (v_arrayElimCell_47 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse295 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse295 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse295) v_arrayElimCell_47) .cse2)))) v_prenex_13) .cse2) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse12 .cse277 .cse296) (or (forall ((v_prenex_12 Int) (v_ArrVal_683 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse297 (let ((.cse299 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse299 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse299) v_prenex_12) .cse2)))) (.cse298 (+ v_ArrVal_683 4))) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse297 .cse298) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse297 .cse2) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse297) v_prenex_12) .cse298) 0)))) .cse0) (or (forall ((v_prenex_16 Int) (v_ArrVal_683 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse301 (let ((.cse302 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse302 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse302) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2))))) (let ((.cse300 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse301) v_prenex_16))) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse300 .cse2) 0) (= (select .cse301 .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse300 (+ v_ArrVal_683 4)) 0))))) .cse12) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse303 (let ((.cse304 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse304 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse304) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2))))) (or (forall ((v_prenex_18 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse303) v_prenex_18) .cse2) 0)) (= (select .cse303 .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse305 (let ((.cse307 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse307 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse307) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2))))) (or (= (select .cse305 .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_ArrVal_683 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_prenex_18 Int)) (let ((.cse306 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse305) v_prenex_18))) (or (= (select .cse306 .cse2) 0) (= (select .cse306 (+ v_ArrVal_683 4)) 0)))))))))))) .cse12 .cse34) (or .cse72 (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse308 (let ((.cse309 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse309 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse309) v_prenex_12) .cse2))))) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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| .cse308) v_prenex_12) .cse2) 0) (= (select .cse308 .cse2) 0))))) .cse234))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_prenex_12 Int)) (let ((.cse314 (let ((.cse316 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse316 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse316) v_prenex_12) .cse2)))) (.cse315 (+ v_ArrVal_683 4))) (or (= (select .cse314 .cse315) 0) (= (select .cse314 .cse2) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse314) v_prenex_12) .cse315) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (forall ((v_prenex_17 Int)) (= (select (let ((.cse317 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse317 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse317) v_prenex_17) .cse2))) (+ v_ArrVal_683 4)) 0)) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (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_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_prenex_12 Int)) (let ((.cse318 (let ((.cse320 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse320 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse320) v_prenex_12) .cse2)))) (.cse319 (+ v_ArrVal_683 4))) (or (= (select .cse318 .cse319) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse318) v_prenex_12) .cse319) 0)))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< v_ArrVal_683 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_683) (forall ((v_prenex_12 Int)) (let ((.cse322 (let ((.cse323 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse323 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse323) v_prenex_12) .cse2))))) (let ((.cse321 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse322) v_prenex_12))) (or (= (select .cse321 .cse2) 0) (= (select .cse322 .cse2) 0) (= (select .cse321 (+ v_ArrVal_683 4)) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse0)) .cse35)))))) is different from true