./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/test-0232-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/memsafety/test-0232-2.c -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 2ef8f73da672fbe818a57fc74475b2403bb1bdf7f0e09b3ac0d1e9eb77287764 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:24:32,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:24:32,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:24:32,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:24:32,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:24:32,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:24:32,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:24:32,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:24:32,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:24:32,550 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:24:32,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:24:32,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:24:32,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:24:32,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:24:32,551 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:24:32,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:24:32,552 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:24:32,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:24:32,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:24:32,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:24:32,552 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:24:32,552 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:24:32,552 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:24:32,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:24:32,552 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:24:32,552 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:24:32,552 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:24:32,552 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:24:32,552 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:24:32,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:24:32,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:24:32,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:24:32,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:24:32,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:32,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:24:32,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:24:32,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:24:32,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:24:32,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:32,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:24:32,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:24:32,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:24:32,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:24:32,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:24:32,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:24:32,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:24:32,554 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 -> 2ef8f73da672fbe818a57fc74475b2403bb1bdf7f0e09b3ac0d1e9eb77287764 [2025-04-29 11:24:32,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:24:32,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:24:32,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:24:32,791 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:24:32,792 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:24:32,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232-2.c [2025-04-29 11:24:34,095 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1e4c4bf/6fe6122e130a4ccbb8e35789b145a788/FLAG5045db554 [2025-04-29 11:24:34,334 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:24:34,335 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0232-2.c [2025-04-29 11:24:34,336 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:24:34,336 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:24:34,340 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1e4c4bf/6fe6122e130a4ccbb8e35789b145a788/FLAG5045db554 [2025-04-29 11:24:35,146 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1e4c4bf/6fe6122e130a4ccbb8e35789b145a788 [2025-04-29 11:24:35,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:24:35,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:24:35,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:24:35,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:24:35,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:24:35,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398a9ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35, skipping insertion in model container [2025-04-29 11:24:35,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:24:35,300 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:24:35,307 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:24:35,333 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:24:35,347 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:24:35,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35 WrapperNode [2025-04-29 11:24:35,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:24:35,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:24:35,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:24:35,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:24:35,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,379 INFO L138 Inliner]: procedures = 13, calls = 31, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2025-04-29 11:24:35,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:24:35,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:24:35,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:24:35,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:24:35,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,410 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [8, 12]. 60 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 5 writes are split as follows [2, 3]. [2025-04-29 11:24:35,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,417 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,418 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:24:35,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:24:35,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:24:35,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:24:35,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35" (1/1) ... [2025-04-29 11:24:35,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:35,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:35,461 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-04-29 11:24:35,464 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-04-29 11:24:35,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:24:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:24:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:24:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:24:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:24:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:24:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:24:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:24:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:24:35,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:24:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:24:35,546 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:24:35,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:24:35,866 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-04-29 11:24:35,866 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:24:35,884 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:24:35,884 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 11:24:35,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:24:35 BoogieIcfgContainer [2025-04-29 11:24:35,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:24:35,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:24:35,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:24:35,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:24:35,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:24:35" (1/3) ... [2025-04-29 11:24:35,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac11633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:24:35, skipping insertion in model container [2025-04-29 11:24:35,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:35" (2/3) ... [2025-04-29 11:24:35,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac11633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:24:35, skipping insertion in model container [2025-04-29 11:24:35,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:24:35" (3/3) ... [2025-04-29 11:24:35,897 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0232-2.c [2025-04-29 11:24:35,908 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:24:35,910 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0232-2.c that has 1 procedures, 95 locations, 100 edges, 1 initial locations, 2 loop locations, and 48 error locations. [2025-04-29 11:24:35,946 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:24:35,958 INFO L340 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;@237ed850, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:24:35,958 INFO L341 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2025-04-29 11:24:35,961 INFO L278 IsEmpty]: Start isEmpty. Operand has 95 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 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-04-29 11:24:35,965 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-29 11:24:35,966 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:35,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-29 11:24:35,967 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:35,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:35,971 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2025-04-29 11:24:35,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:35,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424982531] [2025-04-29 11:24:35,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:35,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:36,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:24:36,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:24:36,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:36,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:36,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:36,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424982531] [2025-04-29 11:24:36,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424982531] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:36,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:36,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:36,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15257937] [2025-04-29 11:24:36,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:36,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:24:36,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:36,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:24:36,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:36,205 INFO L87 Difference]: Start difference. First operand has 95 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:36,332 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2025-04-29 11:24:36,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:24:36,336 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-29 11:24:36,336 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:36,340 INFO L225 Difference]: With dead ends: 87 [2025-04-29 11:24:36,340 INFO L226 Difference]: Without dead ends: 85 [2025-04-29 11:24:36,343 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:36,347 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 84 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:36,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 79 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-29 11:24:36,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-04-29 11:24:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 45 states have (on average 1.9555555555555555) 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-04-29 11:24:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2025-04-29 11:24:36,374 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 4 [2025-04-29 11:24:36,374 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:36,375 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2025-04-29 11:24:36,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:36,375 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2025-04-29 11:24:36,376 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-29 11:24:36,376 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:36,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-29 11:24:36,377 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:24:36,377 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:36,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-04-29 11:24:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:36,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968153642] [2025-04-29 11:24:36,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:36,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:36,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:24:36,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:24:36,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:36,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:36,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:36,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968153642] [2025-04-29 11:24:36,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968153642] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:36,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:36,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:36,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189268953] [2025-04-29 11:24:36,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:36,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:24:36,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:36,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:24:36,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:36,535 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:36,665 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2025-04-29 11:24:36,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:24:36,665 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-29 11:24:36,665 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:36,666 INFO L225 Difference]: With dead ends: 101 [2025-04-29 11:24:36,666 INFO L226 Difference]: Without dead ends: 101 [2025-04-29 11:24:36,666 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:36,667 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 76 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:36,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 88 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:36,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-29 11:24:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2025-04-29 11:24:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 89 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2025-04-29 11:24:36,672 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 4 [2025-04-29 11:24:36,672 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:36,672 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2025-04-29 11:24:36,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:36,672 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2025-04-29 11:24:36,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:24:36,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:36,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:24:36,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:24:36,675 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:36,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:36,676 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2025-04-29 11:24:36,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:36,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655514888] [2025-04-29 11:24:36,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:36,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:36,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:24:36,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:24:36,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:36,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:36,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:36,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655514888] [2025-04-29 11:24:36,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655514888] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:36,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:36,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:36,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482105297] [2025-04-29 11:24:36,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:36,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:36,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:36,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:36,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:36,720 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:36,774 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2025-04-29 11:24:36,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:36,775 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:24:36,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:36,775 INFO L225 Difference]: With dead ends: 86 [2025-04-29 11:24:36,777 INFO L226 Difference]: Without dead ends: 86 [2025-04-29 11:24:36,777 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:36,777 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 12 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:36,777 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 98 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:36,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-29 11:24:36,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-04-29 11:24:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 85 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-04-29 11:24:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2025-04-29 11:24:36,785 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 5 [2025-04-29 11:24:36,785 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:36,785 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2025-04-29 11:24:36,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:36,785 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2025-04-29 11:24:36,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:24:36,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:36,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:24:36,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:24:36,786 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:36,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:36,786 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2025-04-29 11:24:36,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:36,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050408908] [2025-04-29 11:24:36,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:36,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:36,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:24:36,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:24:36,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:36,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:36,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:36,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050408908] [2025-04-29 11:24:36,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050408908] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:36,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:36,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:36,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304846274] [2025-04-29 11:24:36,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:36,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:36,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:36,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:36,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:36,858 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:36,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:36,897 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2025-04-29 11:24:36,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:36,897 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:24:36,897 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:36,898 INFO L225 Difference]: With dead ends: 82 [2025-04-29 11:24:36,898 INFO L226 Difference]: Without dead ends: 82 [2025-04-29 11:24:36,898 INFO L436 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-04-29 11:24:36,898 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 103 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-04-29 11:24:36,898 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 103 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:36,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-29 11:24:36,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-04-29 11:24:36,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.6296296296296295) 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-04-29 11:24:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2025-04-29 11:24:36,905 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 5 [2025-04-29 11:24:36,905 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:36,905 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2025-04-29 11:24:36,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:36,905 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2025-04-29 11:24:36,906 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:24:36,906 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:36,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:36,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:24:36,906 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:36,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2025-04-29 11:24:36,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:36,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908750377] [2025-04-29 11:24:36,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:36,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:36,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:24:36,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:24:36,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:36,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:37,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:37,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908750377] [2025-04-29 11:24:37,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908750377] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:37,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:37,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:24:37,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249575917] [2025-04-29 11:24:37,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:37,119 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:24:37,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:37,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:24:37,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:24:37,120 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:37,270 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2025-04-29 11:24:37,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:24:37,270 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:24:37,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:37,271 INFO L225 Difference]: With dead ends: 92 [2025-04-29 11:24:37,271 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:24:37,271 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-04-29 11:24:37,271 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 20 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 377 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-04-29 11:24:37,272 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 377 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:24:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2025-04-29 11:24:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 87 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:37,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2025-04-29 11:24:37,275 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 10 [2025-04-29 11:24:37,275 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:37,275 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2025-04-29 11:24:37,275 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:37,275 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2025-04-29 11:24:37,275 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:24:37,275 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:37,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:37,275 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:24:37,275 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:37,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:37,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1762075788, now seen corresponding path program 1 times [2025-04-29 11:24:37,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:37,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660912534] [2025-04-29 11:24:37,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:37,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:37,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:24:37,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:24:37,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:37,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:37,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:37,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660912534] [2025-04-29 11:24:37,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660912534] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:37,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:37,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:24:37,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028658421] [2025-04-29 11:24:37,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:37,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:24:37,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:37,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:24:37,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:24:37,365 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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-04-29 11:24:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:37,420 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2025-04-29 11:24:37,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:24:37,420 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-04-29 11:24:37,420 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:37,420 INFO L225 Difference]: With dead ends: 87 [2025-04-29 11:24:37,420 INFO L226 Difference]: Without dead ends: 87 [2025-04-29 11:24:37,421 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-04-29 11:24:37,421 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 79 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:37,421 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 95 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-04-29 11:24:37,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-04-29 11:24:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 83 states have internal predecessors, (90), 0 states have call successors, (0), 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-04-29 11:24:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2025-04-29 11:24:37,427 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 11 [2025-04-29 11:24:37,427 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:37,427 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2025-04-29 11:24:37,427 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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-04-29 11:24:37,427 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2025-04-29 11:24:37,427 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:24:37,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:37,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:37,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:24:37,428 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:37,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:37,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1870974680, now seen corresponding path program 1 times [2025-04-29 11:24:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:37,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293023079] [2025-04-29 11:24:37,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:37,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:37,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:24:37,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:24:37,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:37,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:37,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:37,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293023079] [2025-04-29 11:24:37,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293023079] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:37,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:37,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:24:37,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678397939] [2025-04-29 11:24:37,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:37,533 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:24:37,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:37,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:24:37,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:24:37,534 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:37,660 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2025-04-29 11:24:37,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:24:37,660 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 11:24:37,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:37,661 INFO L225 Difference]: With dead ends: 95 [2025-04-29 11:24:37,661 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 11:24:37,661 INFO L436 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-04-29 11:24:37,662 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 51 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:37,662 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 155 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 11:24:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2025-04-29 11:24:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.5614035087719298) 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-04-29 11:24:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2025-04-29 11:24:37,665 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 17 [2025-04-29 11:24:37,665 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:37,665 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2025-04-29 11:24:37,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:37,666 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2025-04-29 11:24:37,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:24:37,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:37,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:37,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:24:37,666 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:37,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1870974681, now seen corresponding path program 1 times [2025-04-29 11:24:37,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:37,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403442950] [2025-04-29 11:24:37,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:37,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:37,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:24:37,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:24:37,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:37,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:37,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:37,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403442950] [2025-04-29 11:24:37,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403442950] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:37,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:37,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:24:37,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052167036] [2025-04-29 11:24:37,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:37,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:24:37,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:37,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:24:37,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:24:37,879 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:37,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:37,994 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2025-04-29 11:24:37,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:24:37,995 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 11:24:37,995 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:37,995 INFO L225 Difference]: With dead ends: 95 [2025-04-29 11:24:37,995 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 11:24:37,996 INFO L436 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-04-29 11:24:37,996 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 59 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 164 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-04-29 11:24:37,996 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 164 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 11:24:37,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2025-04-29 11:24:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.543859649122807) 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-04-29 11:24:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2025-04-29 11:24:37,999 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 17 [2025-04-29 11:24:38,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:38,002 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2025-04-29 11:24:38,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:38,002 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2025-04-29 11:24:38,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:24:38,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:38,002 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-04-29 11:24:38,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:24:38,002 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:38,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:38,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1552087841, now seen corresponding path program 1 times [2025-04-29 11:24:38,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:38,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977302387] [2025-04-29 11:24:38,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:38,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:38,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:24:38,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:24:38,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:38,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:38,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:38,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977302387] [2025-04-29 11:24:38,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977302387] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:38,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:38,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:24:38,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487055499] [2025-04-29 11:24:38,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:38,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:24:38,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:38,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:24:38,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:38,112 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:38,182 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2025-04-29 11:24:38,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:24:38,183 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:24:38,183 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:38,183 INFO L225 Difference]: With dead ends: 79 [2025-04-29 11:24:38,183 INFO L226 Difference]: Without dead ends: 79 [2025-04-29 11:24:38,183 INFO L436 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-04-29 11:24:38,184 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 43 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 171 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-04-29 11:24:38,184 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 171 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:38,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-29 11:24:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2025-04-29 11:24:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 75 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2025-04-29 11:24:38,186 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 19 [2025-04-29 11:24:38,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:38,186 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2025-04-29 11:24:38,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:38,186 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2025-04-29 11:24:38,186 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:24:38,186 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:38,186 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-04-29 11:24:38,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:24:38,187 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:38,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:38,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1878845783, now seen corresponding path program 1 times [2025-04-29 11:24:38,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:38,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167755932] [2025-04-29 11:24:38,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:38,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:38,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:24:38,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:24:38,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:38,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:38,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:38,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167755932] [2025-04-29 11:24:38,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167755932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:38,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:38,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:24:38,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351538989] [2025-04-29 11:24:38,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:38,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:24:38,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:38,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:24:38,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:24:38,302 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:38,398 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2025-04-29 11:24:38,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:24:38,399 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:24:38,399 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:38,399 INFO L225 Difference]: With dead ends: 78 [2025-04-29 11:24:38,399 INFO L226 Difference]: Without dead ends: 78 [2025-04-29 11:24:38,400 INFO L436 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-04-29 11:24:38,400 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:38,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 138 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-29 11:24:38,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2025-04-29 11:24:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.5098039215686274) 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-04-29 11:24:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2025-04-29 11:24:38,408 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 20 [2025-04-29 11:24:38,408 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:38,408 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2025-04-29 11:24:38,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:38,408 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2025-04-29 11:24:38,408 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:24:38,409 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:38,409 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-04-29 11:24:38,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:24:38,409 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:38,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:38,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1878845782, now seen corresponding path program 1 times [2025-04-29 11:24:38,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:38,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962985345] [2025-04-29 11:24:38,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:38,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:38,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:24:38,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:24:38,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:38,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:38,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:38,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962985345] [2025-04-29 11:24:38,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962985345] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:38,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:38,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:24:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341813608] [2025-04-29 11:24:38,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:38,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:24:38,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:38,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:24:38,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:24:38,610 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:38,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:38,736 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2025-04-29 11:24:38,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:24:38,738 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:24:38,738 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:38,738 INFO L225 Difference]: With dead ends: 77 [2025-04-29 11:24:38,738 INFO L226 Difference]: Without dead ends: 77 [2025-04-29 11:24:38,738 INFO L436 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-04-29 11:24:38,739 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 38 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:38,739 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 206 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:38,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-29 11:24:38,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2025-04-29 11:24:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.4901960784313726) 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-04-29 11:24:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2025-04-29 11:24:38,741 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 20 [2025-04-29 11:24:38,741 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:38,741 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2025-04-29 11:24:38,741 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:38,741 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2025-04-29 11:24:38,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:24:38,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:38,745 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:38,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:24:38,745 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:38,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:38,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1844448410, now seen corresponding path program 1 times [2025-04-29 11:24:38,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:38,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669205391] [2025-04-29 11:24:38,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:38,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:38,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:24:38,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:24:38,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:38,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:38,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669205391] [2025-04-29 11:24:38,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669205391] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:38,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102445752] [2025-04-29 11:24:38,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:38,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:38,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:38,949 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-04-29 11:24:38,951 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-04-29 11:24:38,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:24:39,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:24:39,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:39,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:39,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-29 11:24:39,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:39,098 INFO L354 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-04-29 11:24:39,125 INFO L325 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-04-29 11:24:39,126 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-04-29 11:24:39,146 INFO L354 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 17 treesize of output 9 [2025-04-29 11:24:39,168 INFO L354 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-04-29 11:24:39,200 INFO L354 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 17 treesize of output 9 [2025-04-29 11:24:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:39,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:39,273 INFO L354 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-04-29 11:24:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:39,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102445752] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:39,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:39,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-04-29 11:24:39,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114510705] [2025-04-29 11:24:39,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:39,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:24:39,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:39,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:24:39,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:24:39,367 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 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-04-29 11:24:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:39,615 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2025-04-29 11:24:39,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:24:39,615 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 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-04-29 11:24:39,615 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:39,616 INFO L225 Difference]: With dead ends: 76 [2025-04-29 11:24:39,616 INFO L226 Difference]: Without dead ends: 76 [2025-04-29 11:24:39,616 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:24:39,616 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 74 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:39,617 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 339 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:24:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-29 11:24:39,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2025-04-29 11:24:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.4705882352941178) 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-04-29 11:24:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2025-04-29 11:24:39,618 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 21 [2025-04-29 11:24:39,618 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:39,618 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2025-04-29 11:24:39,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 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-04-29 11:24:39,620 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2025-04-29 11:24:39,620 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:24:39,620 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:39,621 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:39,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:24:39,821 WARN L466 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-04-29 11:24:39,821 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:39,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:39,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1844448411, now seen corresponding path program 1 times [2025-04-29 11:24:39,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:39,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428256201] [2025-04-29 11:24:39,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:39,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:24:39,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:24:39,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:39,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:40,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428256201] [2025-04-29 11:24:40,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428256201] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:40,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412766651] [2025-04-29 11:24:40,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:40,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:40,054 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-04-29 11:24:40,056 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-04-29 11:24:40,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:24:40,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:24:40,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:40,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:40,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-29 11:24:40,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:40,207 INFO L354 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-04-29 11:24:40,215 INFO L354 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-04-29 11:24:40,261 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 11:24:40,262 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2025-04-29 11:24:40,282 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 11:24:40,282 INFO L354 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-04-29 11:24:40,304 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-04-29 11:24:40,308 INFO L354 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 26 treesize of output 14 [2025-04-29 11:24:40,338 INFO L354 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-04-29 11:24:40,343 INFO L354 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-04-29 11:24:40,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-04-29 11:24:40,401 INFO L354 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 26 treesize of output 14 [2025-04-29 11:24:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:40,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:40,601 INFO L354 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-04-29 11:24:40,612 INFO L354 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-04-29 11:24:40,615 INFO L354 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-04-29 11:24:40,758 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:40,759 INFO L354 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-04-29 11:24:40,773 INFO L354 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-04-29 11:24:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:40,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412766651] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:40,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:40,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-04-29 11:24:40,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339413073] [2025-04-29 11:24:40,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:40,880 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:24:40,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:40,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:24:40,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:24:40,881 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 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-04-29 11:24:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:41,269 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2025-04-29 11:24:41,269 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:24:41,270 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 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-04-29 11:24:41,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:41,270 INFO L225 Difference]: With dead ends: 75 [2025-04-29 11:24:41,270 INFO L226 Difference]: Without dead ends: 75 [2025-04-29 11:24:41,271 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:24:41,271 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 123 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:41,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 437 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:24:41,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-29 11:24:41,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-04-29 11:24:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.4509803921568627) 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-04-29 11:24:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2025-04-29 11:24:41,273 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 21 [2025-04-29 11:24:41,273 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:41,273 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2025-04-29 11:24:41,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 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-04-29 11:24:41,273 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2025-04-29 11:24:41,274 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:24:41,274 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:41,274 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-04-29 11:24:41,280 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-04-29 11:24:41,478 WARN L466 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-04-29 11:24:41,478 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:41,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1885322907, now seen corresponding path program 1 times [2025-04-29 11:24:41,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:41,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984442745] [2025-04-29 11:24:41,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:41,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:41,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:24:41,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:24:41,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:41,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:41,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:41,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984442745] [2025-04-29 11:24:41,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984442745] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:41,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:41,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:24:41,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994123135] [2025-04-29 11:24:41,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:41,648 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:24:41,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:41,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:24:41,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:24:41,648 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:41,793 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2025-04-29 11:24:41,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:24:41,794 INFO L79 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-04-29 11:24:41,794 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:41,794 INFO L225 Difference]: With dead ends: 110 [2025-04-29 11:24:41,794 INFO L226 Difference]: Without dead ends: 110 [2025-04-29 11:24:41,795 INFO L436 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-04-29 11:24:41,795 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 36 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:41,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 258 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:41,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-29 11:24:41,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 85. [2025-04-29 11:24:41,797 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-04-29 11:24:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2025-04-29 11:24:41,797 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 21 [2025-04-29 11:24:41,797 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:41,797 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2025-04-29 11:24:41,797 INFO L486 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-04-29 11:24:41,797 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2025-04-29 11:24:41,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:24:41,797 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:41,797 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-04-29 11:24:41,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:24:41,798 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:41,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:41,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1684531927, now seen corresponding path program 1 times [2025-04-29 11:24:41,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:41,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663585383] [2025-04-29 11:24:41,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:41,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:41,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:24:41,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:24:41,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:41,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:42,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:42,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663585383] [2025-04-29 11:24:42,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663585383] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:42,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:42,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:24:42,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491879665] [2025-04-29 11:24:42,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:42,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:24:42,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:42,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:24:42,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:24:42,007 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-04-29 11:24:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:42,211 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2025-04-29 11:24:42,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:24:42,212 INFO L79 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-04-29 11:24:42,212 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:42,212 INFO L225 Difference]: With dead ends: 109 [2025-04-29 11:24:42,212 INFO L226 Difference]: Without dead ends: 109 [2025-04-29 11:24:42,212 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:24:42,214 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 36 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:42,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 233 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:42,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-29 11:24:42,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 86. [2025-04-29 11:24:42,216 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-04-29 11:24:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2025-04-29 11:24:42,216 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 22 [2025-04-29 11:24:42,216 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:42,216 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2025-04-29 11:24:42,216 INFO L486 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-04-29 11:24:42,216 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2025-04-29 11:24:42,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:24:42,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:42,216 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-04-29 11:24:42,218 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:24:42,218 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:42,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:42,218 INFO L85 PathProgramCache]: Analyzing trace with hash -680882083, now seen corresponding path program 1 times [2025-04-29 11:24:42,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:42,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177408564] [2025-04-29 11:24:42,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:42,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:42,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:24:42,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:24:42,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:42,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:42,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:42,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177408564] [2025-04-29 11:24:42,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177408564] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:42,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:42,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:24:42,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800165965] [2025-04-29 11:24:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:42,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:24:42,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:42,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:24:42,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:24:42,375 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), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:42,526 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2025-04-29 11:24:42,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:24:42,526 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:24:42,526 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:42,527 INFO L225 Difference]: With dead ends: 100 [2025-04-29 11:24:42,527 INFO L226 Difference]: Without dead ends: 100 [2025-04-29 11:24:42,527 INFO L436 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-04-29 11:24:42,527 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:42,527 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 188 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:42,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-29 11:24:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2025-04-29 11:24:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 86 states have internal predecessors, (90), 0 states have call successors, (0), 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-04-29 11:24:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2025-04-29 11:24:42,529 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 23 [2025-04-29 11:24:42,529 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:42,529 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2025-04-29 11:24:42,529 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:42,530 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2025-04-29 11:24:42,530 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:24:42,530 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:42,530 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-04-29 11:24:42,530 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:24:42,530 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:42,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash 367492012, now seen corresponding path program 1 times [2025-04-29 11:24:42,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:42,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502363123] [2025-04-29 11:24:42,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:42,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:24:42,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:24:42,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:42,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:42,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:42,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502363123] [2025-04-29 11:24:42,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502363123] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:42,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:42,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:24:42,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709007471] [2025-04-29 11:24:42,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:42,613 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:24:42,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:42,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:24:42,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:24:42,614 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:42,708 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2025-04-29 11:24:42,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:24:42,708 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:24:42,708 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:42,709 INFO L225 Difference]: With dead ends: 86 [2025-04-29 11:24:42,709 INFO L226 Difference]: Without dead ends: 86 [2025-04-29 11:24:42,709 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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-04-29 11:24:42,709 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 116 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:42,709 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 62 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-29 11:24:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-04-29 11:24:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 66 states have (on average 1.3484848484848484) 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-04-29 11:24:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2025-04-29 11:24:42,711 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 24 [2025-04-29 11:24:42,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:42,711 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2025-04-29 11:24:42,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:42,711 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2025-04-29 11:24:42,711 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:24:42,711 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:42,711 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-04-29 11:24:42,711 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:24:42,713 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:42,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:42,714 INFO L85 PathProgramCache]: Analyzing trace with hash 367492013, now seen corresponding path program 1 times [2025-04-29 11:24:42,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:42,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615000359] [2025-04-29 11:24:42,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:42,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:24:42,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:24:42,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:42,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:42,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:42,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615000359] [2025-04-29 11:24:42,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615000359] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:42,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:42,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:42,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419959532] [2025-04-29 11:24:42,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:42,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:24:42,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:42,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:24:42,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:42,757 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:42,785 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2025-04-29 11:24:42,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:24:42,785 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:24:42,786 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:42,786 INFO L225 Difference]: With dead ends: 80 [2025-04-29 11:24:42,786 INFO L226 Difference]: Without dead ends: 80 [2025-04-29 11:24:42,786 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:42,787 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 79 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:42,787 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 38 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:42,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-29 11:24:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-04-29 11:24:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.2575757575757576) 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-04-29 11:24:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2025-04-29 11:24:42,788 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 24 [2025-04-29 11:24:42,788 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:42,788 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2025-04-29 11:24:42,789 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:42,789 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2025-04-29 11:24:42,789 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:24:42,790 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:42,790 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-04-29 11:24:42,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:24:42,791 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:42,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:42,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1492649471, now seen corresponding path program 1 times [2025-04-29 11:24:42,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:42,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127708346] [2025-04-29 11:24:42,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:42,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:42,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:24:42,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:24:42,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:42,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:42,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:42,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127708346] [2025-04-29 11:24:42,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127708346] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:42,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:42,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:24:42,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230849964] [2025-04-29 11:24:42,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:42,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:24:42,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:42,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:24:42,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:42,859 INFO L87 Difference]: Start difference. First operand 80 states and 83 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-04-29 11:24:42,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:42,898 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2025-04-29 11:24:42,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:24:42,899 INFO L79 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-04-29 11:24:42,899 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:42,899 INFO L225 Difference]: With dead ends: 79 [2025-04-29 11:24:42,899 INFO L226 Difference]: Without dead ends: 79 [2025-04-29 11:24:42,899 INFO L436 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-04-29 11:24:42,900 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 26 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 138 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-04-29 11:24:42,900 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 138 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:42,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-29 11:24:42,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-04-29 11:24:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 66 states have (on average 1.2424242424242424) 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-04-29 11:24:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-04-29 11:24:42,902 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 25 [2025-04-29 11:24:42,902 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:42,902 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-04-29 11:24:42,902 INFO L486 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-04-29 11:24:42,902 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-04-29 11:24:42,902 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:24:42,902 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:42,902 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-04-29 11:24:42,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:24:42,902 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:42,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:42,903 INFO L85 PathProgramCache]: Analyzing trace with hash 972506764, now seen corresponding path program 1 times [2025-04-29 11:24:42,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:42,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849790445] [2025-04-29 11:24:42,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:42,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:42,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:24:42,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:24:42,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:42,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:42,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:42,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849790445] [2025-04-29 11:24:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849790445] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:42,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:24:42,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216702108] [2025-04-29 11:24:42,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:42,970 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:24:42,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:42,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:24:42,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:42,971 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:43,038 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2025-04-29 11:24:43,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:24:43,039 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:24:43,039 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:43,039 INFO L225 Difference]: With dead ends: 81 [2025-04-29 11:24:43,039 INFO L226 Difference]: Without dead ends: 81 [2025-04-29 11:24:43,039 INFO L436 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-04-29 11:24:43,040 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 26 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:43,040 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 119 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-04-29 11:24:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-04-29 11:24:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.2272727272727273) 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-04-29 11:24:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2025-04-29 11:24:43,041 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 26 [2025-04-29 11:24:43,041 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:43,042 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2025-04-29 11:24:43,042 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:43,042 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2025-04-29 11:24:43,043 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:24:43,043 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:43,043 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-04-29 11:24:43,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:24:43,043 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:43,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:43,043 INFO L85 PathProgramCache]: Analyzing trace with hash 82938723, now seen corresponding path program 1 times [2025-04-29 11:24:43,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:43,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368175699] [2025-04-29 11:24:43,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:43,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:43,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:24:43,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:24:43,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:43,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:43,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:43,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368175699] [2025-04-29 11:24:43,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368175699] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:43,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:43,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:24:43,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54885352] [2025-04-29 11:24:43,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:43,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:24:43,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:43,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:24:43,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:24:43,280 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:43,558 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2025-04-29 11:24:43,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:24:43,559 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:24:43,559 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:43,559 INFO L225 Difference]: With dead ends: 98 [2025-04-29 11:24:43,559 INFO L226 Difference]: Without dead ends: 98 [2025-04-29 11:24:43,560 INFO L436 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-04-29 11:24:43,560 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 234 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-04-29 11:24:43,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 234 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:24:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-29 11:24:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2025-04-29 11:24:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 81 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2025-04-29 11:24:43,562 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 27 [2025-04-29 11:24:43,562 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:43,562 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2025-04-29 11:24:43,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:43,562 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2025-04-29 11:24:43,562 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:24:43,562 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:43,562 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] [2025-04-29 11:24:43,562 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:24:43,562 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:43,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1723866769, now seen corresponding path program 1 times [2025-04-29 11:24:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:43,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211938300] [2025-04-29 11:24:43,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:43,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:43,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:24:43,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:24:43,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:43,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:43,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:43,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211938300] [2025-04-29 11:24:43,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211938300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:43,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:43,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:24:43,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492002314] [2025-04-29 11:24:43,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:43,651 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:24:43,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:43,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:24:43,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:24:43,652 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:43,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:43,721 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2025-04-29 11:24:43,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:24:43,721 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:24:43,722 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:43,722 INFO L225 Difference]: With dead ends: 81 [2025-04-29 11:24:43,722 INFO L226 Difference]: Without dead ends: 81 [2025-04-29 11:24:43,722 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:24:43,726 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 69 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:43,727 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 85 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:43,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-04-29 11:24:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-04-29 11:24:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2) 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-04-29 11:24:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-04-29 11:24:43,728 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 28 [2025-04-29 11:24:43,728 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:43,728 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-04-29 11:24:43,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:43,728 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-04-29 11:24:43,729 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:24:43,729 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:43,729 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, 1] [2025-04-29 11:24:43,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:24:43,729 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:43,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:43,729 INFO L85 PathProgramCache]: Analyzing trace with hash 152204240, now seen corresponding path program 1 times [2025-04-29 11:24:43,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:43,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610583851] [2025-04-29 11:24:43,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:43,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:43,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:24:43,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:24:43,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:43,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:44,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:44,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610583851] [2025-04-29 11:24:44,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610583851] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:44,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:44,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:24:44,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026241881] [2025-04-29 11:24:44,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:44,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:24:44,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:44,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:24:44,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:24:44,112 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:44,273 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2025-04-29 11:24:44,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:24:44,273 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-29 11:24:44,273 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:44,274 INFO L225 Difference]: With dead ends: 108 [2025-04-29 11:24:44,274 INFO L226 Difference]: Without dead ends: 108 [2025-04-29 11:24:44,274 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 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-04-29 11:24:44,275 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 31 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:44,275 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 339 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:44,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-29 11:24:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2025-04-29 11:24:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2025-04-29 11:24:44,277 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 33 [2025-04-29 11:24:44,277 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:44,277 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2025-04-29 11:24:44,277 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:44,277 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2025-04-29 11:24:44,277 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:24:44,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:44,278 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, 1] [2025-04-29 11:24:44,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:24:44,278 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:44,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash 152206896, now seen corresponding path program 1 times [2025-04-29 11:24:44,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:44,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874837435] [2025-04-29 11:24:44,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:44,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:44,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:24:44,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:24:44,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:44,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:44,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:44,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874837435] [2025-04-29 11:24:44,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874837435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:44,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:44,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-29 11:24:44,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623832955] [2025-04-29 11:24:44,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:44,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:24:44,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:44,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:24:44,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:24:44,951 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:45,333 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2025-04-29 11:24:45,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:24:45,333 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-29 11:24:45,333 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:45,334 INFO L225 Difference]: With dead ends: 107 [2025-04-29 11:24:45,334 INFO L226 Difference]: Without dead ends: 87 [2025-04-29 11:24:45,334 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:24:45,334 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:45,334 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 329 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:24:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-04-29 11:24:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-04-29 11:24:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 85 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2025-04-29 11:24:45,336 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 33 [2025-04-29 11:24:45,336 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:45,336 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2025-04-29 11:24:45,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:45,336 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2025-04-29 11:24:45,337 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:24:45,337 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:45,337 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, 1] [2025-04-29 11:24:45,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:24:45,337 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-04-29 11:24:45,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:45,337 INFO L85 PathProgramCache]: Analyzing trace with hash -421390449, now seen corresponding path program 1 times [2025-04-29 11:24:45,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:45,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641083705] [2025-04-29 11:24:45,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:45,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:45,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:24:45,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:24:45,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:45,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:24:45,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:45,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641083705] [2025-04-29 11:24:45,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641083705] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:45,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222234103] [2025-04-29 11:24:45,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:45,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:45,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:45,928 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-04-29 11:24:45,929 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-04-29 11:24:45,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:24:46,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:24:46,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:46,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:46,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-04-29 11:24:46,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:46,109 INFO L354 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-04-29 11:24:46,163 INFO L354 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-04-29 11:24:46,167 INFO L354 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-04-29 11:24:46,226 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 11:24:46,227 INFO L354 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-04-29 11:24:46,331 INFO L354 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-04-29 11:24:46,339 INFO L354 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-04-29 11:24:46,482 INFO L354 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-04-29 11:24:46,677 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:24:46,681 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-29 11:24:46,681 INFO L354 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-04-29 11:24:46,771 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:24:46,772 INFO L354 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-04-29 11:24:46,776 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:24:46,777 INFO L354 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-04-29 11:24:46,961 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:24:46,962 INFO L354 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-04-29 11:24:46,973 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:24:46,974 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:46,974 INFO L354 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-04-29 11:24:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:47,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:51,668 INFO L325 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-04-29 11:24:51,669 INFO L354 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-04-29 11:24:51,740 INFO L325 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-04-29 11:24:51,740 INFO L354 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-04-29 11:24:51,777 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:51,777 INFO L354 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-04-29 11:24:51,804 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:51,804 INFO L354 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-04-29 11:24:51,826 INFO L354 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-04-29 11:24:51,842 INFO L354 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-04-29 11:24:51,918 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:51,919 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 315 treesize of output 329 [2025-04-29 11:25:03,167 WARN L286 SmtUtils]: Spent 10.56s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 323] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-04-29 11:25:03,168 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:25:03,169 INFO L354 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 2987 treesize of output 2927 [2025-04-29 11:25:26,980 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse453 (< |c_ULTIMATE.start_append_~plist#1.offset| 1)) (.cse3 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 1))) (let ((.cse467 (or .cse453 .cse3)) (.cse468 (or .cse3 (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ 2 |c_ULTIMATE.start_append_~plist#1.offset|))))) (let ((.cse441 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_28 Int) (v_prenex_22 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse578 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_28))) (store .cse578 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse578) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_28 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_22 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse442 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_prenex_24 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse577 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_26))) (store .cse577 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse577) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_26 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_24 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse121 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse92 (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)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse576 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_13))) (store .cse576 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse576) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_13 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_12 4)) 0))))) (.cse93 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_prenex_18 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse575 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_18))) (store .cse575 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse575) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_18 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_16 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse26 (and .cse467 .cse468)) (.cse5 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse14 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_11 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse574 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse574 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse574) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_11 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse15 (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_34 Int) (v_prenex_8 Int)) (let ((.cse573 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse571 (store .cse573 0 v_prenex_8)) (.cse569 (+ v_prenex_8 4))) (let ((.cse570 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse571) v_arrayElimCell_34) .cse569)) (.cse568 (let ((.cse572 (store .cse573 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse572 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse572) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2))))) (or (= (select .cse568 .cse569) 0) (= .cse570 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse571 4 .cse570)) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse568) |c_ULTIMATE.start_append_~item~0#1.base|) .cse569) 0))))))))) (.cse16 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_34 Int) (v_prenex_8 Int)) (let ((.cse566 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse563 (let ((.cse567 (store .cse566 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse567 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse567) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) (.cse564 (+ v_prenex_8 4))) (or (= (select .cse563 .cse564) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse565 (store .cse566 0 v_prenex_8))) (store .cse565 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse565) v_arrayElimCell_34) .cse564)))) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse563) |c_ULTIMATE.start_append_~item~0#1.base|) .cse564) 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 (forall ((v_arrayElimCell_34 Int) (v_prenex_8 Int)) (let ((.cse561 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse560 (+ v_prenex_8 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse559 (store .cse561 0 v_prenex_8))) (store .cse559 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse559) v_arrayElimCell_34) .cse560)))) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse562 (store .cse561 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse562 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse562) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse560) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse83 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_10 Int) (v_arrayElimCell_33 Int)) (let ((.cse556 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse557 (+ v_prenex_10 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse555 (store .cse556 0 v_arrayElimCell_33))) (store .cse555 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse555) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_33))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse557) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse558 (store .cse556 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse558 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse558) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse557) 0)))) .cse3 .cse5)) (.cse104 (or .cse26 (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse553 (+ v_prenex_15 4))) (let ((.cse552 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse554 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15))) (store .cse554 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse554) |c_ULTIMATE.start_append_~item~0#1.base|) .cse553)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse552 .cse553) 0) (= (select .cse552 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) (.cse8 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_46 Int) (v_prenex_21 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse551 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse551 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse551) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) (+ v_prenex_21 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse13 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse550 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse550 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse550) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse105 (or (and .cse92 .cse93) .cse26)) (.cse269 (or .cse3 (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse548 (+ v_prenex_23 4))) (let ((.cse547 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse549 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse549 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse549) |c_ULTIMATE.start_append_~item~0#1.base|) .cse548)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse547 .cse548) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse547 4) 0))))))) (.cse270 (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse545 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23)) (.cse546 (+ v_prenex_23 4))) (let ((.cse544 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse545) |c_ULTIMATE.start_append_~item~0#1.base|) .cse546))) (or (= .cse544 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (store .cse545 4 .cse544) .cse546) 0))))) .cse121)) (.cse271 (or (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_25 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse121)) (.cse272 (or (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (let ((.cse543 (+ v_prenex_27 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse542 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_27))) (store .cse542 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse542) |c_ULTIMATE.start_append_~item~0#1.base|) .cse543)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse543)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse3)) (.cse274 (or .cse3 (and .cse441 .cse442))) (.cse275 (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse541 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23)) (.cse540 (+ v_prenex_23 4))) (let ((.cse538 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse541) |c_ULTIMATE.start_append_~item~0#1.base|) .cse540))) (let ((.cse539 (store .cse541 4 .cse538))) (or (= .cse538 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse539 .cse540) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse539) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0)))))) .cse121)) (.cse273 (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse535 (+ v_prenex_23 4))) (let ((.cse536 (let ((.cse537 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse537 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse537) |c_ULTIMATE.start_append_~item~0#1.base|) .cse535))))) (let ((.cse534 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse536) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse534 .cse535) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse536 .cse535) 0) (= (select .cse534 4) 0))))))) (.cse84 (or (forall ((v_prenex_4 Int) (v_prenex_5 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse531 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse532 (+ v_prenex_4 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse530 (store .cse531 0 v_prenex_5))) (store .cse530 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse530) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_5 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse532) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse533 (store .cse531 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse533 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse533) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse532) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse26)) (.cse261 (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_10 Int) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (let ((.cse527 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse528 (+ v_prenex_10 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse526 (store .cse527 0 v_arrayElimCell_33))) (store .cse526 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse526) v_arrayElimCell_34) (+ 4 v_arrayElimCell_33))))) v_arrayElimCell_46) .cse528) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse529 (store .cse527 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse529 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse529) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse528) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse7 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int) (v_prenex_8 Int)) (let ((.cse525 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse523 (store .cse525 0 v_prenex_8)) (.cse521 (+ v_prenex_8 4))) (let ((.cse520 (let ((.cse524 (store .cse525 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse524 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse524) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) (.cse522 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse523) v_arrayElimCell_34) .cse521))) (or (= (select .cse520 .cse521) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse520) v_arrayElimCell_46) .cse521) 0) (= .cse522 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse523 4 .cse522)) v_arrayElimCell_46) 4) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse237 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_prenex_13 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse519 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_13))) (store .cse519 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse519) v_arrayElimCell_34) (+ v_prenex_13 4))))) v_arrayElimCell_46) (+ v_prenex_12 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse9 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int) (v_prenex_8 Int)) (let ((.cse517 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse514 (let ((.cse518 (store .cse517 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse518 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse518) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) (.cse515 (+ v_prenex_8 4))) (or (= (select .cse514 .cse515) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse514) v_arrayElimCell_46) .cse515) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse516 (store .cse517 0 v_prenex_8))) (store .cse516 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse516) v_arrayElimCell_34) .cse515)))) v_arrayElimCell_46) 4) 0)))))))) (.cse10 (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_11 Int) (v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse513 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse513 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse513) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) (+ v_prenex_11 4)) 0))))) (.cse238 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_15 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (let ((.cse511 (+ v_prenex_15 4))) (let ((.cse510 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse512 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15))) (store .cse512 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse512) v_arrayElimCell_34) .cse511)))) v_arrayElimCell_46))) (or (= (select .cse510 4) 0) (= (select .cse510 .cse511) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse239 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_15 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (let ((.cse507 (+ v_prenex_15 4))) (let ((.cse508 (let ((.cse509 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15))) (store .cse509 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse509) v_arrayElimCell_34) .cse507))))) (let ((.cse506 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse508) v_arrayElimCell_46))) (or (= (select .cse506 4) 0) (= (select .cse506 .cse507) 0) (= (select .cse508 .cse507) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse240 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_prenex_18 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (let ((.cse502 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_18))) (let ((.cse503 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse502)) (.cse504 (+ v_prenex_18 4)) (.cse505 (+ v_prenex_16 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse502 4 (select (select .cse503 |c_ULTIMATE.start_append_~item~0#1.base|) .cse504))) v_arrayElimCell_46) .cse505) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse502 4 (select (select .cse503 v_arrayElimCell_34) .cse504))) v_arrayElimCell_46) .cse505) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse11 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int) (v_prenex_8 Int)) (let ((.cse500 (+ v_prenex_8 4)) (.cse499 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse498 (store .cse499 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse498 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse498) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse500) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse501 (store .cse499 0 v_prenex_8))) (store .cse501 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse501) v_arrayElimCell_34) .cse500)))) v_arrayElimCell_46) 4) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse12 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (let ((.cse495 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse496 (+ v_prenex_6 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse494 (store .cse495 0 v_prenex_7))) (store .cse494 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse494) v_arrayElimCell_34) (+ v_prenex_7 4))))) v_arrayElimCell_46) .cse496) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse497 (store .cse495 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse497 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse497) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse496) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse241 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_17 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (= (let ((.cse493 (+ v_prenex_17 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse492 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_17))) (store .cse492 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse492) v_arrayElimCell_34) .cse493)))) v_arrayElimCell_46) .cse493)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse242 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_15 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (let ((.cse491 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15)) (.cse489 (+ v_prenex_15 4))) (let ((.cse487 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse491) v_arrayElimCell_34) .cse489))) (let ((.cse490 (store .cse491 4 .cse487))) (let ((.cse488 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse490) v_arrayElimCell_46))) (or (= .cse487 0) (= (select .cse488 4) 0) (= (select .cse488 .cse489) 0) (= (select .cse490 .cse489) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse140 (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int) (v_arrayElimCell_34 Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse486 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_19))) (store .cse486 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse486) v_arrayElimCell_34) (+ v_prenex_19 4))))) v_arrayElimCell_46) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse106 (or (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse483 (+ v_prenex_15 4))) (let ((.cse484 (let ((.cse485 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15))) (store .cse485 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse485) |c_ULTIMATE.start_append_~item~0#1.base|) .cse483))))) (let ((.cse482 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse484) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse482 .cse483) 0) (= (select .cse484 .cse483) 0) (= (select .cse482 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse26)) (.cse107 (or (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse479 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15)) (.cse481 (+ v_prenex_15 4))) (let ((.cse480 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse479) |c_ULTIMATE.start_append_~item~0#1.base|) .cse481))) (or (= (select (store .cse479 4 .cse480) .cse481) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse480 0))))) .cse121)) (.cse85 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_8 Int)) (let ((.cse477 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse476 (+ v_prenex_8 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse475 (store .cse477 0 v_prenex_8))) (store .cse475 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse475) |c_ULTIMATE.start_append_~item~0#1.base|) .cse476)))) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse478 (store .cse477 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse478 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse478) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse476) 0)))) .cse3)) (.cse108 (or (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse474 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15)) (.cse472 (+ v_prenex_15 4))) (let ((.cse473 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse474) |c_ULTIMATE.start_append_~item~0#1.base|) .cse472))) (let ((.cse471 (store .cse474 4 .cse473))) (or (= (select .cse471 .cse472) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse471) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse473 0)))))) .cse121)) (.cse109 (or .cse26 (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (let ((.cse470 (+ v_prenex_17 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse469 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_17))) (store .cse469 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse469) |c_ULTIMATE.start_append_~item~0#1.base|) .cse470)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse470)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse0 (and (or .cse3 .cse5) .cse467 .cse468)) (.cse101 (or .cse3 (forall ((v_prenex_6 Int) (v_prenex_7 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse464 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse465 (+ v_prenex_6 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse463 (store .cse464 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse463 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse463) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse465) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse466 (store .cse464 0 v_prenex_7))) (store .cse466 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse466) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_7 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse465) 0)))))) (.cse102 (or .cse3 (forall ((v_prenex_11 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$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse462 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse462 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse462) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_11 4)) 0))))) (.cse22 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse461 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse461 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse461) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_21 4)) 0)))) (.cse110 (or (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_14)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_14 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse121)) (.cse103 (or .cse3 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_8 Int)) (let ((.cse458 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse459 (let ((.cse460 (store .cse458 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse460 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse460) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) (.cse457 (+ v_prenex_8 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse456 (store .cse458 0 v_prenex_8))) (store .cse456 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse456) |c_ULTIMATE.start_append_~item~0#1.base|) .cse457)))) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0) (= (select .cse459 .cse457) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse459) |c_ULTIMATE.start_append_~item~0#1.base|) .cse457) 0))))))) (.cse23 (< |c_ULTIMATE.start_append_~plist#1.offset| 0)) (.cse24 (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse6 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse25 (not .cse5)) (.cse451 (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$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse455 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse455 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse455) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0))))) (and (or .cse0 (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse1 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (store .cse1 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse1) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_29 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse3 (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)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse4 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_19))) (store .cse4 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse4) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_19 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0))) .cse5) (or (and (or .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (or (and .cse14 .cse15 .cse16 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_arrayElimCell_34 Int)) (let ((.cse18 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse19 (+ v_prenex_6 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse17 (store .cse18 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse17 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse17) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse19) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse20 (store .cse18 0 v_prenex_7))) (store .cse20 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse20) v_arrayElimCell_34) (+ v_prenex_7 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse19) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse21) .cse6) (or .cse22 .cse6)) .cse23 .cse24 .cse25) (or .cse26 (and (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_15 Int) (v_arrayElimCell_34 Int)) (let ((.cse31 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15)) (.cse30 (+ v_prenex_15 4))) (let ((.cse27 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse31) v_arrayElimCell_34) .cse30))) (let ((.cse29 (store .cse31 4 .cse27))) (let ((.cse28 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse29) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= .cse27 0) (= (select .cse28 4) 0) (= (select .cse29 .cse30) 0) (= (select .cse28 .cse30) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse14 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_prenex_18 Int) (v_arrayElimCell_34 Int)) (let ((.cse32 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_18))) (let ((.cse33 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse32)) (.cse34 (+ v_prenex_18 4)) (.cse35 (+ v_prenex_16 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse32 4 (select (select .cse33 |c_ULTIMATE.start_append_~item~0#1.base|) .cse34))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse35) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse32 4 (select (select .cse33 v_arrayElimCell_34) .cse34))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse35) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse15 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_17 Int) (v_arrayElimCell_34 Int)) (= (let ((.cse37 (+ v_prenex_17 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse36 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_17))) (store .cse36 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse36) v_arrayElimCell_34) .cse37)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse37)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_12 Int) (v_prenex_13 Int) (v_arrayElimCell_34 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse38 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_13))) (store .cse38 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse38) v_arrayElimCell_34) (+ v_prenex_13 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_12 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_15 Int) (v_arrayElimCell_34 Int)) (let ((.cse40 (+ v_prenex_15 4))) (let ((.cse39 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse41 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15))) (store .cse41 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse41) v_arrayElimCell_34) .cse40)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse39 4) 0) (= (select .cse39 .cse40) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse16 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimCell_34 Int)) (let ((.cse43 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse44 (+ v_prenex_4 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse42 (store .cse43 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse42 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse42) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse44) 0) (= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse45 (store .cse43 0 v_prenex_5))) (store .cse45 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse45) v_arrayElimCell_34) (+ v_prenex_5 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse44))))) (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_6 Int) (v_prenex_7 Int)) (let ((.cse47 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse48 (+ v_prenex_6 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse46 (store .cse47 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse46 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse46) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse48) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse49 (store .cse47 0 v_prenex_7))) (store .cse49 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse49) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_7 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse48) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_10 Int) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (let ((.cse51 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse52 (+ v_prenex_10 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse50 (store .cse51 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse50 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse50) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse52) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse53 (store .cse51 0 v_arrayElimCell_33))) (store .cse53 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse53) v_arrayElimCell_34) (+ 4 v_arrayElimCell_33))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse52) 0)))) .cse5) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_15 Int) (v_arrayElimCell_34 Int)) (let ((.cse56 (+ v_prenex_15 4))) (let ((.cse55 (let ((.cse57 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15))) (store .cse57 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse57) v_arrayElimCell_34) .cse56))))) (let ((.cse54 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse55) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse54 4) 0) (= (select .cse55 .cse56) 0) (= (select .cse54 .cse56) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse21) .cse6) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_29 Int) (v_arrayElimCell_34 Int)) (let ((.cse58 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (let ((.cse59 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse58)) (.cse60 (+ v_prenex_29 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse58 4 (select (select .cse59 |c_ULTIMATE.start_append_~item~0#1.base|) .cse60))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse58 4 (select (select .cse59 v_arrayElimCell_34) .cse60))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int) (v_arrayElimCell_34 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse61 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_19))) (store .cse61 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse61) v_arrayElimCell_34) (+ v_prenex_19 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0))) .cse5) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_20 Int) (v_arrayElimCell_34 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse62 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_20))) (store .cse62 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse62) v_arrayElimCell_34) (+ v_prenex_20 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_34 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse63 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse63 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse63) v_arrayElimCell_34) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_34 Int)) (let ((.cse68 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23)) (.cse65 (+ v_prenex_23 4))) (let ((.cse66 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse68) v_arrayElimCell_34) .cse65))) (let ((.cse64 (store .cse68 4 .cse66))) (let ((.cse67 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse64) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse64 .cse65) 0) (= .cse66 0) (= (select .cse67 .cse65) 0) (= (select .cse67 4) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_23 Int) (v_arrayElimCell_34 Int)) (let ((.cse70 (+ v_prenex_23 4))) (let ((.cse69 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse71 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse71 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse71) v_arrayElimCell_34) .cse70)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse69 .cse70) 0) (= (select .cse69 4) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_28 Int) (v_prenex_22 Int) (v_arrayElimCell_34 Int)) (let ((.cse72 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_28))) (let ((.cse73 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse72)) (.cse74 (+ v_prenex_28 4)) (.cse75 (+ v_prenex_22 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse72 4 (select (select .cse73 |c_ULTIMATE.start_append_~item~0#1.base|) .cse74))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse75) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse72 4 (select (select .cse73 v_arrayElimCell_34) .cse74))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse75) 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_34 Int)) (let ((.cse77 (+ v_prenex_23 4))) (let ((.cse76 (let ((.cse79 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse79 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse79) v_arrayElimCell_34) .cse77))))) (let ((.cse78 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse76) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse76 .cse77) 0) (= (select .cse78 .cse77) 0) (= (select .cse78 4) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_prenex_24 Int) (v_arrayElimCell_34 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse80 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_26))) (store .cse80 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse80) v_arrayElimCell_34) (+ v_prenex_26 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_24 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_27 Int) (v_arrayElimCell_34 Int)) (= (let ((.cse82 (+ v_prenex_27 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse81 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_27))) (store .cse81 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse81) v_arrayElimCell_34) .cse82)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse82)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse5))) (or (and .cse83 .cse84 .cse85 (or .cse26 (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_17 Int)) (= (let ((.cse87 (+ v_prenex_17 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse86 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_17))) (store .cse86 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse86) |c_ULTIMATE.start_append_~item~0#1.base|) .cse87)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse87)) 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_15 Int)) (let ((.cse89 (+ v_prenex_15 4))) (let ((.cse90 (let ((.cse91 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15))) (store .cse91 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse91) |c_ULTIMATE.start_append_~item~0#1.base|) .cse89))))) (let ((.cse88 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse90) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse88 .cse89) 0) (= (select .cse90 .cse89) 0) (= (select .cse88 4) 0)))))))) .cse92 .cse93 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_15 Int)) (let ((.cse97 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15)) (.cse95 (+ v_prenex_15 4))) (let ((.cse96 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse97) |c_ULTIMATE.start_append_~item~0#1.base|) .cse95))) (let ((.cse94 (store .cse97 4 .cse96))) (or (= (select .cse94 .cse95) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse94) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0) (= .cse96 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_15 Int)) (let ((.cse99 (+ v_prenex_15 4))) (let ((.cse98 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse100 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15))) (store .cse100 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse100) |c_ULTIMATE.start_append_~item~0#1.base|) .cse99)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse98 .cse99) 0) (= (select .cse98 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse101 .cse102 .cse103) .cse6) (or .cse6 (and .cse83 .cse104 .cse105 .cse84 .cse106 .cse107 .cse85 .cse108 .cse109 .cse101 .cse102 .cse110 .cse103)) (or (and (or .cse26 (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int) (v_arrayElimCell_34 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse111 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_20))) (store .cse111 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse111) v_arrayElimCell_34) (+ v_prenex_20 4))))) v_arrayElimCell_46) .cse2) 0)))) (or .cse3 (forall ((v_prenex_27 Int) (v_arrayElimCell_46 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 ((.cse113 (+ v_prenex_27 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse112 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_27))) (store .cse112 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse112) v_arrayElimCell_46) .cse113)))) v_arrayElimCell_46) .cse113)) 0)))) (or .cse3 (forall ((v_prenex_29 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse114 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (let ((.cse115 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse114)) (.cse116 (+ v_prenex_29 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse114 4 (select (select .cse115 |c_ULTIMATE.start_append_~item~0#1.base|) .cse116))) v_arrayElimCell_46) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse114 4 (select (select .cse115 v_arrayElimCell_46) .cse116))) v_arrayElimCell_46) .cse2) 0)))))) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse120 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23)) (.cse118 (+ v_prenex_23 4))) (let ((.cse119 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse120) v_arrayElimCell_46) .cse118))) (let ((.cse117 (store .cse120 4 .cse119))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse117) v_arrayElimCell_46) 4) 0) (= (select .cse117 .cse118) 0) (= .cse119 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse121) (or .cse3 (forall ((v_prenex_23 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse123 (+ v_prenex_23 4))) (let ((.cse122 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse124 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse124 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse124) v_arrayElimCell_34) .cse123)))) v_arrayElimCell_46))) (or (= (select .cse122 .cse123) 0) (= (select .cse122 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (or .cse3 (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse125 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse125 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse125) v_arrayElimCell_34) .cse2)))) v_arrayElimCell_46) .cse2) 0)))) (or .cse3 (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse126 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_19))) (store .cse126 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse126) v_arrayElimCell_46) (+ v_prenex_19 4))))) v_arrayElimCell_46) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_28 Int) (v_prenex_22 Int) (v_arrayElimCell_46 Int)) (let ((.cse127 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_28))) (let ((.cse128 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse127)) (.cse129 (+ v_prenex_28 4)) (.cse130 (+ v_prenex_22 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse127 4 (select (select .cse128 |c_ULTIMATE.start_append_~item~0#1.base|) .cse129))) v_arrayElimCell_46) .cse130) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse127 4 (select (select .cse128 v_arrayElimCell_46) .cse129))) v_arrayElimCell_46) .cse130) 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_prenex_24 Int) (v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse131 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_26))) (store .cse131 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse131) v_arrayElimCell_46) (+ v_prenex_26 4))))) v_arrayElimCell_46) (+ v_prenex_24 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse3) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse133 (+ v_prenex_23 4))) (let ((.cse134 (let ((.cse135 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse135 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse135) v_arrayElimCell_46) .cse133))))) (let ((.cse132 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse134) v_arrayElimCell_46))) (or (= (select .cse132 4) 0) (= (select .cse132 .cse133) 0) (= (select .cse134 .cse133) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse121) (or (forall ((v_prenex_25 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25)) v_arrayElimCell_46) (+ v_prenex_25 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse121) (or .cse3 (forall ((v_prenex_28 Int) (v_prenex_22 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse136 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_28))) (let ((.cse137 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse136)) (.cse138 (+ v_prenex_28 4)) (.cse139 (+ v_prenex_22 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse136 4 (select (select .cse137 v_arrayElimCell_34) .cse138))) v_arrayElimCell_46) .cse139)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse136 4 (select (select .cse137 |c_ULTIMATE.start_append_~item~0#1.base|) .cse138))) v_arrayElimCell_46) .cse139) 0)))))) (or .cse140 .cse3) (or .cse3 (forall ((v_prenex_26 Int) (v_prenex_24 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse141 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_26))) (store .cse141 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse141) v_arrayElimCell_34) (+ v_prenex_26 4))))) v_arrayElimCell_46) (+ v_prenex_24 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse142 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse142 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse142) v_arrayElimCell_46) .cse2)))) v_arrayElimCell_46) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse121) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse143 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23)) (.cse145 (+ v_prenex_23 4))) (let ((.cse144 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse143) v_arrayElimCell_46) .cse145))) (or (= (select (store .cse143 4 .cse144) .cse145) 0) (= .cse144 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse121) (or (forall ((v_prenex_29 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse146 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (let ((.cse147 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse146)) (.cse148 (+ v_prenex_29 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse146 4 (select (select .cse147 |c_ULTIMATE.start_append_~item~0#1.base|) .cse148))) v_arrayElimCell_46) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse146 4 (select (select .cse147 v_arrayElimCell_34) .cse148))) v_arrayElimCell_46) .cse2) 0))))) .cse3) (or .cse3 (forall ((v_prenex_23 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse153 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23)) (.cse150 (+ v_prenex_23 4))) (let ((.cse152 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse153) v_arrayElimCell_34) .cse150))) (let ((.cse151 (store .cse153 4 .cse152))) (let ((.cse149 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse151) v_arrayElimCell_46))) (or (= (select .cse149 .cse150) 0) (= (select .cse151 .cse150) 0) (= .cse152 0) (= (select .cse149 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))))) (or (forall ((v_prenex_27 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (or (= (let ((.cse155 (+ v_prenex_27 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse154 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_27))) (store .cse154 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse154) v_arrayElimCell_34) .cse155)))) v_arrayElimCell_46) .cse155)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse3) (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse156 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_20))) (store .cse156 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse156) v_arrayElimCell_46) (+ v_prenex_20 4))))) v_arrayElimCell_46) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse26) (or .cse6 (and (or (forall ((v_prenex_14 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_14)) v_arrayElimCell_46) (+ v_prenex_14 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse121) (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_10 Int) (v_arrayElimCell_33 Int)) (let ((.cse158 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse159 (+ v_prenex_10 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse157 (store .cse158 0 v_arrayElimCell_33))) (store .cse157 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse157) v_arrayElimCell_46) (+ 4 v_arrayElimCell_33))))) v_arrayElimCell_46) .cse159) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse160 (store .cse158 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse160 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse160) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse159) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse3) (or .cse121 (forall ((v_prenex_15 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse161 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15)) (.cse163 (+ v_prenex_15 4))) (let ((.cse162 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse161) v_arrayElimCell_46) .cse163))) (or (= (select (store .cse161 4 .cse162) .cse163) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse162 0)))))) (or (forall ((v_prenex_17 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (let ((.cse165 (+ v_prenex_17 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse164 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_17))) (store .cse164 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse164) v_arrayElimCell_46) .cse165)))) v_arrayElimCell_46) .cse165)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse26) (or .cse121 (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_8 Int)) (let ((.cse170 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse171 (store .cse170 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse166 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse171) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2))) (let ((.cse167 (store .cse171 4 .cse166)) (.cse168 (+ v_prenex_8 4))) (or (= .cse166 0) (= (select .cse167 .cse168) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse167) v_arrayElimCell_46) .cse168) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse169 (store .cse170 0 v_prenex_8))) (store .cse169 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse169) v_arrayElimCell_46) .cse168)))) v_arrayElimCell_46) 4) 0)))))))) (or .cse121 (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_43 Int)) (let ((.cse172 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse172 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse172 0 v_arrayElimCell_43)) v_arrayElimCell_46) (+ 4 v_arrayElimCell_43)) 0))))) (or (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse178 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse173 (store .cse178 0 v_prenex_7))) (let ((.cse174 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse173)) (.cse175 (+ v_prenex_7 4)) (.cse176 (+ v_prenex_6 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse173 4 (select (select .cse174 v_arrayElimCell_46) .cse175))) v_arrayElimCell_46) .cse176) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse173 4 (select (select .cse174 |c_ULTIMATE.start_append_~item~0#1.base|) .cse175))) v_arrayElimCell_46) .cse176) 0) (= (select (select (store |c_#memory_$Pointer$#0.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$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse177) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse176) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse3) (or (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse180 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse181 (+ v_prenex_4 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse179 (store .cse180 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse179 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse179) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse181) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse182 (store .cse180 0 v_prenex_5))) (store .cse182 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse182) v_arrayElimCell_46) (+ v_prenex_5 4))))) v_arrayElimCell_46) .cse181) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse26) (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_9 Int)) (let ((.cse183 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse184 (store .cse183 0 v_prenex_9)) (.cse186 (+ v_prenex_9 4))) (let ((.cse185 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse184) v_arrayElimCell_46) .cse186))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse183 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0) (= (select (store .cse184 4 .cse185) .cse186) 0) (= .cse185 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse121) (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_8 Int)) (let ((.cse192 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse191 (store .cse192 0 v_prenex_8)) (.cse189 (+ v_prenex_8 4)) (.cse188 (store .cse192 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse187 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse188) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)) (.cse190 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse191) v_arrayElimCell_46) .cse189))) (or (= .cse187 0) (= (select (store .cse188 4 .cse187) .cse189) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse190 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse191 4 .cse190)) v_arrayElimCell_46) 4) 0)))))) .cse121) (or .cse26 (forall ((v_prenex_15 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse194 (+ v_prenex_15 4))) (let ((.cse193 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse195 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15))) (store .cse195 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse195) v_arrayElimCell_46) .cse194)))) v_arrayElimCell_46))) (or (= (select .cse193 4) 0) (= (select .cse193 .cse194) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (or (forall ((v_prenex_15 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse199 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15)) (.cse197 (+ v_prenex_15 4))) (let ((.cse198 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse199) v_arrayElimCell_46) .cse197))) (let ((.cse196 (store .cse199 4 .cse198))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse196) v_arrayElimCell_46) 4) 0) (= (select .cse196 .cse197) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse198 0)))))) .cse121) (or .cse3 (forall ((v_prenex_11 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse201 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse202 (+ v_prenex_11 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse200 (store .cse201 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse200 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse200) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse202) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse203 (store .cse201 0 v_prenex_11))) (store .cse203 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse203) v_arrayElimCell_46) .cse202)))) v_arrayElimCell_46) .cse202) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_8 Int)) (let ((.cse207 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse204 (let ((.cse208 (store .cse207 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse208 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse208) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) (.cse205 (+ v_prenex_8 4))) (or (= (select .cse204 .cse205) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse204) v_arrayElimCell_46) .cse205) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse206 (store .cse207 0 v_prenex_8))) (store .cse206 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse206) v_arrayElimCell_46) .cse205)))) v_arrayElimCell_46) 4) 0))))) .cse3) (or .cse26 (forall ((v_prenex_15 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse210 (+ v_prenex_15 4))) (let ((.cse211 (let ((.cse212 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15))) (store .cse212 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse212) v_arrayElimCell_46) .cse210))))) (let ((.cse209 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse211) v_arrayElimCell_46))) (or (= (select .cse209 4) 0) (= (select .cse209 .cse210) 0) (= (select .cse211 .cse210) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_8 Int)) (let ((.cse215 (+ v_prenex_8 4)) (.cse214 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse213 (store .cse214 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse213 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse213) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse215) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse216 (store .cse214 0 v_prenex_8))) (store .cse216 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse216) v_arrayElimCell_46) .cse215)))) v_arrayElimCell_46) 4) 0)))) .cse3) (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_8 Int)) (let ((.cse220 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse218 (store .cse220 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse217 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse218) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)) (.cse219 (+ v_prenex_8 4))) (or (= .cse217 0) (= (select (store .cse218 4 .cse217) .cse219) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse220 0 v_prenex_8)) v_arrayElimCell_46) .cse219) 0)))))) .cse121) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_prenex_13 Int) (v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse221 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_13))) (store .cse221 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse221) v_arrayElimCell_46) (+ v_prenex_13 4))))) v_arrayElimCell_46) (+ v_prenex_12 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_16 Int) (v_prenex_18 Int) (v_arrayElimCell_46 Int)) (let ((.cse222 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_18))) (let ((.cse223 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse222)) (.cse224 (+ v_prenex_18 4)) (.cse225 (+ v_prenex_16 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse222 4 (select (select .cse223 |c_ULTIMATE.start_append_~item~0#1.base|) .cse224))) v_arrayElimCell_46) .cse225) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse222 4 (select (select .cse223 v_arrayElimCell_46) .cse224))) v_arrayElimCell_46) .cse225) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse26))) (or .cse6 (and (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_8 Int) (v_arrayElimCell_34 Int)) (let ((.cse231 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse229 (store .cse231 0 v_prenex_8)) (.cse227 (+ v_prenex_8 4))) (let ((.cse226 (let ((.cse230 (store .cse231 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse230 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse230) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) (.cse228 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse229) v_arrayElimCell_34) .cse227))) (or (= (select .cse226 .cse227) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse226) v_arrayElimCell_46) .cse227) 0) (= .cse228 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse229 4 .cse228)) v_arrayElimCell_46) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse3) (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_8 Int) (v_arrayElimCell_34 Int)) (let ((.cse235 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse232 (let ((.cse236 (store .cse235 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse236 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse236) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) (.cse233 (+ v_prenex_8 4))) (or (= (select .cse232 .cse233) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse232) v_arrayElimCell_46) .cse233) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse234 (store .cse235 0 v_prenex_8))) (store .cse234 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse234) v_arrayElimCell_34) .cse233)))) v_arrayElimCell_46) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse3) (or .cse26 (and .cse237 .cse238 .cse239 .cse240 .cse241 .cse242)) (or .cse26 (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse244 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse245 (+ v_prenex_4 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse243 (store .cse244 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse243 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse243) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse245) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse246 (store .cse244 0 v_prenex_5))) (store .cse246 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse246) v_arrayElimCell_34) (+ v_prenex_5 4))))) v_arrayElimCell_46) .cse245) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse252 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse247 (store .cse252 0 v_prenex_7))) (let ((.cse248 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse247)) (.cse249 (+ v_prenex_7 4)) (.cse250 (+ v_prenex_6 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse247 4 (select (select .cse248 |c_ULTIMATE.start_append_~item~0#1.base|) .cse249))) v_arrayElimCell_46) .cse250) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse247 4 (select (select .cse248 v_arrayElimCell_34) .cse249))) v_arrayElimCell_46) .cse250) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse251 (store .cse252 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse251 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse251) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse250) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse3) (or (forall ((v_prenex_11 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse254 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse255 (+ v_prenex_11 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse253 (store .cse254 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse253 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse253) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse255) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse256 (store .cse254 0 v_prenex_11))) (store .cse256 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse256) v_arrayElimCell_34) .cse255)))) v_arrayElimCell_46) .cse255) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse3) (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_8 Int) (v_arrayElimCell_34 Int)) (let ((.cse259 (+ v_prenex_8 4)) (.cse258 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse257 (store .cse258 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse257 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse257) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse259) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse260 (store .cse258 0 v_prenex_8))) (store .cse260 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse260) v_arrayElimCell_34) .cse259)))) v_arrayElimCell_46) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse3) (or .cse3 .cse261))) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse263 (+ v_prenex_23 4))) (let ((.cse264 (let ((.cse265 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse265 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse265) v_arrayElimCell_34) .cse263))))) (let ((.cse262 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse264) v_arrayElimCell_46))) (or (= (select .cse262 .cse263) 0) (= (select .cse264 .cse263) 0) (= (select .cse262 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse3) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse267 (+ v_prenex_23 4))) (let ((.cse266 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse268 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse268 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse268) v_arrayElimCell_46) .cse267)))) v_arrayElimCell_46))) (or (= (select .cse266 4) 0) (= (select .cse266 .cse267) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse3)) .cse5) (or (and .cse269 .cse270 .cse271 .cse272 (or .cse273 .cse121) .cse274 .cse275) .cse5) (or .cse23 .cse24 .cse22 .cse6 .cse25) (or (and .cse83 (or .cse0 (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse276 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse276 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse276) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse104 (or (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse278 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15)) (.cse279 (+ v_prenex_15 4))) (let ((.cse277 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse278) v_arrayElimCell_34) .cse279))) (or (= .cse277 0) (= (select (store .cse278 4 .cse277) .cse279) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse121) (or .cse23 .cse24 (and .cse8 .cse13) .cse25) (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_8 Int)) (let ((.cse283 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse280 (let ((.cse284 (store .cse283 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse284 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse284) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) (.cse281 (+ v_prenex_8 4))) (or (= (select .cse280 .cse281) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse282 (store .cse283 0 v_prenex_8))) (store .cse282 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse282) |c_ULTIMATE.start_append_~item~0#1.base|) .cse281)))) v_arrayElimCell_46) 4) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse280) v_arrayElimCell_46) .cse281) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse3) (or .cse26 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_prenex_13 Int) (v_arrayElimCell_46 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse285 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_13))) (store .cse285 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse285) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_13 4))))) v_arrayElimCell_46) (+ v_prenex_12 4)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_prenex_18 Int) (v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse286 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_18))) (store .cse286 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse286) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_18 4))))) v_arrayElimCell_46) (+ v_prenex_16 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_15 Int) (v_arrayElimCell_46 Int)) (let ((.cse291 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15)) (.cse288 (+ v_prenex_15 4))) (let ((.cse290 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse291) |c_ULTIMATE.start_append_~item~0#1.base|) .cse288))) (let ((.cse289 (store .cse291 4 .cse290))) (let ((.cse287 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse289) v_arrayElimCell_46))) (or (= (select .cse287 4) 0) (= (select .cse287 .cse288) 0) (= (select .cse289 .cse288) 0) (= .cse290 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_17 Int) (v_arrayElimCell_46 Int)) (= (let ((.cse293 (+ v_prenex_17 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse292 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_17))) (store .cse292 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse292) |c_ULTIMATE.start_append_~item~0#1.base|) .cse293)))) v_arrayElimCell_46) .cse293)) 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_15 Int) (v_arrayElimCell_46 Int)) (let ((.cse295 (+ v_prenex_15 4))) (let ((.cse296 (let ((.cse297 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15))) (store .cse297 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse297) |c_ULTIMATE.start_append_~item~0#1.base|) .cse295))))) (let ((.cse294 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse296) v_arrayElimCell_46))) (or (= (select .cse294 4) 0) (= (select .cse294 .cse295) 0) (= (select .cse296 .cse295) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_15 Int) (v_arrayElimCell_46 Int)) (let ((.cse299 (+ v_prenex_15 4))) (let ((.cse298 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse300 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15))) (store .cse300 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse300) |c_ULTIMATE.start_append_~item~0#1.base|) .cse299)))) v_arrayElimCell_46))) (or (= (select .cse298 4) 0) (= (select .cse298 .cse299) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_prenex_13 Int) (v_arrayElimCell_34 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse301 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_13))) (store .cse301 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse301) v_arrayElimCell_34) (+ v_prenex_13 4))))) v_arrayElimCell_34) (+ v_prenex_12 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_16 Int) (v_prenex_18 Int) (v_arrayElimCell_34 Int)) (let ((.cse302 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_18))) (let ((.cse303 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse302)) (.cse304 (+ v_prenex_18 4)) (.cse305 (+ v_prenex_16 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse302 4 (select (select .cse303 v_arrayElimCell_34) .cse304))) v_arrayElimCell_34) .cse305) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse302 4 (select (select .cse303 |c_ULTIMATE.start_append_~item~0#1.base|) .cse304))) v_arrayElimCell_34) .cse305) 0))))))))) .cse105 (or (forall ((v_prenex_11 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse306 (store (select |c_#memory_$Pointer$#0.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$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse306) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) (+ v_prenex_11 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse3) (or (and .cse269 .cse270 .cse271 .cse272 .cse274 .cse275 (or .cse3 .cse273)) .cse5) .cse84 (or .cse26 (and (or .cse261 .cse5) .cse7 .cse237 .cse9 .cse10 .cse238 (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_4 Int) (v_prenex_5 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (let ((.cse308 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse309 (+ v_prenex_4 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse307 (store .cse308 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse307 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse307) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse309) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse310 (store .cse308 0 v_prenex_5))) (store .cse310 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse310) v_arrayElimCell_34) (+ v_prenex_5 4))))) v_arrayElimCell_46) .cse309) 0)))))) .cse239 .cse240 .cse11 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse311 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse311 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse311) v_arrayElimCell_34) .cse2)))) v_arrayElimCell_46) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_29 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (let ((.cse312 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (let ((.cse313 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse312)) (.cse314 (+ v_prenex_29 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse312 4 (select (select .cse313 |c_ULTIMATE.start_append_~item~0#1.base|) .cse314))) v_arrayElimCell_46) .cse2) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse312 4 (select (select .cse313 v_arrayElimCell_34) .cse314))) v_arrayElimCell_46) .cse2) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or .cse5 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_prenex_24 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse315 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_26))) (store .cse315 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse315) v_arrayElimCell_34) (+ v_prenex_26 4))))) v_arrayElimCell_46) (+ v_prenex_24 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_27 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (= (let ((.cse317 (+ v_prenex_27 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse316 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_27))) (store .cse316 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse316) v_arrayElimCell_34) .cse317)))) v_arrayElimCell_46) .cse317)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (let ((.cse322 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23)) (.cse319 (+ v_prenex_23 4))) (let ((.cse321 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse322) v_arrayElimCell_34) .cse319))) (let ((.cse320 (store .cse322 4 .cse321))) (let ((.cse318 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse320) v_arrayElimCell_46))) (or (= (select .cse318 .cse319) 0) (= (select .cse320 .cse319) 0) (= .cse321 0) (= (select .cse318 4) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_23 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (let ((.cse324 (+ v_prenex_23 4))) (let ((.cse323 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse325 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse325 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse325) v_arrayElimCell_34) .cse324)))) v_arrayElimCell_46))) (or (= (select .cse323 .cse324) 0) (= (select .cse323 4) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_28 Int) (v_prenex_22 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_34 Int)) (let ((.cse326 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_28))) (let ((.cse327 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse326)) (.cse328 (+ v_prenex_28 4)) (.cse329 (+ v_prenex_22 4))) (or (= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse326 4 (select (select .cse327 v_arrayElimCell_34) .cse328))) v_arrayElimCell_46) .cse329)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse326 4 (select (select .cse327 |c_ULTIMATE.start_append_~item~0#1.base|) .cse328))) v_arrayElimCell_46) .cse329) 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_46 Int) (v_arrayElimCell_34 Int)) (let ((.cse331 (+ v_prenex_23 4))) (let ((.cse332 (let ((.cse333 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse333 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse333) v_arrayElimCell_34) .cse331))))) (let ((.cse330 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse332) v_arrayElimCell_46))) (or (= (select .cse330 .cse331) 0) (= (select .cse332 .cse331) 0) (= (select .cse330 4) 0)))))))))) .cse12 .cse241 .cse242 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_46 Int) (v_prenex_20 Int) (v_arrayElimCell_34 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse334 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_20))) (store .cse334 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse334) v_arrayElimCell_34) (+ v_prenex_20 4))))) v_arrayElimCell_46) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or .cse140 .cse5))) .cse106 .cse107 (or .cse26 (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_34 Int)) (let ((.cse335 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (let ((.cse336 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse335)) (.cse337 (+ v_prenex_29 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse335 4 (select (select .cse336 |c_ULTIMATE.start_append_~item~0#1.base|) .cse337))) v_arrayElimCell_34) .cse2) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse335 4 (select (select .cse336 v_arrayElimCell_34) .cse337))) v_arrayElimCell_34) .cse2) 0))))))) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int) (v_arrayElimCell_34 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse338 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_19))) (store .cse338 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse338) v_arrayElimCell_34) (+ v_prenex_19 4))))) v_arrayElimCell_34) .cse2) 0))) .cse5) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_20 Int) (v_arrayElimCell_34 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse339 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_20))) (store .cse339 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse339) v_arrayElimCell_34) (+ v_prenex_20 4))))) v_arrayElimCell_34) .cse2) 0)))))) (or (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse341 (+ v_prenex_15 4))) (let ((.cse340 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse342 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15))) (store .cse342 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse342) v_arrayElimCell_34) .cse341)))) v_arrayElimCell_34))) (or (= (select .cse340 4) 0) (= (select .cse340 .cse341) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse26) .cse85 (or .cse3 (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse344 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse345 (+ v_prenex_6 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse343 (store .cse344 0 v_prenex_7))) (store .cse343 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse343) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_7 4))))) v_arrayElimCell_46) .cse345) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse346 (store .cse344 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse346 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse346) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse345) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse108 (or (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (or (= (let ((.cse348 (+ v_prenex_17 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse347 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_17))) (store .cse347 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse347) v_arrayElimCell_34) .cse348)))) v_arrayElimCell_34) .cse348)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse26) (or .cse3 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_46 Int)) (let ((.cse350 (+ v_prenex_23 4))) (let ((.cse349 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse351 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse351 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse351) |c_ULTIMATE.start_append_~item~0#1.base|) .cse350)))) v_arrayElimCell_46))) (or (= (select .cse349 4) 0) (= (select .cse349 .cse350) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_46 Int)) (let ((.cse356 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23)) (.cse354 (+ v_prenex_23 4))) (let ((.cse353 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse356) |c_ULTIMATE.start_append_~item~0#1.base|) .cse354))) (let ((.cse355 (store .cse356 4 .cse353))) (let ((.cse352 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse355) v_arrayElimCell_46))) (or (= (select .cse352 4) 0) (= .cse353 0) (= (select .cse352 .cse354) 0) (= (select .cse355 .cse354) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_46 Int)) (let ((.cse358 (+ v_prenex_23 4))) (let ((.cse359 (let ((.cse360 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse360 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse360) |c_ULTIMATE.start_append_~item~0#1.base|) .cse358))))) (let ((.cse357 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse359) v_arrayElimCell_46))) (or (= (select .cse357 4) 0) (= (select .cse357 .cse358) 0) (= (select .cse359 .cse358) 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_28 Int) (v_prenex_22 Int) (v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse361 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_28))) (store .cse361 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse361) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_28 4))))) v_arrayElimCell_46) (+ v_prenex_22 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_prenex_24 Int) (v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse362 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_26))) (store .cse362 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse362) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_26 4))))) v_arrayElimCell_46) (+ v_prenex_24 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_27 Int) (v_arrayElimCell_46 Int)) (= (let ((.cse364 (+ v_prenex_27 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse363 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_27))) (store .cse363 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse363) |c_ULTIMATE.start_append_~item~0#1.base|) .cse364)))) v_arrayElimCell_46) .cse364)) 0))))) .cse5) (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_8 Int)) (let ((.cse370 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse368 (store .cse370 0 v_prenex_8)) (.cse367 (+ v_prenex_8 4))) (let ((.cse365 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse368) |c_ULTIMATE.start_append_~item~0#1.base|) .cse367)) (.cse366 (let ((.cse369 (store .cse370 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse369 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse369) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2))))) (or (= .cse365 0) (= (select .cse366 .cse367) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse368 4 .cse365)) v_arrayElimCell_46) 4) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse366) v_arrayElimCell_46) .cse367) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse3) (or .cse3 (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_10 Int) (v_arrayElimCell_33 Int)) (let ((.cse372 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse373 (+ v_prenex_10 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse371 (store .cse372 0 v_arrayElimCell_33))) (store .cse371 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse371) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_33))))) v_arrayElimCell_46) .cse373) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse374 (store .cse372 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse374 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse374) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse373) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse5) (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_8 Int)) (let ((.cse377 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse376 (+ v_prenex_8 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse375 (store .cse377 0 v_prenex_8))) (store .cse375 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse375) |c_ULTIMATE.start_append_~item~0#1.base|) .cse376)))) v_arrayElimCell_46) 4) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse378 (store .cse377 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse378 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse378) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse376) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse3) .cse109 (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (or (= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse379 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_19))) (store .cse379 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse379) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_19 4))))) v_arrayElimCell_46) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse3 .cse5) (or .cse26 (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse382 (+ v_prenex_15 4))) (let ((.cse381 (let ((.cse383 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15))) (store .cse383 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse383) v_arrayElimCell_34) .cse382))))) (let ((.cse380 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse381) v_arrayElimCell_34))) (or (= (select .cse380 4) 0) (= (select .cse381 .cse382) 0) (= (select .cse380 .cse382) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) (or (and (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse385 (+ v_prenex_23 4))) (let ((.cse384 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse386 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse386 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse386) v_arrayElimCell_34) .cse385)))) v_arrayElimCell_34))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse384 .cse385) 0) (= (select .cse384 4) 0))))) .cse26) (or .cse26 (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (or (= 0 (let ((.cse388 (+ v_prenex_27 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse387 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_27))) (store .cse387 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse387) v_arrayElimCell_34) .cse388)))) v_arrayElimCell_34) .cse388))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse121 (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_25)) v_arrayElimCell_34) (+ v_prenex_25 4)) 0)))) (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse392 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23)) (.cse390 (+ v_prenex_23 4))) (let ((.cse391 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse392) v_arrayElimCell_34) .cse390))) (let ((.cse389 (store .cse392 4 .cse391))) (or (= (select .cse389 .cse390) 0) (= .cse391 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse389) v_arrayElimCell_34) 4) 0)))))) .cse121) (or .cse26 (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse394 (+ v_prenex_23 4))) (let ((.cse393 (let ((.cse396 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse396 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse396) v_arrayElimCell_34) .cse394))))) (let ((.cse395 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse393) v_arrayElimCell_34))) (or (= (select .cse393 .cse394) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse395 .cse394) 0) (= (select .cse395 4) 0))))))) (or .cse26 (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_28 Int) (v_prenex_22 Int) (v_arrayElimCell_34 Int)) (let ((.cse397 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_28))) (let ((.cse398 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse397)) (.cse399 (+ v_prenex_28 4)) (.cse400 (+ v_prenex_22 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse397 4 (select (select .cse398 v_arrayElimCell_34) .cse399))) v_arrayElimCell_34) .cse400) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse397 4 (select (select .cse398 |c_ULTIMATE.start_append_~item~0#1.base|) .cse399))) v_arrayElimCell_34) .cse400) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_prenex_24 Int) (v_arrayElimCell_34 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse401 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_26))) (store .cse401 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse401) v_arrayElimCell_34) (+ v_prenex_26 4))))) v_arrayElimCell_34) (+ v_prenex_24 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse402 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23)) (.cse404 (+ v_prenex_23 4))) (let ((.cse403 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse402) v_arrayElimCell_34) .cse404))) (or (= (select (store .cse402 4 .cse403) .cse404) 0) (= .cse403 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse121)) .cse5) (or (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (let ((.cse408 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_15)) (.cse407 (+ v_prenex_15 4))) (let ((.cse406 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse408) v_arrayElimCell_34) .cse407))) (let ((.cse405 (store .cse408 4 .cse406))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse405) v_arrayElimCell_34) 4) 0) (= .cse406 0) (= (select .cse405 .cse407) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse121) (or (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_14)) v_arrayElimCell_34) (+ v_prenex_14 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse121) (or .cse0 (forall ((v_prenex_29 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse409 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_29))) (store .cse409 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse409) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_29 4))))) v_arrayElimCell_46) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse101 (or .cse26 (forall ((v_arrayElimCell_46 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$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse410 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_20))) (store .cse410 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse410) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_20 4))))) v_arrayElimCell_46) .cse2) 0)))) .cse102 (or .cse23 .cse24 .cse22 .cse25) (or (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse412 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse413 (+ v_prenex_4 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse411 (store .cse412 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse411 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse411) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_46) .cse413) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse414 (store .cse412 0 v_prenex_5))) (store .cse414 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse414) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_5 4))))) v_arrayElimCell_46) .cse413) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse26) (or .cse26 (and (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_10 Int) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (let ((.cse416 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse417 (+ v_prenex_10 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse415 (store .cse416 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse415 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse415) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_34) .cse417) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse418 (store .cse416 0 v_arrayElimCell_33))) (store .cse418 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse418) v_arrayElimCell_34) (+ 4 v_arrayElimCell_33))))) v_arrayElimCell_34) .cse417) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse5) (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_4 Int) (v_prenex_5 Int) (v_arrayElimCell_34 Int)) (let ((.cse420 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse421 (+ v_prenex_4 4))) (or (= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse419 (store .cse420 0 v_prenex_5))) (store .cse419 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse419) v_arrayElimCell_34) (+ v_prenex_5 4))))) v_arrayElimCell_34) .cse421)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse422 (store .cse420 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse422 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse422) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_34) .cse421) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_34 Int) (v_prenex_8 Int)) (let ((.cse425 (+ v_prenex_8 4)) (.cse424 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse423 (store .cse424 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse423 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse423) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_34) .cse425) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse426 (store .cse424 0 v_prenex_8))) (store .cse426 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse426) v_arrayElimCell_34) .cse425)))) v_arrayElimCell_34) 4) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_arrayElimCell_34 Int)) (let ((.cse428 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse429 (+ v_prenex_6 4))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse427 (store .cse428 0 v_prenex_7))) (store .cse427 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse427) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_7 4))))) v_arrayElimCell_34) .cse429) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse430 (store .cse428 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse430 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse430) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_34) .cse429) 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_11 Int) (v_arrayElimCell_34 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse431 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse431 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse431) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) v_arrayElimCell_34) (+ v_prenex_11 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_34 Int) (v_prenex_8 Int)) (let ((.cse435 (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse432 (let ((.cse436 (store .cse435 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse436 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse436) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) (.cse433 (+ v_prenex_8 4))) (or (= (select .cse432 .cse433) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse432) v_arrayElimCell_34) .cse433) 0) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse434 (store .cse435 0 v_prenex_8))) (store .cse434 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse434) v_arrayElimCell_34) .cse433)))) v_arrayElimCell_34) 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse110 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_34 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse437 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse437 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse437) v_arrayElimCell_34) .cse2)))) v_arrayElimCell_34) .cse2) 0))) .cse121) .cse103) .cse6) (or .cse3 .cse5 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int)) (let ((.cse439 (+ v_prenex_23 4))) (let ((.cse438 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse440 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse440 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse440) |c_ULTIMATE.start_append_~item~0#1.base|) .cse439)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse438 .cse439) 0) (= (select .cse438 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse441 .cse442 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int)) (let ((.cse444 (+ v_prenex_23 4))) (let ((.cse445 (let ((.cse446 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_23))) (store .cse446 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse446) |c_ULTIMATE.start_append_~item~0#1.base|) .cse444))))) (let ((.cse443 (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse445) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse443 .cse444) 0) (= (select .cse445 .cse444) 0) (= (select .cse443 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_27 Int)) (= (let ((.cse448 (+ v_prenex_27 4))) (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse447 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_27))) (store .cse447 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse447) |c_ULTIMATE.start_append_~item~0#1.base|) .cse448)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse448)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or .cse23 .cse24 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse450 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse449 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse450) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2))) (or (= .cse449 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_21 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse450 4 .cse449)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_21 4)) 0)))))) .cse451 (or .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_21 Int)) (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse452 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse452 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse452) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_21 4)) 0)))))) .cse25) (or (and (or .cse453 .cse121) (or (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ |c_ULTIMATE.start_append_~plist#1.offset| 1)) .cse121) (or .cse121 .cse5)) .cse451) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse454 (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_prenex_20))) (store .cse454 4 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse454) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_20 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse26)))))) is different from true Killed by 15