./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0232-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/memsafety/test-0232-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 d7d99b84861b7e58e44833cf97c5fb5fa14d1ad6f1b87526d3144a9659451e97 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:55:31,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:55:31,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:55:31,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:55:31,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:55:31,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:55:31,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:55:31,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:55:31,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:55:31,438 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:55:31,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:55:31,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:55:31,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:55:31,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:55:31,439 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:55:31,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:55:31,439 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:55:31,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:55:31,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:55:31,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:55:31,440 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:55:31,440 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:55:31,440 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:55:31,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:55:31,440 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:55:31,440 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:55:31,440 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:55:31,440 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:55:31,440 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:55:31,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:55:31,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:55:31,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:55:31,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:55:31,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:55:31,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:55:31,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:55:31,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:55:31,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:55:31,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:55:31,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:55:31,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:55:31,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:55:31,442 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> d7d99b84861b7e58e44833cf97c5fb5fa14d1ad6f1b87526d3144a9659451e97 [2025-03-17 11:55:31,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:55:31,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:55:31,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:55:31,671 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:55:31,671 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:55:31,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-2.i [2025-03-17 11:55:32,815 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09519e909/e7d9f4a16edd4e2a87bd797b5110a45f/FLAG2a63d1daa [2025-03-17 11:55:33,082 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:55:33,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-2.i [2025-03-17 11:55:33,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09519e909/e7d9f4a16edd4e2a87bd797b5110a45f/FLAG2a63d1daa [2025-03-17 11:55:33,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09519e909/e7d9f4a16edd4e2a87bd797b5110a45f [2025-03-17 11:55:33,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:55:33,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:55:33,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:55:33,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:55:33,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:55:33,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:55:33" (1/1) ... [2025-03-17 11:55:33,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335ecacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33, skipping insertion in model container [2025-03-17 11:55:33,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:55:33" (1/1) ... [2025-03-17 11:55:33,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:55:33,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:55:33,323 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:55:33,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:55:33,371 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:55:33,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33 WrapperNode [2025-03-17 11:55:33,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:55:33,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:55:33,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:55:33,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:55:33,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33" (1/1) ... [2025-03-17 11:55:33,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33" (1/1) ... [2025-03-17 11:55:33,397 INFO L138 Inliner]: procedures = 126, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2025-03-17 11:55:33,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:55:33,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:55:33,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:55:33,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:55:33,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33" (1/1) ... [2025-03-17 11:55:33,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33" (1/1) ... [2025-03-17 11:55:33,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33" (1/1) ... [2025-03-17 11:55:33,418 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 8, 12]. 55 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 2, 3]. [2025-03-17 11:55:33,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33" (1/1) ... [2025-03-17 11:55:33,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33" (1/1) ... [2025-03-17 11:55:33,427 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33" (1/1) ... [2025-03-17 11:55:33,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33" (1/1) ... [2025-03-17 11:55:33,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33" (1/1) ... [2025-03-17 11:55:33,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33" (1/1) ... [2025-03-17 11:55:33,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:55:33,436 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:55:33,436 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:55:33,437 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:55:33,441 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33" (1/1) ... [2025-03-17 11:55:33,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:55:33,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:33,464 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) [2025-03-17 11:55:33,466 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 [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 11:55:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:55:33,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:55:33,565 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:55:33,566 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:55:33,767 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-03-17 11:55:33,780 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-03-17 11:55:33,780 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:55:33,788 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:55:33,789 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:55:33,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:55:33 BoogieIcfgContainer [2025-03-17 11:55:33,790 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:55:33,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:55:33,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:55:33,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:55:33,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:55:33" (1/3) ... [2025-03-17 11:55:33,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0fdecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:55:33, skipping insertion in model container [2025-03-17 11:55:33,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:33" (2/3) ... [2025-03-17 11:55:33,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0fdecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:55:33, skipping insertion in model container [2025-03-17 11:55:33,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:55:33" (3/3) ... [2025-03-17 11:55:33,800 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0232-2.i [2025-03-17 11:55:33,809 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:55:33,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0232-2.i that has 1 procedures, 94 locations, 1 initial locations, 2 loop locations, and 48 error locations. [2025-03-17 11:55:33,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:55:33,851 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;@2b6fece8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:55:33,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2025-03-17 11:55:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 45 states have (on average 2.2) internal successors, (99), 93 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:33,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:55:33,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:33,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:55:33,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:33,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:33,863 INFO L85 PathProgramCache]: Analyzing trace with hash 128033, now seen corresponding path program 1 times [2025-03-17 11:55:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:33,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653829591] [2025-03-17 11:55:33,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:33,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:33,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:55:33,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:55:33,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:33,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:34,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:34,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653829591] [2025-03-17 11:55:34,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653829591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:34,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:34,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:55:34,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576570015] [2025-03-17 11:55:34,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:34,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:34,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:34,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:34,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:34,158 INFO L87 Difference]: Start difference. First operand has 94 states, 45 states have (on average 2.2) internal successors, (99), 93 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:34,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:34,351 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2025-03-17 11:55:34,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:34,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-17 11:55:34,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:34,358 INFO L225 Difference]: With dead ends: 107 [2025-03-17 11:55:34,358 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 11:55:34,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:34,362 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 78 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:34,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 97 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 11:55:34,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2025-03-17 11:55:34,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 93 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2025-03-17 11:55:34,394 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 3 [2025-03-17 11:55:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:34,395 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2025-03-17 11:55:34,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2025-03-17 11:55:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:55:34,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:34,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:55:34,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:55:34,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:34,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:34,397 INFO L85 PathProgramCache]: Analyzing trace with hash 128032, now seen corresponding path program 1 times [2025-03-17 11:55:34,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:34,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46988201] [2025-03-17 11:55:34,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:34,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:34,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:55:34,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:55:34,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:34,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:34,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:34,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46988201] [2025-03-17 11:55:34,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46988201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:34,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:34,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:55:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532585514] [2025-03-17 11:55:34,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:34,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:34,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:34,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:34,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:34,478 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:34,569 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2025-03-17 11:55:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:34,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-17 11:55:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:34,570 INFO L225 Difference]: With dead ends: 89 [2025-03-17 11:55:34,571 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 11:55:34,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:34,572 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 83 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:34,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 74 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 11:55:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 11:55:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.830188679245283) internal successors, (97), 88 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2025-03-17 11:55:34,578 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 3 [2025-03-17 11:55:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:34,578 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2025-03-17 11:55:34,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2025-03-17 11:55:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 11:55:34,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:34,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 11:55:34,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:55:34,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:34,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:34,580 INFO L85 PathProgramCache]: Analyzing trace with hash 3969053, now seen corresponding path program 1 times [2025-03-17 11:55:34,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:34,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630020680] [2025-03-17 11:55:34,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:34,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:34,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 11:55:34,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 11:55:34,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:34,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:34,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:34,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630020680] [2025-03-17 11:55:34,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630020680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:34,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:34,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:55:34,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910407243] [2025-03-17 11:55:34,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:34,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:55:34,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:34,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:55:34,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:55:34,604 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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) [2025-03-17 11:55:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:34,670 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2025-03-17 11:55:34,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:55:34,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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 [2025-03-17 11:55:34,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:34,671 INFO L225 Difference]: With dead ends: 85 [2025-03-17 11:55:34,671 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 11:55:34,672 INFO L434 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 [2025-03-17 11:55:34,672 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 12 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:34,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 97 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:34,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 11:55:34,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 11:55:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.7358490566037736) internal successors, (92), 84 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2025-03-17 11:55:34,678 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 4 [2025-03-17 11:55:34,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:34,678 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2025-03-17 11:55:34,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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) [2025-03-17 11:55:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2025-03-17 11:55:34,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 11:55:34,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:34,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 11:55:34,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:55:34,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:34,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:34,679 INFO L85 PathProgramCache]: Analyzing trace with hash 3969054, now seen corresponding path program 1 times [2025-03-17 11:55:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:34,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376085625] [2025-03-17 11:55:34,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:34,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:34,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 11:55:34,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 11:55:34,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:34,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:34,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:34,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376085625] [2025-03-17 11:55:34,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376085625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:34,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:34,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:55:34,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895592161] [2025-03-17 11:55:34,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:34,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:55:34,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:34,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:55:34,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:55:34,744 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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) [2025-03-17 11:55:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:34,783 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2025-03-17 11:55:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:55:34,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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 [2025-03-17 11:55:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:34,784 INFO L225 Difference]: With dead ends: 81 [2025-03-17 11:55:34,784 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 11:55:34,784 INFO L434 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 [2025-03-17 11:55:34,784 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:34,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 101 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 11:55:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-17 11:55:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.6415094339622642) 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) [2025-03-17 11:55:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2025-03-17 11:55:34,790 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 4 [2025-03-17 11:55:34,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:34,790 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2025-03-17 11:55:34,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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) [2025-03-17 11:55:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2025-03-17 11:55:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:55:34,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:34,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:34,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:55:34,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:34,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1274921445, now seen corresponding path program 1 times [2025-03-17 11:55:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:34,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317000781] [2025-03-17 11:55:34,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:34,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:34,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:55:34,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:55:34,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:34,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:34,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:34,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317000781] [2025-03-17 11:55:34,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317000781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:34,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:34,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:55:34,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740299339] [2025-03-17 11:55:34,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:34,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:55:34,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:34,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:55:34,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:55:34,987 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:35,131 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2025-03-17 11:55:35,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:55:35,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-03-17 11:55:35,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:35,132 INFO L225 Difference]: With dead ends: 91 [2025-03-17 11:55:35,132 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 11:55:35,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:55:35,133 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 20 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:35,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 371 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 11:55:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2025-03-17 11:55:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.576271186440678) internal successors, (93), 86 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:35,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2025-03-17 11:55:35,137 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 9 [2025-03-17 11:55:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:35,137 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2025-03-17 11:55:35,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2025-03-17 11:55:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:55:35,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:35,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:35,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:55:35,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:35,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash -867895762, now seen corresponding path program 1 times [2025-03-17 11:55:35,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:35,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407771076] [2025-03-17 11:55:35,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:35,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:35,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:55:35,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:55:35,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:35,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:35,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:35,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407771076] [2025-03-17 11:55:35,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407771076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:35,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:35,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:35,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348227752] [2025-03-17 11:55:35,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:35,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:35,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:35,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:35,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:35,217 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2025-03-17 11:55:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:35,266 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2025-03-17 11:55:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:55:35,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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 [2025-03-17 11:55:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:35,267 INFO L225 Difference]: With dead ends: 86 [2025-03-17 11:55:35,267 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 11:55:35,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:35,268 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 85 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:35,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 92 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 11:55:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2025-03-17 11:55:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.5892857142857142) 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) [2025-03-17 11:55:35,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2025-03-17 11:55:35,271 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 10 [2025-03-17 11:55:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:35,271 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2025-03-17 11:55:35,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2025-03-17 11:55:35,272 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2025-03-17 11:55:35,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:55:35,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:35,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:35,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:55:35,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:35,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1495578247, now seen corresponding path program 1 times [2025-03-17 11:55:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:35,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022138284] [2025-03-17 11:55:35,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:35,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:35,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:55:35,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:55:35,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:35,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:35,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:35,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022138284] [2025-03-17 11:55:35,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022138284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:35,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:35,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:35,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183801106] [2025-03-17 11:55:35,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:35,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:35,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:35,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:35,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:35,404 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:35,535 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2025-03-17 11:55:35,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:35,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 11:55:35,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:35,536 INFO L225 Difference]: With dead ends: 94 [2025-03-17 11:55:35,537 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 11:55:35,538 INFO L434 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 [2025-03-17 11:55:35,538 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 51 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:35,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 153 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:35,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 11:55:35,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2025-03-17 11:55:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 81 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) [2025-03-17 11:55:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2025-03-17 11:55:35,544 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 16 [2025-03-17 11:55:35,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:35,545 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2025-03-17 11:55:35,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:35,545 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2025-03-17 11:55:35,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:55:35,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:35,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:35,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:55:35,546 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:35,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1495578248, now seen corresponding path program 1 times [2025-03-17 11:55:35,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:35,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936779556] [2025-03-17 11:55:35,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:35,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:55:35,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:55:35,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:35,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:35,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:35,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936779556] [2025-03-17 11:55:35,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936779556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:35,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:35,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:35,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931090251] [2025-03-17 11:55:35,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:35,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:35,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:35,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:35,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:35,725 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:35,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:35,842 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2025-03-17 11:55:35,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:35,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 11:55:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:35,843 INFO L225 Difference]: With dead ends: 94 [2025-03-17 11:55:35,843 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 11:55:35,844 INFO L434 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 [2025-03-17 11:55:35,847 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 59 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:35,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 159 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 11:55:35,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2025-03-17 11:55:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.5535714285714286) 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) [2025-03-17 11:55:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2025-03-17 11:55:35,851 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 16 [2025-03-17 11:55:35,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:35,851 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2025-03-17 11:55:35,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2025-03-17 11:55:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:55:35,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:35,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:35,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:55:35,852 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:35,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1563439386, now seen corresponding path program 1 times [2025-03-17 11:55:35,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:35,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870070873] [2025-03-17 11:55:35,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:35,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:55:35,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:55:35,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:35,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:35,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:35,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870070873] [2025-03-17 11:55:35,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870070873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:35,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:35,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:35,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818987096] [2025-03-17 11:55:35,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:35,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:55:35,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:35,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:55:35,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:35,954 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2025-03-17 11:55:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:36,021 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2025-03-17 11:55:36,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:36,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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 [2025-03-17 11:55:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:36,022 INFO L225 Difference]: With dead ends: 78 [2025-03-17 11:55:36,022 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 11:55:36,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:55:36,022 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 43 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:36,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 167 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 11:55:36,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2025-03-17 11:55:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.54) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2025-03-17 11:55:36,025 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 18 [2025-03-17 11:55:36,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:36,025 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2025-03-17 11:55:36,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2025-03-17 11:55:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2025-03-17 11:55:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 11:55:36,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:36,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:36,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:55:36,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:36,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:36,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1219146608, now seen corresponding path program 1 times [2025-03-17 11:55:36,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:36,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286693562] [2025-03-17 11:55:36,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:36,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:36,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:55:36,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:55:36,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:36,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:36,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:36,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286693562] [2025-03-17 11:55:36,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286693562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:36,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:36,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:36,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493873629] [2025-03-17 11:55:36,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:36,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:36,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:36,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:36,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:36,147 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:36,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:36,248 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2025-03-17 11:55:36,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:36,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-17 11:55:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:36,249 INFO L225 Difference]: With dead ends: 77 [2025-03-17 11:55:36,249 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 11:55:36,250 INFO L434 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 [2025-03-17 11:55:36,250 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 31 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:36,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 158 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 11:55:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2025-03-17 11:55:36,257 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) [2025-03-17 11:55:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2025-03-17 11:55:36,257 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 19 [2025-03-17 11:55:36,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:36,257 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2025-03-17 11:55:36,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2025-03-17 11:55:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 11:55:36,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:36,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:36,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:55:36,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:36,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:36,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1219146607, now seen corresponding path program 1 times [2025-03-17 11:55:36,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:36,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159371282] [2025-03-17 11:55:36,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:36,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:36,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:55:36,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:55:36,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:36,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:36,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:36,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159371282] [2025-03-17 11:55:36,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159371282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:36,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:36,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:55:36,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243435121] [2025-03-17 11:55:36,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:36,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:55:36,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:36,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:55:36,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:55:36,446 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:36,563 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2025-03-17 11:55:36,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:55:36,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-17 11:55:36,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:36,564 INFO L225 Difference]: With dead ends: 76 [2025-03-17 11:55:36,564 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 11:55:36,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:55:36,564 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 38 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:36,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 185 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 11:55:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2025-03-17 11:55:36,566 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) [2025-03-17 11:55:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2025-03-17 11:55:36,566 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 19 [2025-03-17 11:55:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:36,567 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2025-03-17 11:55:36,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2025-03-17 11:55:36,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:55:36,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:36,567 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:36,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:55:36,567 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:36,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:36,568 INFO L85 PathProgramCache]: Analyzing trace with hash 970750339, now seen corresponding path program 1 times [2025-03-17 11:55:36,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:36,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432483567] [2025-03-17 11:55:36,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:36,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:55:36,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:55:36,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:36,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:36,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432483567] [2025-03-17 11:55:36,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432483567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670712143] [2025-03-17 11:55:36,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:36,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:36,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:36,786 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) [2025-03-17 11:55:36,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:55:36,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:55:36,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:55:36,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:36,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:36,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 11:55:36,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:36,923 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 [2025-03-17 11:55:36,947 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-17 11:55:36,947 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 [2025-03-17 11:55:36,963 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 [2025-03-17 11:55:36,987 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 [2025-03-17 11:55:37,013 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 [2025-03-17 11:55:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:37,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:37,115 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 [2025-03-17 11:55:37,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:55:37,442 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 [2025-03-17 11:55:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:37,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670712143] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:37,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:37,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-17 11:55:37,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847839531] [2025-03-17 11:55:37,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:37,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 11:55:37,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:37,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 11:55:37,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:55:37,858 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:38,128 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2025-03-17 11:55:38,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:55:38,129 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-17 11:55:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:38,129 INFO L225 Difference]: With dead ends: 75 [2025-03-17 11:55:38,129 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 11:55:38,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:55:38,130 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 78 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:38,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 337 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 11:55:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-03-17 11:55:38,131 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) [2025-03-17 11:55:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2025-03-17 11:55:38,131 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 20 [2025-03-17 11:55:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:38,131 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2025-03-17 11:55:38,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2025-03-17 11:55:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:55:38,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:38,132 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:38,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:38,338 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,SelfDestructingSolverStorable11 [2025-03-17 11:55:38,338 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:38,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash 970750340, now seen corresponding path program 1 times [2025-03-17 11:55:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:38,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466538784] [2025-03-17 11:55:38,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:38,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:55:38,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:55:38,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:38,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:38,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:38,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466538784] [2025-03-17 11:55:38,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466538784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:38,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675332065] [2025-03-17 11:55:38,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:38,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:38,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:38,630 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) [2025-03-17 11:55:38,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:55:38,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:55:38,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:55:38,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:38,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:38,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 11:55:38,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:38,757 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 [2025-03-17 11:55:38,763 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 [2025-03-17 11:55:38,795 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 11:55:38,795 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 [2025-03-17 11:55:38,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 11:55:38,824 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 [2025-03-17 11:55:38,843 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 [2025-03-17 11:55:38,846 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 [2025-03-17 11:55:38,879 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 [2025-03-17 11:55:38,883 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 [2025-03-17 11:55:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:38,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:39,047 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 [2025-03-17 11:55:39,052 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 [2025-03-17 11:55:39,076 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 [2025-03-17 11:55:39,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:55:39,192 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 [2025-03-17 11:55:39,204 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 68 treesize of output 64 [2025-03-17 11:55:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:39,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675332065] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:39,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:39,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-17 11:55:39,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432342221] [2025-03-17 11:55:39,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:39,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:55:39,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:39,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:55:39,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:55:39,331 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:39,679 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2025-03-17 11:55:39,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:55:39,679 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 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 [2025-03-17 11:55:39,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:39,680 INFO L225 Difference]: With dead ends: 74 [2025-03-17 11:55:39,680 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 11:55:39,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:55:39,681 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 94 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:39,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 385 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 11:55:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2025-03-17 11:55:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.46) internal successors, (73), 70 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2025-03-17 11:55:39,683 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 20 [2025-03-17 11:55:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:39,683 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2025-03-17 11:55:39,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2025-03-17 11:55:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:55:39,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:39,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:39,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:39,888 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,SelfDestructingSolverStorable12 [2025-03-17 11:55:39,888 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:39,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash 861160834, now seen corresponding path program 1 times [2025-03-17 11:55:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:39,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779864516] [2025-03-17 11:55:39,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:39,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:39,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:55:39,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:55:39,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:39,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:40,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:40,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779864516] [2025-03-17 11:55:40,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779864516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:40,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:40,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:55:40,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883093843] [2025-03-17 11:55:40,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:40,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:55:40,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:40,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:55:40,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:40,075 INFO L87 Difference]: Start difference. First operand 71 states and 73 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) [2025-03-17 11:55:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:40,235 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2025-03-17 11:55:40,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:55:40,235 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 [2025-03-17 11:55:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:40,236 INFO L225 Difference]: With dead ends: 109 [2025-03-17 11:55:40,236 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 11:55:40,236 INFO L434 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 [2025-03-17 11:55:40,237 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 36 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:40,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 282 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:40,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 11:55:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 84. [2025-03-17 11:55:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.380952380952381) 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) [2025-03-17 11:55:40,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2025-03-17 11:55:40,239 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 20 [2025-03-17 11:55:40,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:40,239 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2025-03-17 11:55:40,239 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) [2025-03-17 11:55:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2025-03-17 11:55:40,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:55:40,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:40,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:40,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:55:40,240 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:40,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:40,241 INFO L85 PathProgramCache]: Analyzing trace with hash 926182094, now seen corresponding path program 1 times [2025-03-17 11:55:40,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:40,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437195328] [2025-03-17 11:55:40,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:40,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:40,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:55:40,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:55:40,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:40,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:40,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:40,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437195328] [2025-03-17 11:55:40,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437195328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:40,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:40,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:55:40,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065851418] [2025-03-17 11:55:40,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:40,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:55:40,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:40,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:55:40,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:40,413 INFO L87 Difference]: Start difference. First operand 84 states and 87 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) [2025-03-17 11:55:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:40,617 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2025-03-17 11:55:40,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:55:40,617 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 [2025-03-17 11:55:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:40,618 INFO L225 Difference]: With dead ends: 108 [2025-03-17 11:55:40,618 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 11:55:40,618 INFO L434 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 [2025-03-17 11:55:40,618 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 36 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:40,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 208 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 11:55:40,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 85. [2025-03-17 11:55:40,620 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) [2025-03-17 11:55:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2025-03-17 11:55:40,620 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 21 [2025-03-17 11:55:40,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:40,620 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2025-03-17 11:55:40,620 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) [2025-03-17 11:55:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2025-03-17 11:55:40,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 11:55:40,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:40,620 INFO L218 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] [2025-03-17 11:55:40,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:55:40,621 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:40,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1353126144, now seen corresponding path program 1 times [2025-03-17 11:55:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:40,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616686504] [2025-03-17 11:55:40,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:40,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:40,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:55:40,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:55:40,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:40,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:40,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:40,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616686504] [2025-03-17 11:55:40,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616686504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:40,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:40,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:55:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781505222] [2025-03-17 11:55:40,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:40,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:55:40,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:40,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:55:40,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:40,874 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) [2025-03-17 11:55:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:41,062 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2025-03-17 11:55:41,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:55:41,062 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 [2025-03-17 11:55:41,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:41,063 INFO L225 Difference]: With dead ends: 99 [2025-03-17 11:55:41,063 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 11:55:41,063 INFO L434 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 [2025-03-17 11:55:41,063 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 24 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:41,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 228 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 11:55:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2025-03-17 11:55:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.3692307692307693) 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) [2025-03-17 11:55:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2025-03-17 11:55:41,065 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 22 [2025-03-17 11:55:41,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:41,066 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2025-03-17 11:55:41,066 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) [2025-03-17 11:55:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2025-03-17 11:55:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:55:41,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:41,066 INFO L218 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] [2025-03-17 11:55:41,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:55:41,066 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:41,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:41,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1002762507, now seen corresponding path program 1 times [2025-03-17 11:55:41,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:41,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942491520] [2025-03-17 11:55:41,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:41,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:41,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:55:41,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:55:41,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:41,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:41,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:41,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:41,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942491520] [2025-03-17 11:55:41,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942491520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:41,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:41,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:55:41,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274873693] [2025-03-17 11:55:41,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:41,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:55:41,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:41,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:55:41,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:41,191 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) [2025-03-17 11:55:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:41,279 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2025-03-17 11:55:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:41,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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 [2025-03-17 11:55:41,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:41,279 INFO L225 Difference]: With dead ends: 85 [2025-03-17 11:55:41,279 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 11:55:41,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:55:41,280 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 81 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:41,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 61 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:41,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 11:55:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 11:55:41,281 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) [2025-03-17 11:55:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2025-03-17 11:55:41,282 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 23 [2025-03-17 11:55:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:41,282 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2025-03-17 11:55:41,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) [2025-03-17 11:55:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2025-03-17 11:55:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:55:41,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:41,282 INFO L218 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] [2025-03-17 11:55:41,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:55:41,282 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:41,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:41,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1002762508, now seen corresponding path program 1 times [2025-03-17 11:55:41,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:41,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319729835] [2025-03-17 11:55:41,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:41,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:41,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:55:41,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:55:41,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:41,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:41,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:41,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319729835] [2025-03-17 11:55:41,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319729835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:41,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:41,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:55:41,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614159847] [2025-03-17 11:55:41,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:41,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:41,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:41,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:41,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:41,323 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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) [2025-03-17 11:55:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:41,352 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2025-03-17 11:55:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:41,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 [2025-03-17 11:55:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:41,353 INFO L225 Difference]: With dead ends: 79 [2025-03-17 11:55:41,353 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 11:55:41,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:41,354 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 45 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:41,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 37 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 11:55:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-17 11:55:41,355 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) [2025-03-17 11:55:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-03-17 11:55:41,355 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 23 [2025-03-17 11:55:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:41,356 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-03-17 11:55:41,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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) [2025-03-17 11:55:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-03-17 11:55:41,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:55:41,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:41,357 INFO L218 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] [2025-03-17 11:55:41,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:55:41,357 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:41,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:41,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1020866654, now seen corresponding path program 1 times [2025-03-17 11:55:41,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:41,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420193822] [2025-03-17 11:55:41,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:41,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:41,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:55:41,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:55:41,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:41,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:41,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:41,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420193822] [2025-03-17 11:55:41,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420193822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:41,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:41,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:41,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733775817] [2025-03-17 11:55:41,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:41,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:55:41,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:41,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:55:41,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:41,424 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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) [2025-03-17 11:55:41,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:41,468 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2025-03-17 11:55:41,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:55:41,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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 [2025-03-17 11:55:41,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:41,469 INFO L225 Difference]: With dead ends: 78 [2025-03-17 11:55:41,469 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 11:55:41,469 INFO L434 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 [2025-03-17 11:55:41,469 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 26 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:41,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 134 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:41,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 11:55:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 11:55:41,471 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) [2025-03-17 11:55:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2025-03-17 11:55:41,472 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 24 [2025-03-17 11:55:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:41,472 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2025-03-17 11:55:41,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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) [2025-03-17 11:55:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2025-03-17 11:55:41,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 11:55:41,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:41,473 INFO L218 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] [2025-03-17 11:55:41,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:55:41,473 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:41,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1582095209, now seen corresponding path program 1 times [2025-03-17 11:55:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:41,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536394277] [2025-03-17 11:55:41,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:41,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:41,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:55:41,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:55:41,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:41,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:41,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:41,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536394277] [2025-03-17 11:55:41,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536394277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:41,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:41,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:41,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095711403] [2025-03-17 11:55:41,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:41,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:55:41,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:41,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:55:41,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:41,550 INFO L87 Difference]: Start difference. First operand 78 states and 81 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) [2025-03-17 11:55:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:41,607 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-03-17 11:55:41,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:55:41,607 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 [2025-03-17 11:55:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:41,607 INFO L225 Difference]: With dead ends: 77 [2025-03-17 11:55:41,607 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 11:55:41,607 INFO L434 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 [2025-03-17 11:55:41,608 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 26 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:41,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 111 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 11:55:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 11:55:41,609 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) [2025-03-17 11:55:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2025-03-17 11:55:41,609 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 25 [2025-03-17 11:55:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:41,610 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2025-03-17 11:55:41,610 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) [2025-03-17 11:55:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2025-03-17 11:55:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 11:55:41,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:41,610 INFO L218 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] [2025-03-17 11:55:41,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:55:41,610 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:41,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1800311228, now seen corresponding path program 1 times [2025-03-17 11:55:41,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:41,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28190320] [2025-03-17 11:55:41,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:41,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:55:41,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:55:41,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:41,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:41,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:41,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28190320] [2025-03-17 11:55:41,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28190320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:41,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:41,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:55:41,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39509778] [2025-03-17 11:55:41,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:41,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:55:41,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:41,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:55:41,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:55:41,847 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 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) [2025-03-17 11:55:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:42,133 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2025-03-17 11:55:42,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:55:42,133 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 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 [2025-03-17 11:55:42,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:42,134 INFO L225 Difference]: With dead ends: 97 [2025-03-17 11:55:42,134 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 11:55:42,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:55:42,135 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 55 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:42,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 225 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 11:55:42,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 81. [2025-03-17 11:55:42,136 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) [2025-03-17 11:55:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-03-17 11:55:42,137 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 26 [2025-03-17 11:55:42,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:42,137 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-03-17 11:55:42,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 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) [2025-03-17 11:55:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-03-17 11:55:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 11:55:42,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:42,137 INFO L218 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] [2025-03-17 11:55:42,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:55:42,137 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:42,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:42,138 INFO L85 PathProgramCache]: Analyzing trace with hash -24926778, now seen corresponding path program 1 times [2025-03-17 11:55:42,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:42,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942712092] [2025-03-17 11:55:42,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:42,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 11:55:42,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 11:55:42,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:42,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:42,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:42,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942712092] [2025-03-17 11:55:42,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942712092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:42,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:42,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:42,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929949556] [2025-03-17 11:55:42,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:42,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:42,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:42,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:42,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:42,253 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2025-03-17 11:55:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:42,325 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2025-03-17 11:55:42,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:55:42,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 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 [2025-03-17 11:55:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:42,328 INFO L225 Difference]: With dead ends: 80 [2025-03-17 11:55:42,328 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 11:55:42,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:55:42,329 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 69 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:42,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 82 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 11:55:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 11:55:42,331 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) [2025-03-17 11:55:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2025-03-17 11:55:42,332 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 27 [2025-03-17 11:55:42,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:42,332 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2025-03-17 11:55:42,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2025-03-17 11:55:42,332 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2025-03-17 11:55:42,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 11:55:42,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:42,332 INFO L218 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] [2025-03-17 11:55:42,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:55:42,333 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:42,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:42,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2095557782, now seen corresponding path program 1 times [2025-03-17 11:55:42,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:42,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426975286] [2025-03-17 11:55:42,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:42,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 11:55:42,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 11:55:42,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:42,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:42,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:42,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426975286] [2025-03-17 11:55:42,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426975286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:42,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:42,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:55:42,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219440155] [2025-03-17 11:55:42,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:42,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:55:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:42,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:55:42,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:55:42,727 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 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) [2025-03-17 11:55:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:42,908 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2025-03-17 11:55:42,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:55:42,909 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 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 [2025-03-17 11:55:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:42,909 INFO L225 Difference]: With dead ends: 107 [2025-03-17 11:55:42,909 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 11:55:42,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:55:42,912 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:42,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 365 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:42,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 11:55:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2025-03-17 11:55:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 102 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2025-03-17 11:55:42,916 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 32 [2025-03-17 11:55:42,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:42,916 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2025-03-17 11:55:42,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 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) [2025-03-17 11:55:42,916 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2025-03-17 11:55:42,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 11:55:42,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:42,917 INFO L218 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] [2025-03-17 11:55:42,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:55:42,917 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:42,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:42,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2095558166, now seen corresponding path program 1 times [2025-03-17 11:55:42,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:42,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755985362] [2025-03-17 11:55:42,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:42,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:42,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 11:55:42,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 11:55:42,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:42,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:43,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:43,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755985362] [2025-03-17 11:55:43,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755985362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:43,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:43,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 11:55:43,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208840275] [2025-03-17 11:55:43,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:43,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:55:43,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:43,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:55:43,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:55:43,552 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 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) [2025-03-17 11:55:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:43,921 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2025-03-17 11:55:43,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:55:43,922 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 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 [2025-03-17 11:55:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:43,922 INFO L225 Difference]: With dead ends: 106 [2025-03-17 11:55:43,922 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 11:55:43,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:55:43,923 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:43,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 309 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 11:55:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2025-03-17 11:55:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.1891891891891893) 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) [2025-03-17 11:55:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2025-03-17 11:55:43,924 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 32 [2025-03-17 11:55:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:43,925 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2025-03-17 11:55:43,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 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) [2025-03-17 11:55:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2025-03-17 11:55:43,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 11:55:43,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:43,925 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:43,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:55:43,925 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-17 11:55:43,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:43,925 INFO L85 PathProgramCache]: Analyzing trace with hash -415597678, now seen corresponding path program 1 times [2025-03-17 11:55:43,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:43,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580592769] [2025-03-17 11:55:43,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:43,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:43,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 11:55:43,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:55:43,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:43,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:55:44,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:44,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580592769] [2025-03-17 11:55:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580592769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:44,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986305702] [2025-03-17 11:55:44,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:44,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:44,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:44,619 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) [2025-03-17 11:55:44,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:55:44,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 11:55:44,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:55:44,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:44,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:44,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-17 11:55:44,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:44,806 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 [2025-03-17 11:55:44,846 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 [2025-03-17 11:55:44,852 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 [2025-03-17 11:55:44,898 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 11:55:44,899 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 [2025-03-17 11:55:44,988 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 [2025-03-17 11:55:44,995 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 [2025-03-17 11:55:45,128 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 [2025-03-17 11:55:45,326 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:45,331 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 11:55:45,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2025-03-17 11:55:45,418 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:45,418 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 64 treesize of output 37 [2025-03-17 11:55:45,424 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:45,425 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 55 treesize of output 39 [2025-03-17 11:55:45,601 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:45,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2025-03-17 11:55:45,604 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:45,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:55:45,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2025-03-17 11:55:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:45,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:46,498 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-17 11:55:46,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 180 [2025-03-17 11:55:46,546 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-17 11:55:46,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 286 treesize of output 272 [2025-03-17 11:55:46,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:55:46,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 194 [2025-03-17 11:55:46,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:55:46,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 188 [2025-03-17 11:55:46,597 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 [2025-03-17 11:55:46,612 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 [2025-03-17 11:55:46,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:55:46,651 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 306 treesize of output 320 [2025-03-17 11:55:47,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:55:47,485 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 2189 treesize of output 2151 [2025-03-17 11:56:01,612 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse397 (< |c_ULTIMATE.start_append_~plist#1.offset| 1)) (.cse68 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 1))) (let ((.cse6 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|)) (.cse488 (or .cse397 .cse68)) (.cse489 (or .cse68 (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ 2 |c_ULTIMATE.start_append_~plist#1.offset|)))) (.cse2 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse54 (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse282 (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_21 Int)) (let ((.cse523 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse524 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse523))) (or (= (select (store .cse523 4 (select (select .cse524 v_prenex_21) .cse54)) .cse54) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse523 4 (select (select .cse524 |c_ULTIMATE.start_append_~item~0#1.base|) .cse54))) v_prenex_21) .cse54) 0)))))))) (.cse280 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse522 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse522 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse522) v_prenex_20) .cse54)))) v_prenex_20) .cse54) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse278 (forall ((v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse520 (let ((.cse521 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse521 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse521) v_prenex_28) .cse54))))) (or (= (select .cse520 .cse54) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse520) v_prenex_28) .cse54) 0))))) (.cse274 (or (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_prenex_17) .cse54) 0))) .cse2)) (.cse277 (or (forall ((v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse519 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse518 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse519) v_prenex_28) .cse54))) (or (= .cse518 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse519 4 .cse518)) v_prenex_28) 4) 0))))) .cse2)) (.cse9 (and .cse488 .cse489)) (.cse69 (< |c_ULTIMATE.start_append_~plist#1.offset| 0)) (.cse70 (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse73 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_22 Int)) (let ((.cse516 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse517 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse517 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse517) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_22))) (or (= (select .cse516 4) 0) (= (select .cse516 .cse54) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse77 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_22 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse515 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse515 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse515) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_22) .cse54) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse71 (not .cse6))) (let ((.cse55 (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_prenex_27) .cse54) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse61 (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse513 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse514 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse514 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse514) v_prenex_29) .cse54)))) v_prenex_29))) (or (= 0 (select .cse513 .cse54)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse513 4) 0))))) (.cse60 (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse511 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse512 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse511) v_prenex_29) .cse54))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse511 4 .cse512)) v_prenex_29) 4) 0) (= .cse512 0)))))) (.cse63 (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse509 (let ((.cse510 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse510 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse510) v_prenex_29) .cse54))))) (or (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse509) v_prenex_29) .cse54)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse509 .cse54) 0))))) (.cse62 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse508 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse508 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse508) v_prenex_26) .cse54)))) v_prenex_26) .cse54) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse36 (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse507 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse507 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse507) v_arrayElimCell_42) (+ 4 v_arrayElimCell_41))))) v_arrayElimCell_50) (+ 4 v_arrayElimCell_53)) 0)))) (.cse42 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse506 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse506 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse506) v_prenex_20) (+ 4 v_arrayElimCell_41))))) v_prenex_20) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse72 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_21 Int)) (let ((.cse505 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse502 (store .cse505 0 v_arrayElimCell_41))) (let ((.cse503 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse502) v_prenex_21) (+ 4 v_arrayElimCell_41)))) (or (= 0 (select (store .cse502 4 .cse503) .cse54)) (= .cse503 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse504 (store .cse505 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse504 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse504) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_21) .cse54) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse74 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_25 Int)) (let ((.cse500 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse499 (store .cse500 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse499 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse499) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_25) .cse54)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse501 (store .cse500 0 v_arrayElimCell_41))) (store .cse501 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse501) v_prenex_25) (+ 4 v_arrayElimCell_41))))) v_prenex_25) .cse54) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse75 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_21 Int)) (let ((.cse497 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= 0 (select (let ((.cse496 (store .cse497 0 v_arrayElimCell_41))) (store .cse496 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse496) v_prenex_21) (+ 4 v_arrayElimCell_41)))) .cse54)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse498 (store .cse497 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse498 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse498) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_21) .cse54) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse76 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_21 Int)) (let ((.cse493 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse492 (+ 4 v_arrayElimCell_41)) (.cse494 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse495 (store .cse493 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse495 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse495) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_21))) (or (= 0 (select (let ((.cse491 (store .cse493 0 v_arrayElimCell_41))) (store .cse491 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse491) v_prenex_21) .cse492))) .cse54)) (= (select .cse494 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_21) .cse492) 0) (= (select .cse494 .cse54) 0)))))))) (.cse228 (forall ((v_arrayElimCell_50 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse490 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse490 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse490) v_arrayElimCell_42) .cse54)))) v_arrayElimCell_50) .cse54) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse216 (or .cse69 .cse70 (and .cse73 .cse77) .cse71)) (.cse229 (and (or .cse68 .cse6) .cse488 .cse489)) (.cse217 (or .cse68 (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse487 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse487 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse487) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_25) .cse54)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse218 (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse486 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse485 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse486) v_prenex_23) .cse54))) (or (= .cse485 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse486 4 .cse485)) v_prenex_23) 4) 0))))) .cse2)) (.cse219 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse484 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse484 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse484) v_prenex_19) .cse54)))) v_prenex_19) .cse54)))) .cse9)) (.cse220 (or (and (or .cse68 .cse278) .cse274 .cse277 (or (forall ((v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse481 (let ((.cse483 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse483 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse483) v_prenex_28) .cse54))))) (let ((.cse482 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse481) v_prenex_28))) (or (= (select .cse481 .cse54) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse482 4) 0) (= (select .cse482 .cse54) 0))))) .cse2)) .cse6)) (.cse226 (or (forall ((v_prenex_12 Int) (v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse480 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse480 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse480) v_prenex_13) .cse54)))) v_prenex_12) .cse54) 0))) .cse9)) (.cse221 (or (forall ((v_prenex_24 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_prenex_24) .cse54) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse2)) (.cse227 (or .cse68 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse479 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse479 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse479) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_14) .cse54) 0))))) (.cse222 (or .cse2 (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse477 (let ((.cse478 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse478 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse478) v_prenex_23) .cse54))))) (let ((.cse476 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse477) v_prenex_23))) (or (= (select .cse476 .cse54) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse477 .cse54) 0) (= (select .cse476 4) 0))))))) (.cse223 (or .cse68 .cse280 .cse6)) (.cse224 (or .cse9 (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse474 (let ((.cse475 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse475 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse475) v_prenex_23) .cse54))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse474) v_prenex_23) .cse54) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse474 .cse54) 0)))))) (.cse81 (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_22 Int) (v_arrayElimCell_53 Int)) (let ((.cse472 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse473 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse473 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse473) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_22))) (or (= (select .cse472 (+ 4 v_arrayElimCell_53)) 0) (= (select .cse472 4) 0))))))) (.cse82 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_22 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse471 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse471 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse471) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_22) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse225 (or (and .cse282 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_21 Int)) (let ((.cse469 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse470 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse469))) (let ((.cse468 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse469 4 (select (select .cse470 |c_ULTIMATE.start_append_~item~0#1.base|) .cse54))) v_prenex_21))) (or (= (select .cse468 4) 0) (= (select (store .cse469 4 (select (select .cse470 v_prenex_21) .cse54)) .cse54) 0) (= (select .cse468 .cse54) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse68)) (.cse3 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (= (let ((.cse467 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse466 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse466 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse466) |c_ULTIMATE.start_append_~item~0#1.base|) .cse467)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse467)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse38 (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_41 Int) (v_prenex_29 Int) (v_arrayElimCell_53 Int)) (let ((.cse465 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse462 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse465) v_prenex_29) (+ 4 v_arrayElimCell_41)))) (let ((.cse463 (store .cse465 4 .cse462)) (.cse464 (+ 4 v_arrayElimCell_53))) (or (= .cse462 0) (= (select .cse463 .cse464) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse463) v_prenex_29) .cse464) 0))))))))) (.cse26 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse461 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse461 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse461) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse25 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_12 Int) (v_prenex_13 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse460 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse460 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse460) v_prenex_13) (+ 4 v_arrayElimCell_41))))) v_prenex_12) (+ 4 v_arrayElimCell_53)) 0))))) (.cse33 (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_15 Int) (v_arrayElimCell_41 Int) (v_prenex_14 Int) (v_arrayElimCell_53 Int)) (let ((.cse457 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse458 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse456 (store .cse457 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse456 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse456) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_14) .cse458) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse459 (store .cse457 0 v_arrayElimCell_41))) (store .cse459 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse459) v_prenex_15) (+ 4 v_arrayElimCell_41))))) v_prenex_14) .cse458) 0))))))) (.cse39 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_29 Int) (v_arrayElimCell_53 Int)) (let ((.cse455 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse451 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse455) v_prenex_29) (+ 4 v_arrayElimCell_41)))) (let ((.cse452 (store .cse455 4 .cse451))) (let ((.cse453 (+ 4 v_arrayElimCell_53)) (.cse454 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse452) v_prenex_29))) (or (= .cse451 0) (= (select .cse452 .cse453) 0) (= (select .cse454 .cse453) 0) (= (select .cse454 4) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse23 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_53 Int) (v_prenex_19 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse450 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse450 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse450) v_prenex_19) (+ 4 v_arrayElimCell_41))))) v_prenex_19) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse24 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_25 Int) (v_arrayElimCell_53 Int)) (let ((.cse447 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse448 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse446 (store .cse447 0 v_arrayElimCell_41))) (store .cse446 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse446) v_prenex_25) (+ 4 v_arrayElimCell_41))))) v_prenex_25) .cse448) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse449 (store .cse447 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse449 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse449) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_25) .cse448) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse27 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int) (v_arrayElimCell_53 Int)) (let ((.cse443 (let ((.cse445 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse445 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse445) v_prenex_23) (+ 4 v_arrayElimCell_41))))) (.cse444 (+ 4 v_arrayElimCell_53))) (or (= (select .cse443 .cse444) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse443) v_prenex_23) .cse444) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse28 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int) (v_arrayElimCell_53 Int)) (let ((.cse442 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse439 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse442) v_prenex_23) (+ 4 v_arrayElimCell_41)))) (let ((.cse440 (store .cse442 4 .cse439)) (.cse441 (+ 4 v_arrayElimCell_53))) (or (= .cse439 0) (= (select .cse440 .cse441) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse440) v_prenex_23) .cse441) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse30 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_28 Int) (v_arrayElimCell_53 Int)) (let ((.cse438 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse437 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse438) v_prenex_28) (+ 4 v_arrayElimCell_41)))) (let ((.cse435 (store .cse438 4 .cse437)) (.cse436 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse435) v_prenex_28) .cse436) 0) (= (select .cse435 .cse436) 0) (= .cse437 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse31 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_28 Int) (v_arrayElimCell_53 Int)) (let ((.cse434 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse433 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse434) v_prenex_28) (+ 4 v_arrayElimCell_41)))) (let ((.cse432 (store .cse434 4 .cse433))) (let ((.cse430 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse432) v_prenex_28)) (.cse431 (+ 4 v_arrayElimCell_53))) (or (= (select .cse430 4) 0) (= (select .cse430 .cse431) 0) (= (select .cse432 .cse431) 0) (= .cse433 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse29 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_21 Int) (v_arrayElimCell_53 Int)) (let ((.cse427 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse425 (+ 4 v_arrayElimCell_41)) (.cse424 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse429 (store .cse427 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse429 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse429) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_21)) (.cse428 (+ 4 v_arrayElimCell_53))) (or (= (select .cse424 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_21) .cse425) 0) (= 0 (select (let ((.cse426 (store .cse427 0 v_arrayElimCell_41))) (store .cse426 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse426) v_prenex_21) .cse425))) .cse428)) (= (select .cse424 .cse428) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse32 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_28 Int) (v_arrayElimCell_53 Int)) (let ((.cse421 (let ((.cse423 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse423 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse423) v_prenex_28) (+ 4 v_arrayElimCell_41))))) (.cse422 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse421) v_prenex_28) .cse422) 0) (= (select .cse421 .cse422) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse34 (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_41 Int) (v_prenex_21 Int) (v_arrayElimCell_53 Int)) (let ((.cse420 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse417 (store .cse420 0 v_arrayElimCell_41))) (let ((.cse416 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse417) v_prenex_21) (+ 4 v_arrayElimCell_41))) (.cse418 (+ 4 v_arrayElimCell_53))) (or (= .cse416 0) (= 0 (select (store .cse417 4 .cse416) .cse418)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse419 (store .cse420 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse419 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse419) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_21) .cse418) 0))))))))) (.cse37 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int) (v_arrayElimCell_53 Int)) (let ((.cse415 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse412 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse415) v_prenex_23) (+ 4 v_arrayElimCell_41)))) (let ((.cse413 (store .cse415 4 .cse412))) (let ((.cse411 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse413) v_prenex_23)) (.cse414 (+ 4 v_arrayElimCell_53))) (or (= 0 (select .cse411 4)) (= .cse412 0) (= (select .cse413 .cse414) 0) (= (select .cse411 .cse414) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse43 (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_41 Int) (v_prenex_21 Int) (v_arrayElimCell_53 Int)) (let ((.cse408 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse409 (+ 4 v_arrayElimCell_53))) (or (= 0 (select (let ((.cse407 (store .cse408 0 v_arrayElimCell_41))) (store .cse407 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse407) v_prenex_21) (+ 4 v_arrayElimCell_41)))) .cse409)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse410 (store .cse408 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse410 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse410) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_21) .cse409) 0))))))) (.cse40 (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_26 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse406 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse406 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse406) v_prenex_26) (+ 4 v_arrayElimCell_41))))) v_prenex_26) (+ 4 v_arrayElimCell_53)) 0))))) (.cse35 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse405 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse405 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse405) v_prenex_16) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse41 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_29 Int) (v_arrayElimCell_53 Int)) (let ((.cse402 (let ((.cse404 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse404 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse404) v_prenex_29) (+ 4 v_arrayElimCell_41))))) (.cse403 (+ 4 v_arrayElimCell_53))) (or (= (select .cse402 .cse403) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse402) v_prenex_29) .cse403) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse49 (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse401 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53)) (.cse400 (+ 4 v_arrayElimCell_53))) (let ((.cse398 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse401) v_prenex_29) .cse400))) (let ((.cse399 (store .cse401 4 .cse398))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse398 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse399) v_prenex_29) 4) 0) (= (select .cse399 .cse400) 0))))))) (.cse59 (and (or .cse397 .cse2) (or (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ |c_ULTIMATE.start_append_~plist#1.offset| 1)) .cse2))) (.cse1 (or .cse9 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_21 Int) (v_arrayElimCell_53 Int)) (let ((.cse390 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse392 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse389 (store .cse390 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse389 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse389) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_21) 4) 0) (= (select (let ((.cse391 (store .cse390 0 v_arrayElimCell_53))) (store .cse391 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse391) v_prenex_21) .cse392))) .cse392) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_21) .cse392) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_21 Int) (v_arrayElimCell_53 Int)) (let ((.cse395 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse394 (+ 4 v_arrayElimCell_53))) (or (= (select (let ((.cse393 (store .cse395 0 v_arrayElimCell_53))) (store .cse393 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse393) v_prenex_21) .cse394))) .cse394) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse396 (store .cse395 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse396 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse396) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_21) .cse394) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse11 (or (forall ((v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse388 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (let ((.cse387 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse388) v_prenex_28) (+ 4 v_arrayElimCell_53)))) (or (= .cse387 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse388 4 .cse387)) v_prenex_28) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse2)) (.cse12 (or (forall ((v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse384 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53)) (.cse386 (+ 4 v_arrayElimCell_53))) (let ((.cse385 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse384) v_prenex_28) .cse386))) (or (= 0 (select (store .cse384 4 .cse385) .cse386)) (= .cse385 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse9)) (.cse10 (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse383 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (let ((.cse382 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse383) v_prenex_23) (+ 4 v_arrayElimCell_53)))) (or (= .cse382 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse383 4 .cse382)) v_prenex_23) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse2)) (.cse13 (or (forall ((v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse380 (+ 4 v_arrayElimCell_53))) (let ((.cse379 (let ((.cse381 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse381 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse381) v_prenex_28) .cse380))))) (or (= 0 (select .cse379 .cse380)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse379) v_prenex_28) .cse380) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse9)) (.cse16 (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse376 (+ 4 v_arrayElimCell_53))) (let ((.cse375 (let ((.cse378 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse378 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse378) v_prenex_23) .cse376))))) (let ((.cse377 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse375) v_prenex_23))) (or (= (select .cse375 .cse376) 0) (= (select .cse377 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse377 .cse376) 0)))))) .cse2)) (.cse17 (or .cse9 (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse373 (+ 4 v_arrayElimCell_53))) (let ((.cse372 (let ((.cse374 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse374 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse374) v_prenex_23) .cse373))))) (or (= (select .cse372 .cse373) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse372) v_prenex_23) .cse373) 0))))))) (.cse7 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_25 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse371 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse371 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse371) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_25) (+ 4 v_arrayElimCell_53)) 0))))) (.cse8 (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_53 Int) (v_prenex_19 Int)) (= (let ((.cse370 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse369 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse369 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse369) v_prenex_19) .cse370)))) v_prenex_19) .cse370)) 0))))) (.cse14 (or (forall ((v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse368 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53)) (.cse366 (+ 4 v_arrayElimCell_53))) (let ((.cse367 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse368) v_prenex_28) .cse366))) (let ((.cse365 (store .cse368 4 .cse367))) (or (= 0 (select .cse365 .cse366)) (= .cse367 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse365) v_prenex_28) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse2)) (.cse44 (or .cse2 (forall ((v_prenex_24 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53)) v_prenex_24) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse15 (or (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53)) v_prenex_17) (+ 4 v_arrayElimCell_53)) 0))) .cse2)) (.cse46 (or .cse9 (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse363 (+ 4 v_arrayElimCell_53))) (let ((.cse362 (let ((.cse364 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse364 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse364) v_prenex_29) .cse363))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse362) v_prenex_29) .cse363) 0) (= (select .cse362 .cse363) 0))))))) (.cse45 (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse361 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (let ((.cse360 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse361) v_prenex_29) (+ 4 v_arrayElimCell_53)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse360 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse361 4 .cse360)) v_prenex_29) 4) 0)))))) (.cse47 (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53)) v_prenex_27) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse48 (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (= (let ((.cse359 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse358 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse358 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse358) v_prenex_26) .cse359)))) v_prenex_26) .cse359)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse9)) (.cse50 (or (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse356 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53)) (.cse357 (+ 4 v_arrayElimCell_53))) (let ((.cse355 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse356) v_prenex_29) .cse357))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse355 0) (= (select (store .cse356 4 .cse355) .cse357) 0))))) .cse9)) (.cse20 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_12 Int) (v_prenex_13 Int) (v_arrayElimCell_53 Int)) (= (let ((.cse354 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse353 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse353 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse353) v_prenex_13) .cse354)))) v_prenex_12) .cse354)) 0))))) (.cse22 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse352 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse352 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse352) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_14) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse21 (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_53 Int)) (= (let ((.cse351 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse350 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse350 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse350) v_prenex_16) .cse351)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse351)) 0))))) (.cse51 (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse348 (+ 4 v_arrayElimCell_53))) (let ((.cse347 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse349 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse349 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse349) v_prenex_29) .cse348)))) v_prenex_29))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse347 .cse348) 0) (= (select .cse347 4) 0)))))) (.cse0 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|))) (and (or .cse0 (and .cse1 (or .cse2 .cse3) (or (and (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int) (v_arrayElimCell_53 Int)) (or (= (let ((.cse5 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse4 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse4 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse4) v_prenex_20) .cse5)))) v_prenex_20) .cse5)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse6) .cse7 .cse8) .cse9) .cse10 (or (and .cse11 .cse12 .cse13 .cse14 .cse15) .cse6) .cse16 .cse17 (or .cse9 (and (or (forall ((v_arrayElimCell_50 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int) (v_arrayElimCell_42 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse19 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse18 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse18 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse18) v_arrayElimCell_42) .cse19)))) v_arrayElimCell_50) .cse19)) 0))) .cse6) .cse20 .cse21 .cse22)) (or .cse9 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (or (and .cse30 .cse31 .cse32) .cse6) .cse33 .cse34 .cse35 (or .cse36 .cse6) .cse37 (or .cse6 (and .cse38 .cse39 .cse40 .cse41)) (or .cse42 .cse6) .cse43)) .cse44 (or .cse6 (and (or .cse45 .cse2) .cse46 (or .cse47 .cse2) .cse48 (or .cse49 .cse2) .cse50 (or .cse51 .cse2))))) (or (and (or .cse9 (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse52 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse53 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse52) v_prenex_29) .cse54))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (store .cse52 4 .cse53) .cse54) 0) (= .cse53 0)))))) (or .cse0 .cse2 .cse55) (or (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse58 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse57 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse58) v_prenex_29) .cse54))) (let ((.cse56 (store .cse58 4 .cse57))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse56 .cse54) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse56) v_prenex_29) 4) 0) (= .cse57 0)))))) .cse59) (or .cse0 .cse60 .cse2) (or .cse0 .cse2 .cse61) (or .cse9 .cse62) (or .cse9 .cse63)) .cse6) (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)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse64 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse64 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse64) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54) 0))) .cse2) (or (and (or .cse2 .cse55) (or .cse2 .cse61) (or .cse60 .cse2) (or (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse66 (let ((.cse67 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse67 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse67) v_prenex_29) .cse54))))) (let ((.cse65 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse66) v_prenex_29))) (or (= 0 (select .cse65 .cse54)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse66 .cse54) 0) (= (select .cse65 4) 0))))) .cse2) (or .cse68 .cse63) (or .cse62 .cse68)) .cse6) (or .cse69 .cse70 .cse71 (and (or .cse0 (and .cse72 .cse73 .cse74 .cse75 .cse76 .cse77)) (or .cse0 (forall ((v_prenex_15 Int) (v_arrayElimCell_41 Int) (v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse79 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse78 (store .cse79 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse78 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse78) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_14) .cse54) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse80 (store .cse79 0 v_arrayElimCell_41))) (store .cse80 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse80) v_prenex_15) (+ 4 v_arrayElimCell_41))))) v_prenex_14) .cse54) 0))))) (or .cse0 (and .cse24 .cse81 .cse82 .cse29 .cse33 .cse34 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse83 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse83 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse83) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse43)))) (or (let ((.cse89 (or (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse214 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse215 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse214) v_prenex_23) (+ 4 v_arrayElimCell_41)))) (or (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse214 4 .cse215)) v_prenex_23) 4)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse215 0))))) .cse2)) (.cse90 (or .cse68 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int)) (let ((.cse212 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse211 (+ 4 v_arrayElimCell_41))) (or (= (select (let ((.cse210 (store .cse212 0 v_arrayElimCell_41))) (store .cse210 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse210) v_prenex_21) .cse211))) .cse211) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse213 (store .cse212 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse213 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse213) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_21) .cse211) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse91 (or .cse2 (forall ((v_arrayElimCell_41 Int) (v_prenex_24 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41)) v_prenex_24) (+ 4 v_arrayElimCell_41)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse92 (or (forall ((v_arrayElimCell_41 Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse208 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse207 (+ 4 v_arrayElimCell_41))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse206 (store .cse208 0 v_arrayElimCell_41))) (store .cse206 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse206) v_prenex_25) .cse207)))) v_prenex_25) .cse207) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse209 (store .cse208 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse209 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse209) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_25) .cse207) 0)))) .cse68)) (.cse93 (or (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse204 (+ 4 v_arrayElimCell_41))) (let ((.cse203 (let ((.cse205 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse205 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse205) v_prenex_23) .cse204))))) (let ((.cse202 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse203) v_prenex_23))) (or (= 0 (select .cse202 4)) (= (select .cse203 .cse204) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse202 .cse204) 0)))))) .cse2)) (.cse94 (or (forall ((v_arrayElimCell_41 Int) (v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41)) v_prenex_17) (+ 4 v_arrayElimCell_41)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse2)) (.cse95 (or .cse68 (forall ((v_arrayElimCell_41 Int) (v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse200 (+ 4 v_arrayElimCell_41))) (let ((.cse199 (let ((.cse201 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse201 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse201) v_prenex_28) .cse200))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse199) v_prenex_28) .cse200) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse199 .cse200) 0))))))) (.cse96 (or (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse197 (+ 4 v_arrayElimCell_41))) (let ((.cse196 (let ((.cse198 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse198 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse198) v_prenex_23) .cse197))))) (or (= (select .cse196 .cse197) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse196) v_prenex_23) .cse197) 0))))) .cse9)) (.cse97 (or .cse68 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int)) (or (= (let ((.cse195 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse194 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse194 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse194) v_prenex_20) .cse195)))) v_prenex_20) .cse195)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse98 (or (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (or (= (let ((.cse193 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse192 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse192 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse192) v_prenex_19) .cse193)))) v_prenex_19) .cse193)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse9)) (.cse99 (or (forall ((v_arrayElimCell_41 Int) (v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse189 (+ 4 v_arrayElimCell_41))) (let ((.cse190 (let ((.cse191 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse191 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse191) v_prenex_28) .cse189))))) (let ((.cse188 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse190) v_prenex_28))) (or (= (select .cse188 4) 0) (= (select .cse188 .cse189) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse190 .cse189) 0)))))) .cse2)) (.cse100 (or (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int)) (let ((.cse186 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse183 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse187 (store .cse186 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse187 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse187) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_21)) (.cse185 (+ 4 v_arrayElimCell_41))) (or (= (select .cse183 4) 0) (= (select (let ((.cse184 (store .cse186 0 v_arrayElimCell_41))) (store .cse184 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse184) v_prenex_21) .cse185))) .cse185) 0) (= (select .cse183 .cse185) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse68)) (.cse101 (or .cse2 (forall ((v_arrayElimCell_41 Int) (v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse181 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse182 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse181) v_prenex_28) (+ 4 v_arrayElimCell_41)))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse181 4 .cse182)) v_prenex_28) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse182 0))))))) (.cse104 (or (forall ((v_prenex_15 Int) (v_arrayElimCell_41 Int) (v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse178 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse179 (+ 4 v_arrayElimCell_41))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse177 (store .cse178 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse177 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse177) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_14) .cse179) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse180 (store .cse178 0 v_arrayElimCell_41))) (store .cse180 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse180) v_prenex_15) .cse179)))) v_prenex_14) .cse179) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse68)) (.cse137 (or .cse9 (forall ((v_arrayElimCell_41 Int) (v_prenex_12 Int) (v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (let ((.cse176 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse175 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse175 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse175) v_prenex_13) .cse176)))) v_prenex_12) .cse176)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (and (or (forall ((v_arrayElimCell_41 Int) (v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse85 (+ 4 v_arrayElimCell_41))) (let ((.cse84 (let ((.cse86 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse86 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse86) v_prenex_29) .cse85))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse84) v_prenex_29) .cse85) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse84 .cse85) 0))))) .cse68) (or (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse88 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse87 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse87 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse87) |c_ULTIMATE.start_append_~item~0#1.base|) .cse88)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse88)) 0))) .cse2) (or (and .cse89 .cse90 .cse91 .cse92 .cse93 .cse94 .cse95 .cse96 .cse97 .cse98 .cse99 .cse100 .cse101) .cse0) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse103 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse102 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse103) v_prenex_29) (+ 4 v_arrayElimCell_41)))) (or (= .cse102 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse103 4 .cse102)) v_prenex_29) 4) 0))))) .cse2) (or (forall ((v_prenex_27 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41)) v_prenex_27) (+ 4 v_arrayElimCell_41)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse2) (or .cse0 (and .cse104 .cse89 (or (forall ((v_arrayElimCell_41 Int) (v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse108 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse105 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse108) v_prenex_29) (+ 4 v_arrayElimCell_41)))) (let ((.cse106 (store .cse108 4 .cse105)) (.cse107 (+ 4 v_arrayElimCell_53))) (or (= .cse105 0) (= (select .cse106 .cse107) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse106) v_prenex_29) .cse107) 0)))))) .cse68) (or .cse68 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_53 Int)) (let ((.cse110 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse111 (+ 4 v_arrayElimCell_53))) (or (= 0 (select (let ((.cse109 (store .cse110 0 v_arrayElimCell_41))) (store .cse109 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse109) v_prenex_21) (+ 4 v_arrayElimCell_41)))) .cse111)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse112 (store .cse110 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse112 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse112) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_21) .cse111) 0))))) (or .cse68 (forall ((v_arrayElimCell_41 Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse114 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse115 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse113 (store .cse114 0 v_arrayElimCell_41))) (store .cse113 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse113) v_prenex_25) (+ 4 v_arrayElimCell_41))))) v_prenex_25) .cse115) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse116 (store .cse114 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse116 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse116) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_25) .cse115) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse90 (or (forall ((v_arrayElimCell_41 Int) (v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse121 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse120 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse121) v_prenex_28) (+ 4 v_arrayElimCell_41)))) (let ((.cse119 (store .cse121 4 .cse120))) (let ((.cse117 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse119) v_prenex_28)) (.cse118 (+ 4 v_arrayElimCell_53))) (or (= (select .cse117 4) 0) (= (select .cse117 .cse118) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse119 .cse118) 0) (= .cse120 0))))))) .cse68) (or .cse68 (forall ((v_arrayElimCell_41 Int) (v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse122 (let ((.cse124 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse124 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse124) v_prenex_28) (+ 4 v_arrayElimCell_41))))) (.cse123 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse122) v_prenex_28) .cse123) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse122 .cse123) 0))))) .cse91 (or .cse36 .cse68) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse128 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse127 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse128) v_prenex_28) (+ 4 v_arrayElimCell_41)))) (let ((.cse125 (store .cse128 4 .cse127)) (.cse126 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse125) v_prenex_28) .cse126) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse125 .cse126) 0) (= .cse127 0)))))) .cse68) .cse92 (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse129 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse129 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse129) v_prenex_26) (+ 4 v_arrayElimCell_41))))) v_prenex_26) (+ 4 v_arrayElimCell_53)) 0))) .cse68) .cse93 (or (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_53 Int)) (let ((.cse134 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse131 (store .cse134 0 v_arrayElimCell_41))) (let ((.cse130 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse131) v_prenex_21) (+ 4 v_arrayElimCell_41))) (.cse132 (+ 4 v_arrayElimCell_53))) (or (= .cse130 0) (= 0 (select (store .cse131 4 .cse130) .cse132)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse133 (store .cse134 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse133 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse133) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_21) .cse132) 0)))))) .cse68) .cse94 .cse95 (or .cse9 (forall ((v_arrayElimCell_41 Int) (v_prenex_12 Int) (v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse135 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse135 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse135) v_prenex_13) (+ 4 v_arrayElimCell_41))))) v_prenex_12) (+ 4 v_arrayElimCell_53)) 0)))) (or .cse9 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse136 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse136 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse136) v_prenex_19) (+ 4 v_arrayElimCell_41))))) v_prenex_19) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse137 (or (forall ((v_prenex_15 Int) (v_arrayElimCell_41 Int) (v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse139 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse140 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse138 (store .cse139 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse138 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse138) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_14) .cse140) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse141 (store .cse139 0 v_arrayElimCell_41))) (store .cse141 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse141) v_prenex_15) (+ 4 v_arrayElimCell_41))))) v_prenex_14) .cse140) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse68) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse142 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse142 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse142) v_prenex_16) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse68) .cse96 .cse97 (or (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse143 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse143 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse143) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse68) .cse98 (or .cse68 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_53 Int)) (let ((.cse149 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse146 (store .cse149 0 v_arrayElimCell_41))) (let ((.cse144 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse146) v_prenex_21) (+ 4 v_arrayElimCell_41))) (.cse145 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse148 (store .cse149 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse148 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse148) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_21)) (.cse147 (+ 4 v_arrayElimCell_53))) (or (= .cse144 0) (= (select .cse145 4) 0) (= 0 (select (store .cse146 4 .cse144) .cse147)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse145 .cse147) 0))))))) .cse99 (or .cse68 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse151 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse152 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse150 (store .cse151 0 v_arrayElimCell_41))) (store .cse150 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse150) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse152) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse153 (store .cse151 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse153 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse153) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse152) 0))))) (or .cse68 (forall ((v_arrayElimCell_41 Int) (v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse158 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse154 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse158) v_prenex_29) (+ 4 v_arrayElimCell_41)))) (let ((.cse155 (store .cse158 4 .cse154))) (let ((.cse156 (+ 4 v_arrayElimCell_53)) (.cse157 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse155) v_prenex_29))) (or (= .cse154 0) (= (select .cse155 .cse156) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse157 .cse156) 0) (= (select .cse157 4) 0)))))))) .cse100 (or .cse42 .cse68) (or (and .cse27 .cse28 .cse37) .cse9) .cse101 (or (forall ((v_arrayElimCell_41 Int) (v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse159 (let ((.cse161 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse161 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse161) v_prenex_29) (+ 4 v_arrayElimCell_41))))) (.cse160 (+ 4 v_arrayElimCell_53))) (or (= (select .cse159 .cse160) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse159) v_prenex_29) .cse160) 0)))) .cse68))) (or .cse0 (and .cse104 .cse137)) (or (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (or (= (let ((.cse163 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse162 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse162 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse162) v_arrayElimCell_42) .cse163)))) v_arrayElimCell_50) .cse163)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse68) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse165 (+ 4 v_arrayElimCell_41))) (let ((.cse164 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse166 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse166 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse166) v_prenex_29) .cse165)))) v_prenex_29))) (or (= (select .cse164 .cse165) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse164 4) 0))))) .cse2) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (let ((.cse168 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse167 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse167 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse167) v_prenex_26) .cse168)))) v_prenex_26) .cse168)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse68) (or .cse68 (forall ((v_prenex_16 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (let ((.cse170 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse169 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse169 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse169) v_prenex_16) .cse170)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse170)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse2 (forall ((v_arrayElimCell_41 Int) (v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse172 (+ 4 v_arrayElimCell_41))) (let ((.cse173 (let ((.cse174 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse174 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse174) v_prenex_29) .cse172))))) (let ((.cse171 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse173) v_prenex_29))) (or (= (select .cse171 .cse172) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse173 .cse172) 0) (= (select .cse171 4) 0))))))))) .cse6) (or .cse0 (and .cse216 .cse217 .cse218 .cse219 .cse220 .cse221 .cse222 .cse223 .cse224 .cse225)) (or .cse0 (and .cse226 .cse227)) (or .cse228 .cse68 .cse6) (or .cse229 (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse230 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse230 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse230) v_prenex_16) .cse54)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or (and (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_29 Int)) (let ((.cse234 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse231 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse234) v_prenex_29) (+ 4 v_arrayElimCell_41)))) (let ((.cse233 (store .cse234 4 .cse231))) (let ((.cse232 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse233) v_prenex_29))) (or (= .cse231 0) (= 0 (select .cse232 .cse54)) (= (select .cse233 .cse54) 0) (= (select .cse232 4) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse235 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse235 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse235) v_prenex_26) (+ 4 v_arrayElimCell_41))))) v_prenex_26) .cse54) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_29 Int)) (let ((.cse236 (let ((.cse237 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse237 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse237) v_prenex_29) (+ 4 v_arrayElimCell_41)))))) (or (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse236) v_prenex_29) .cse54)) (= (select .cse236 .cse54) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_29 Int)) (let ((.cse240 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse238 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse240) v_prenex_29) (+ 4 v_arrayElimCell_41)))) (let ((.cse239 (store .cse240 4 .cse238))) (or (= .cse238 0) (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse239) v_prenex_29) .cse54)) (= (select .cse239 .cse54) 0))))))))) .cse6) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_41 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse241 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse241 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse241) v_prenex_16) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse242 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse242 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse242) v_arrayElimCell_42) (+ 4 v_arrayElimCell_41))))) v_arrayElimCell_50) .cse54) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse6) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse243 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse243 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse243) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or .cse0 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_15 Int) (v_arrayElimCell_41 Int) (v_prenex_14 Int)) (let ((.cse245 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse244 (store .cse245 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse244 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse244) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_14) .cse54) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse246 (store .cse245 0 v_arrayElimCell_41))) (store .cse246 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse246) v_prenex_15) (+ 4 v_arrayElimCell_41))))) v_prenex_14) .cse54) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_12 Int) (v_prenex_13 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse247 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse247 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse247) v_prenex_13) (+ 4 v_arrayElimCell_41))))) v_prenex_12) .cse54) 0)))))) (or .cse0 (and .cse72 (or .cse6 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse248 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse248 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse248) v_prenex_20) (+ 4 v_arrayElimCell_41))))) v_prenex_20) .cse54) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_19 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse249 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse249 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse249) v_prenex_19) (+ 4 v_arrayElimCell_41))))) v_prenex_19) .cse54) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse74 .cse75 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_28 Int)) (let ((.cse250 (let ((.cse251 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse251 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse251) v_prenex_28) (+ 4 v_arrayElimCell_41)))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse250) v_prenex_28) .cse54) 0) (= (select .cse250 .cse54) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_28 Int)) (let ((.cse254 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse253 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse254) v_prenex_28) (+ 4 v_arrayElimCell_41)))) (let ((.cse252 (store .cse254 4 .cse253))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse252) v_prenex_28) .cse54) 0) (= .cse253 0) (= (select .cse252 .cse54) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_28 Int)) (let ((.cse258 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse256 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse258) v_prenex_28) (+ 4 v_arrayElimCell_41)))) (let ((.cse257 (store .cse258 4 .cse256))) (let ((.cse255 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse257) v_prenex_28))) (or (= (select .cse255 .cse54) 0) (= (select .cse255 4) 0) (= .cse256 0) (= (select .cse257 .cse54) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse6) .cse76 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int)) (let ((.cse262 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse260 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse262) v_prenex_23) (+ 4 v_arrayElimCell_41)))) (let ((.cse261 (store .cse262 4 .cse260))) (let ((.cse259 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse261) v_prenex_23))) (or (= 0 (select .cse259 4)) (= (select .cse259 .cse54) 0) (= .cse260 0) (= (select .cse261 .cse54) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int)) (let ((.cse265 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse264 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse265) v_prenex_23) (+ 4 v_arrayElimCell_41)))) (let ((.cse263 (store .cse265 4 .cse264))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse263) v_prenex_23) .cse54) 0) (= .cse264 0) (= (select .cse263 .cse54) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int)) (let ((.cse266 (let ((.cse267 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse267 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse267) v_prenex_23) (+ 4 v_arrayElimCell_41)))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse266) v_prenex_23) .cse54) 0) (= (select .cse266 .cse54) 0))))))))) .cse9) (or .cse9 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse268 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse268 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse268) v_prenex_16) .cse54)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or .cse228 .cse6) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_prenex_13 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse269 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse269 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse269) v_prenex_13) .cse54)))) v_prenex_12) .cse54) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse270 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse270 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse270) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_14) .cse54) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse0))) (or (and (or (and (or (forall ((v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse273 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse272 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse273) v_prenex_28) .cse54))) (let ((.cse271 (store .cse273 4 .cse272))) (or (= (select .cse271 .cse54) 0) (= .cse272 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse271) v_prenex_28) 4) 0)))))) .cse2) .cse274 (or .cse9 (forall ((v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse275 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse276 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse275) v_prenex_28) .cse54))) (or (= (select (store .cse275 4 .cse276) .cse54) 0) (= .cse276 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse277 (or .cse9 .cse278)) .cse6) .cse218 (or .cse9 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_19 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse279 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse279 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse279) v_prenex_19) .cse54)))) v_prenex_19) .cse54))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or .cse280 .cse6) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_25 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse281 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse281 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse281) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_25) .cse54))))))) (or .cse9 (and .cse282 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_21 Int)) (let ((.cse283 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse284 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse283))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse283 4 (select (select .cse284 |c_ULTIMATE.start_append_~item~0#1.base|) .cse54))) v_prenex_21) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_21) .cse54) 0) (= (select (store .cse283 4 (select (select .cse284 v_prenex_21) .cse54)) .cse54) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse221 .cse222 .cse224) .cse0) (or (and (or .cse68 (forall ((v_prenex_21 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse286 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse287 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse286))) (let ((.cse285 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse286 4 (select (select .cse287 |c_ULTIMATE.start_append_~item~0#1.base|) .cse54))) v_prenex_21)) (.cse288 (+ 4 v_arrayElimCell_53))) (or (= (select .cse285 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_21) .cse54) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (store .cse286 4 (select (select .cse287 v_prenex_21) .cse54)) .cse288) 0) (= (select .cse285 .cse288) 0))))))) .cse216 (or .cse229 (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse289 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse289 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse289) v_prenex_16) .cse54)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_53)) 0)))) (or (forall ((v_arrayElimCell_50 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse290 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse290 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse290) v_arrayElimCell_42) .cse54)))) v_arrayElimCell_50) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse68 .cse6) .cse217 .cse218 (or .cse9 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_53 Int)) (let ((.cse291 (let ((.cse293 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse293 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse293) v_prenex_23) .cse54)))) (.cse292 (+ 4 v_arrayElimCell_53))) (or (= (select .cse291 .cse292) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse291) v_prenex_23) .cse292) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_23 Int) (v_arrayElimCell_53 Int)) (let ((.cse297 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse296 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse297) v_prenex_23) .cse54))) (let ((.cse294 (store .cse297 4 .cse296)) (.cse295 (+ 4 v_arrayElimCell_53))) (or (= (select .cse294 .cse295) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse294) v_prenex_23) .cse295) 0) (= .cse296 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_53 Int)) (let ((.cse302 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse301 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse302) v_prenex_23) .cse54))) (let ((.cse298 (store .cse302 4 .cse301))) (let ((.cse299 (+ 4 v_arrayElimCell_53)) (.cse300 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse298) v_prenex_23))) (or (= (select .cse298 .cse299) 0) (= (select .cse300 .cse299) 0) (= .cse301 0) (= (select .cse300 4) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse219 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse303 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse303 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse303) v_prenex_20) .cse54)))) v_prenex_20) (+ 4 v_arrayElimCell_53)) 0))) .cse68 .cse6) (or .cse9 (forall ((v_prenex_12 Int) (v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse304 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse304 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse304) v_prenex_13) .cse54)))) v_prenex_12) (+ 4 v_arrayElimCell_53)) 0)))) (or (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse305 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse305 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse305) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_14) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse68) .cse220 .cse226 (or .cse9 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse306 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse306 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse306) v_prenex_19) .cse54)))) v_prenex_19) (+ 4 v_arrayElimCell_53)) 0)))) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_53 Int)) (let ((.cse307 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse310 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse307))) (let ((.cse308 (select (select .cse310 v_prenex_21) .cse54)) (.cse309 (+ 4 v_arrayElimCell_53))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (store .cse307 4 .cse308) .cse309) 0) (= .cse308 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse307 4 (select (select .cse310 |c_ULTIMATE.start_append_~item~0#1.base|) .cse54))) v_prenex_21) .cse309) 0)))))) .cse68) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_53 Int)) (let ((.cse311 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse312 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse311)) (.cse313 (+ 4 v_arrayElimCell_53))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (store .cse311 4 (select (select .cse312 v_prenex_21) .cse54)) .cse313) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse311 4 (select (select .cse312 |c_ULTIMATE.start_append_~item~0#1.base|) .cse54))) v_prenex_21) .cse313) 0))))) .cse68) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_53 Int)) (let ((.cse317 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse316 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse317) v_prenex_28) .cse54))) (let ((.cse314 (store .cse317 4 .cse316)) (.cse315 (+ 4 v_arrayElimCell_53))) (or (= (select .cse314 .cse315) 0) (= .cse316 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse314) v_prenex_28) .cse315) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_53 Int)) (let ((.cse322 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse320 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse322) v_prenex_28) .cse54))) (let ((.cse318 (store .cse322 4 .cse320))) (let ((.cse321 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse318) v_prenex_28)) (.cse319 (+ 4 v_arrayElimCell_53))) (or (= (select .cse318 .cse319) 0) (= .cse320 0) (= (select .cse321 4) 0) (= (select .cse321 .cse319) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_53 Int)) (let ((.cse323 (let ((.cse325 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse325 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse325) v_prenex_28) .cse54)))) (.cse324 (+ 4 v_arrayElimCell_53))) (or (= (select .cse323 .cse324) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse323) v_prenex_28) .cse324) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse68 .cse6) (or .cse68 (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse326 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse326 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse326) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) v_prenex_25) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse221 .cse227 .cse222 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse327 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse327 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse327) |c_ULTIMATE.start_append_~item~0#1.base|) .cse54)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_53)) 0))) .cse68) .cse223 .cse224 (or .cse68 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_29 Int) (v_arrayElimCell_53 Int)) (let ((.cse332 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse331 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse332) v_prenex_29) .cse54))) (let ((.cse330 (store .cse332 4 .cse331))) (let ((.cse329 (+ 4 v_arrayElimCell_53)) (.cse328 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse330) v_prenex_29))) (or (= (select .cse328 .cse329) 0) (= (select .cse330 .cse329) 0) (= (select .cse328 4) 0) (= .cse331 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_29 Int) (v_arrayElimCell_53 Int)) (let ((.cse336 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse335 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse336) v_prenex_29) .cse54))) (let ((.cse333 (store .cse336 4 .cse335)) (.cse334 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse333) v_prenex_29) .cse334) 0) (= (select .cse333 .cse334) 0) (= .cse335 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_29 Int) (v_arrayElimCell_53 Int)) (let ((.cse337 (let ((.cse339 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse339 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse339) v_prenex_29) .cse54)))) (.cse338 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse337) v_prenex_29) .cse338) 0) (= (select .cse337 .cse338) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse340 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse340 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse340) v_prenex_26) .cse54)))) v_prenex_26) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse6) (or .cse69 .cse70 (and .cse81 .cse82) .cse71) .cse225) .cse0) (or .cse6 (and (or .cse59 .cse3) (or (and .cse38 .cse26 (or .cse0 (and .cse25 .cse33)) .cse39 (or .cse0 (and .cse23 .cse24 .cse27 .cse28 .cse30 .cse31 .cse29 .cse32 .cse34 .cse37 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_20 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse341 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse341 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse341) v_prenex_20) (+ 4 v_arrayElimCell_41))))) v_prenex_20) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse43)) .cse40 .cse35 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_53 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse342 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse342 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse342) v_arrayElimCell_42) (+ 4 v_arrayElimCell_41))))) v_arrayElimCell_50) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse41) .cse9) (or .cse49 .cse59) (or (and .cse1 .cse11 .cse12 .cse10 .cse13 .cse16 .cse17 (or .cse9 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_20 Int) (v_arrayElimCell_53 Int)) (= (let ((.cse344 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse343 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse343 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse343) v_prenex_20) .cse344)))) v_prenex_20) .cse344)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse7 .cse8)) .cse14 .cse44 .cse15) .cse0) .cse46 (or .cse45 .cse0 .cse2) (or .cse0 .cse47 .cse2) .cse48 .cse50 (or .cse9 (and (or (and .cse20 .cse22) .cse0) .cse21 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_53 Int) (v_arrayElimCell_42 Int)) (= (let ((.cse346 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse345 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse345 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse345) v_arrayElimCell_42) .cse346)))) v_arrayElimCell_50) .cse346)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or .cse51 .cse0 .cse2)))))))) is different from true