./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0232-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0232-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7d99b84861b7e58e44833cf97c5fb5fa14d1ad6f1b87526d3144a9659451e97 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:36:27,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:36:27,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:36:27,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:36:27,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:36:27,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:36:27,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:36:27,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:36:27,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:36:27,820 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:36:27,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:36:27,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:36:27,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:36:27,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:36:27,820 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:36:27,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:36:27,821 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:36:27,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:36:27,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:36:27,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:36:27,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:36:27,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:36:27,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:36:27,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:36:27,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:36:27,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:36:27,822 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7d99b84861b7e58e44833cf97c5fb5fa14d1ad6f1b87526d3144a9659451e97 [2025-03-04 07:36:28,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:36:28,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:36:28,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:36:28,068 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:36:28,069 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:36:28,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-2.i [2025-03-04 07:36:29,289 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e6e6b8e/499fabf9f79748959fae1b5b99f7b1f7/FLAG321896b22 [2025-03-04 07:36:29,545 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:36:29,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-2.i [2025-03-04 07:36:29,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e6e6b8e/499fabf9f79748959fae1b5b99f7b1f7/FLAG321896b22 [2025-03-04 07:36:29,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e6e6b8e/499fabf9f79748959fae1b5b99f7b1f7 [2025-03-04 07:36:29,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:36:29,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:36:29,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:36:29,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:36:29,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:36:29,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:36:29" (1/1) ... [2025-03-04 07:36:29,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d3acc70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:29, skipping insertion in model container [2025-03-04 07:36:29,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:36:29" (1/1) ... [2025-03-04 07:36:29,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:36:30,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:36:30,078 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:36:30,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:36:30,140 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:36:30,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:30 WrapperNode [2025-03-04 07:36:30,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:36:30,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:36:30,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:36:30,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:36:30,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:30" (1/1) ... [2025-03-04 07:36:30,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:30" (1/1) ... [2025-03-04 07:36:30,166 INFO L138 Inliner]: procedures = 126, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2025-03-04 07:36:30,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:36:30,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:36:30,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:36:30,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:36:30,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:30" (1/1) ... [2025-03-04 07:36:30,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:30" (1/1) ... [2025-03-04 07:36:30,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:30" (1/1) ... [2025-03-04 07:36:30,189 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 12, 8]. 55 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 3, 2]. [2025-03-04 07:36:30,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:30" (1/1) ... [2025-03-04 07:36:30,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:30" (1/1) ... [2025-03-04 07:36:30,197 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:30" (1/1) ... [2025-03-04 07:36:30,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:30" (1/1) ... [2025-03-04 07:36:30,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:30" (1/1) ... [2025-03-04 07:36:30,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:30" (1/1) ... [2025-03-04 07:36:30,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:36:30,201 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:36:30,201 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:36:30,201 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:36:30,202 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:30" (1/1) ... [2025-03-04 07:36:30,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:36:30,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:36:30,225 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:36:30,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:36:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:36:30,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:36:30,321 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:36:30,322 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:36:30,531 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-03-04 07:36:30,540 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-03-04 07:36:30,540 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:36:30,549 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:36:30,549 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:36:30,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:36:30 BoogieIcfgContainer [2025-03-04 07:36:30,549 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:36:30,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:36:30,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:36:30,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:36:30,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:36:29" (1/3) ... [2025-03-04 07:36:30,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c8faf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:36:30, skipping insertion in model container [2025-03-04 07:36:30,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:36:30" (2/3) ... [2025-03-04 07:36:30,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c8faf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:36:30, skipping insertion in model container [2025-03-04 07:36:30,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:36:30" (3/3) ... [2025-03-04 07:36:30,557 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0232-2.i [2025-03-04 07:36:30,566 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:36:30,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0232-2.i that has 1 procedures, 95 locations, 1 initial locations, 2 loop locations, and 48 error locations. [2025-03-04 07:36:30,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:36:30,607 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4171fd58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:36:30,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2025-03-04 07:36:30,611 INFO L276 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-03-04 07:36:30,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:36:30,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:30,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:36:30,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:30,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash 4000863, now seen corresponding path program 1 times [2025-03-04 07:36:30,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:30,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390479336] [2025-03-04 07:36:30,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:30,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:36:30,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:36:30,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:30,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:30,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:30,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390479336] [2025-03-04 07:36:30,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390479336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:30,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:30,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:36:30,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60983545] [2025-03-04 07:36:30,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:30,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:36:30,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:31,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:36:31,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:31,019 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-03-04 07:36:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:31,222 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2025-03-04 07:36:31,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:36:31,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 07:36:31,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:31,228 INFO L225 Difference]: With dead ends: 108 [2025-03-04 07:36:31,228 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 07:36:31,229 INFO L434 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-03-04 07:36:31,232 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 78 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:31,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 98 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:36:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 07:36:31,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2025-03-04 07:36:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 94 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2025-03-04 07:36:31,260 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 4 [2025-03-04 07:36:31,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:31,261 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2025-03-04 07:36:31,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2025-03-04 07:36:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:36:31,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:31,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:36:31,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:36:31,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:31,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:31,263 INFO L85 PathProgramCache]: Analyzing trace with hash 4000862, now seen corresponding path program 1 times [2025-03-04 07:36:31,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:31,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139056458] [2025-03-04 07:36:31,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:31,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:31,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:36:31,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:36:31,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:31,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:31,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:31,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139056458] [2025-03-04 07:36:31,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139056458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:31,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:31,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:36:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244344022] [2025-03-04 07:36:31,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:31,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:36:31,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:31,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:36:31,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:31,343 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:31,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:31,439 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2025-03-04 07:36:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:36:31,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 07:36:31,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:31,441 INFO L225 Difference]: With dead ends: 90 [2025-03-04 07:36:31,442 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 07:36:31,442 INFO L434 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-03-04 07:36:31,443 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 83 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:31,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 75 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 07:36:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-04 07:36:31,448 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-03-04 07:36:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2025-03-04 07:36:31,450 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 4 [2025-03-04 07:36:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:31,450 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2025-03-04 07:36:31,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2025-03-04 07:36:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:36:31,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:31,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:36:31,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:36:31,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:31,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:31,451 INFO L85 PathProgramCache]: Analyzing trace with hash 124026783, now seen corresponding path program 1 times [2025-03-04 07:36:31,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:31,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629430360] [2025-03-04 07:36:31,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:31,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:31,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:36:31,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:36:31,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:31,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:31,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:31,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629430360] [2025-03-04 07:36:31,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629430360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:31,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:31,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:36:31,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52945714] [2025-03-04 07:36:31,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:31,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:36:31,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:31,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:36:31,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:36:31,503 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-03-04 07:36:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:31,562 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2025-03-04 07:36:31,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:36:31,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:36:31,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:31,563 INFO L225 Difference]: With dead ends: 86 [2025-03-04 07:36:31,563 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 07:36:31,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:36:31,564 INFO L435 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:31,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 98 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:31,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 07:36:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-04 07:36:31,571 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-03-04 07:36:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2025-03-04 07:36:31,573 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 5 [2025-03-04 07:36:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:31,573 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2025-03-04 07:36:31,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2025-03-04 07:36:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:36:31,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:31,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:36:31,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:36:31,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:31,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash 124026784, now seen corresponding path program 1 times [2025-03-04 07:36:31,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:31,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846302728] [2025-03-04 07:36:31,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:31,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:36:31,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:36:31,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:31,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:31,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:31,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846302728] [2025-03-04 07:36:31,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846302728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:31,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:31,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:36:31,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047504732] [2025-03-04 07:36:31,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:31,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:36:31,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:31,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:36:31,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:36:31,635 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-03-04 07:36:31,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:31,680 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2025-03-04 07:36:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:36:31,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:36:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:31,682 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:36:31,682 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 07:36:31,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:36:31,682 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:31,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 102 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:36:31,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 07:36:31,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-04 07:36:31,689 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-03-04 07:36:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2025-03-04 07:36:31,690 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 5 [2025-03-04 07:36:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:31,690 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2025-03-04 07:36:31,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2025-03-04 07:36:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:36:31,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:31,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:31,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:36:31,692 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:31,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:31,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1051873319, now seen corresponding path program 1 times [2025-03-04 07:36:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:31,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702284813] [2025-03-04 07:36:31,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:31,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:31,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:36:31,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:36:31,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:31,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:31,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:31,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702284813] [2025-03-04 07:36:31,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702284813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:31,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:31,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:36:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501620030] [2025-03-04 07:36:31,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:31,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:36:31,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:31,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:36:31,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:31,888 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-03-04 07:36:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:32,023 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2025-03-04 07:36:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:36:32,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:36:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:32,024 INFO L225 Difference]: With dead ends: 92 [2025-03-04 07:36:32,024 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 07:36:32,024 INFO L434 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-03-04 07:36:32,024 INFO L435 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-03-04 07:36:32,024 INFO L436 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-03-04 07:36:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 07:36:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2025-03-04 07:36:32,027 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-03-04 07:36:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2025-03-04 07:36:32,028 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 10 [2025-03-04 07:36:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:32,028 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2025-03-04 07:36:32,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2025-03-04 07:36:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:36:32,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:32,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:32,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:36:32,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:32,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1751628848, now seen corresponding path program 1 times [2025-03-04 07:36:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:32,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475645010] [2025-03-04 07:36:32,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:32,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:32,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:36:32,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:36:32,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:32,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:32,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:32,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475645010] [2025-03-04 07:36:32,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475645010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:32,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:32,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003458260] [2025-03-04 07:36:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:32,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:32,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:32,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:32,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:32,156 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-03-04 07:36:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:32,221 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2025-03-04 07:36:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:36:32,222 INFO L78 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-03-04 07:36:32,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:32,223 INFO L225 Difference]: With dead ends: 87 [2025-03-04 07:36:32,223 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 07:36:32,223 INFO L434 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-03-04 07:36:32,224 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 79 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:32,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 131 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:36:32,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 07:36:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-03-04 07:36:32,229 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-03-04 07:36:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2025-03-04 07:36:32,229 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 11 [2025-03-04 07:36:32,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:32,229 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2025-03-04 07:36:32,229 INFO L472 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-03-04 07:36:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2025-03-04 07:36:32,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:36:32,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:32,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:32,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:36:32,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:32,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:32,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1332179721, now seen corresponding path program 1 times [2025-03-04 07:36:32,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:32,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881626771] [2025-03-04 07:36:32,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:32,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:32,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:36:32,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:36:32,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:32,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:32,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:32,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881626771] [2025-03-04 07:36:32,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881626771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:32,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:32,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:32,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019928383] [2025-03-04 07:36:32,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:32,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:32,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:32,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:32,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:32,372 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-03-04 07:36:32,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:32,500 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2025-03-04 07:36:32,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:32,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 07:36:32,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:32,501 INFO L225 Difference]: With dead ends: 95 [2025-03-04 07:36:32,501 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 07:36:32,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:36:32,502 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 57 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:32,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 131 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 07:36:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2025-03-04 07:36:32,509 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-03-04 07:36:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2025-03-04 07:36:32,509 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 17 [2025-03-04 07:36:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:32,509 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2025-03-04 07:36:32,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2025-03-04 07:36:32,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:36:32,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:32,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:32,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:36:32,510 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:32,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1332179722, now seen corresponding path program 1 times [2025-03-04 07:36:32,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:32,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106623644] [2025-03-04 07:36:32,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:32,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:32,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:36:32,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:36:32,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:32,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:32,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:32,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106623644] [2025-03-04 07:36:32,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106623644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:32,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:32,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:32,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657131007] [2025-03-04 07:36:32,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:32,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:32,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:32,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:32,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:32,797 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-03-04 07:36:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:32,963 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2025-03-04 07:36:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:32,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 07:36:32,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:32,964 INFO L225 Difference]: With dead ends: 95 [2025-03-04 07:36:32,964 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 07:36:32,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:36:32,965 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 59 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:32,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 161 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:32,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 07:36:32,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2025-03-04 07:36:32,970 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-03-04 07:36:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2025-03-04 07:36:32,973 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 17 [2025-03-04 07:36:32,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:32,974 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2025-03-04 07:36:32,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2025-03-04 07:36:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:36:32,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:32,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:32,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:36:32,974 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:32,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:32,975 INFO L85 PathProgramCache]: Analyzing trace with hash 324367080, now seen corresponding path program 1 times [2025-03-04 07:36:32,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:32,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487049763] [2025-03-04 07:36:32,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:32,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:32,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:36:32,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:36:32,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:32,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:33,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:33,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487049763] [2025-03-04 07:36:33,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487049763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:33,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:33,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:33,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593716284] [2025-03-04 07:36:33,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:33,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:36:33,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:33,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:36:33,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:36:33,083 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-03-04 07:36:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:33,147 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2025-03-04 07:36:33,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:33,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 07:36:33,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:33,149 INFO L225 Difference]: With dead ends: 79 [2025-03-04 07:36:33,149 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 07:36:33,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:33,150 INFO L435 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-03-04 07:36:33,150 INFO L436 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-03-04 07:36:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 07:36:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2025-03-04 07:36:33,152 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-03-04 07:36:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2025-03-04 07:36:33,152 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 19 [2025-03-04 07:36:33,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:33,152 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2025-03-04 07:36:33,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:33,153 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2025-03-04 07:36:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:36:33,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:33,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:33,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:36:33,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:33,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1468278990, now seen corresponding path program 1 times [2025-03-04 07:36:33,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:33,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491055922] [2025-03-04 07:36:33,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:33,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:36:33,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:36:33,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:33,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:33,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:33,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491055922] [2025-03-04 07:36:33,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491055922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:33,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:33,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104096360] [2025-03-04 07:36:33,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:33,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:33,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:33,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:33,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:33,293 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-03-04 07:36:33,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:33,396 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2025-03-04 07:36:33,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:33,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 07:36:33,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:33,397 INFO L225 Difference]: With dead ends: 78 [2025-03-04 07:36:33,397 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 07:36:33,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:36:33,398 INFO L435 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-03-04 07:36:33,398 INFO L436 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-03-04 07:36:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 07:36:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2025-03-04 07:36:33,400 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-03-04 07:36:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2025-03-04 07:36:33,400 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 20 [2025-03-04 07:36:33,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:33,400 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2025-03-04 07:36:33,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:33,400 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2025-03-04 07:36:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:36:33,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:33,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:33,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:36:33,401 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:33,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:33,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1468278991, now seen corresponding path program 1 times [2025-03-04 07:36:33,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:33,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696739] [2025-03-04 07:36:33,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:33,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:33,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:36:33,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:36:33,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:33,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:33,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:33,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696739] [2025-03-04 07:36:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:33,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:33,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:36:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793011352] [2025-03-04 07:36:33,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:33,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:36:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:33,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:36:33,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:33,626 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-03-04 07:36:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:33,731 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2025-03-04 07:36:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:36:33,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 07:36:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:33,732 INFO L225 Difference]: With dead ends: 77 [2025-03-04 07:36:33,732 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 07:36:33,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:36:33,733 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 44 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:33,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 158 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:33,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 07:36:33,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2025-03-04 07:36:33,735 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-03-04 07:36:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2025-03-04 07:36:33,735 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 20 [2025-03-04 07:36:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:33,735 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2025-03-04 07:36:33,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2025-03-04 07:36:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:36:33,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:33,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:33,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:36:33,736 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:33,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1618402043, now seen corresponding path program 1 times [2025-03-04 07:36:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:33,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334120454] [2025-03-04 07:36:33,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:33,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:33,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:36:33,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:36:33,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:33,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:33,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:33,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334120454] [2025-03-04 07:36:33,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334120454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:36:33,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62423558] [2025-03-04 07:36:33,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:33,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:36:33,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:36:33,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:36:33,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:36:33,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:36:34,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:36:34,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:34,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:34,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 07:36:34,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:36:34,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:36:34,118 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-04 07:36:34,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-03-04 07:36:34,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:36:34,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:36:34,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:36:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:34,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:36:34,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2025-03-04 07:36:34,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:36:34,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2025-03-04 07:36:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:35,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62423558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:36:35,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:36:35,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 07:36:35,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647404832] [2025-03-04 07:36:35,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:36:35,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:36:35,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:35,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:36:35,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:36:35,055 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:35,354 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2025-03-04 07:36:35,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:36:35,354 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-04 07:36:35,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:35,355 INFO L225 Difference]: With dead ends: 76 [2025-03-04 07:36:35,355 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 07:36:35,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:36:35,355 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 68 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:35,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 355 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:36:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 07:36:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2025-03-04 07:36:35,357 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-03-04 07:36:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2025-03-04 07:36:35,357 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 21 [2025-03-04 07:36:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:35,357 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2025-03-04 07:36:35,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2025-03-04 07:36:35,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:36:35,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:35,359 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:35,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:36:35,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 07:36:35,562 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:35,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1618402042, now seen corresponding path program 1 times [2025-03-04 07:36:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:35,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721935819] [2025-03-04 07:36:35,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:35,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:36:35,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:36:35,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:35,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:35,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:35,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721935819] [2025-03-04 07:36:35,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721935819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:36:35,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180047075] [2025-03-04 07:36:35,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:35,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:36:35,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:36:35,856 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:36:35,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:36:35,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:36:35,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:36:35,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:35,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:35,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 07:36:35,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:36:36,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:36:36,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:36:36,053 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:36:36,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-04 07:36:36,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 07:36:36,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:36:36,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:36:36,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:36:36,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:36:36,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:36:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:36,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:36:36,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2025-03-04 07:36:36,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2025-03-04 07:36:36,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-03-04 07:36:36,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:36:36,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2025-03-04 07:36:36,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2025-03-04 07:36:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:36,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180047075] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:36:36,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:36:36,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-04 07:36:36,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015764270] [2025-03-04 07:36:36,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:36:36,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 07:36:36,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:36,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 07:36:36,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:36:36,639 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 19 states, 18 states have (on average 2.611111111111111) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:37,006 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2025-03-04 07:36:37,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:36:37,007 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.611111111111111) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-04 07:36:37,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:37,007 INFO L225 Difference]: With dead ends: 75 [2025-03-04 07:36:37,007 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 07:36:37,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:36:37,008 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 71 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:37,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 375 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:36:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 07:36:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-03-04 07:36:37,009 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-03-04 07:36:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2025-03-04 07:36:37,009 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 21 [2025-03-04 07:36:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:37,009 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2025-03-04 07:36:37,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.611111111111111) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2025-03-04 07:36:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:36:37,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:37,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:37,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:36:37,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 07:36:37,215 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:37,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:37,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1727991548, now seen corresponding path program 1 times [2025-03-04 07:36:37,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:37,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668198675] [2025-03-04 07:36:37,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:37,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:37,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:36:37,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:36:37,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:37,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:37,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:37,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668198675] [2025-03-04 07:36:37,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668198675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:37,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:37,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:36:37,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196138743] [2025-03-04 07:36:37,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:37,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:36:37,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:37,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:36:37,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:36:37,384 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-03-04 07:36:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:37,545 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2025-03-04 07:36:37,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:36:37,545 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-04 07:36:37,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:37,546 INFO L225 Difference]: With dead ends: 110 [2025-03-04 07:36:37,546 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 07:36:37,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:36:37,546 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 36 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:37,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 289 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:37,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 07:36:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 85. [2025-03-04 07:36:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.375) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2025-03-04 07:36:37,548 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 21 [2025-03-04 07:36:37,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:37,549 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2025-03-04 07:36:37,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:37,549 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2025-03-04 07:36:37,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:36:37,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:37,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:37,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:36:37,549 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:37,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:37,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2028130420, now seen corresponding path program 1 times [2025-03-04 07:36:37,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:37,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037793373] [2025-03-04 07:36:37,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:37,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:37,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:36:37,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:36:37,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:37,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:37,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:37,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037793373] [2025-03-04 07:36:37,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037793373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:37,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:37,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:36:37,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377299435] [2025-03-04 07:36:37,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:37,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:36:37,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:37,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:36:37,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:36:37,771 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:37,964 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2025-03-04 07:36:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:36:37,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-04 07:36:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:37,965 INFO L225 Difference]: With dead ends: 109 [2025-03-04 07:36:37,965 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 07:36:37,965 INFO L434 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-03-04 07:36:37,965 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 36 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:37,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 211 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 07:36:37,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 86. [2025-03-04 07:36:37,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 85 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2025-03-04 07:36:37,967 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 22 [2025-03-04 07:36:37,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:37,967 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2025-03-04 07:36:37,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2025-03-04 07:36:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:36:37,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:37,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:37,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:36:37,968 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:37,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:37,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1552466434, now seen corresponding path program 1 times [2025-03-04 07:36:37,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:37,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655876486] [2025-03-04 07:36:37,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:37,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:37,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:36:37,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:36:37,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:37,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:38,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:38,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655876486] [2025-03-04 07:36:38,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655876486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:38,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:38,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:36:38,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932574031] [2025-03-04 07:36:38,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:38,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:36:38,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:38,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:36:38,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:36:38,180 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-03-04 07:36:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:38,354 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2025-03-04 07:36:38,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:36:38,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:36:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:38,355 INFO L225 Difference]: With dead ends: 100 [2025-03-04 07:36:38,355 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 07:36:38,355 INFO L434 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-03-04 07:36:38,355 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:38,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 209 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 07:36:38,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2025-03-04 07:36:38,357 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-03-04 07:36:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2025-03-04 07:36:38,357 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 23 [2025-03-04 07:36:38,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:38,357 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2025-03-04 07:36:38,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:38,357 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2025-03-04 07:36:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:36:38,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:38,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:38,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:36:38,358 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:38,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:38,360 INFO L85 PathProgramCache]: Analyzing trace with hash 881819209, now seen corresponding path program 1 times [2025-03-04 07:36:38,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:38,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134193608] [2025-03-04 07:36:38,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:38,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:38,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:36:38,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:36:38,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:38,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:38,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:38,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134193608] [2025-03-04 07:36:38,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134193608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:38,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:38,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:36:38,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751618703] [2025-03-04 07:36:38,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:38,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:36:38,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:38,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:36:38,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:36:38,494 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-03-04 07:36:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:38,587 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2025-03-04 07:36:38,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:38,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:36:38,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:38,587 INFO L225 Difference]: With dead ends: 86 [2025-03-04 07:36:38,587 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 07:36:38,588 INFO L434 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-03-04 07:36:38,588 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 154 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:38,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 62 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 07:36:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-04 07:36:38,589 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-03-04 07:36:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2025-03-04 07:36:38,590 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 24 [2025-03-04 07:36:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:38,593 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2025-03-04 07:36:38,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2025-03-04 07:36:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:36:38,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:38,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:38,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:36:38,593 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:38,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:38,593 INFO L85 PathProgramCache]: Analyzing trace with hash 881819210, now seen corresponding path program 1 times [2025-03-04 07:36:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:38,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114407958] [2025-03-04 07:36:38,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:38,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:36:38,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:36:38,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:38,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:38,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:38,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114407958] [2025-03-04 07:36:38,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114407958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:38,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:38,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:36:38,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826785430] [2025-03-04 07:36:38,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:38,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:36:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:38,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:36:38,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:36:38,632 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-03-04 07:36:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:38,664 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2025-03-04 07:36:38,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:36:38,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:36:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:38,665 INFO L225 Difference]: With dead ends: 80 [2025-03-04 07:36:38,665 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 07:36:38,665 INFO L434 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-03-04 07:36:38,665 INFO L435 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-03-04 07:36:38,665 INFO L436 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-03-04 07:36:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 07:36:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 07:36:38,667 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-03-04 07:36:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2025-03-04 07:36:38,667 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 24 [2025-03-04 07:36:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:38,667 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2025-03-04 07:36:38,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2025-03-04 07:36:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:36:38,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:38,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:38,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:36:38,668 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:38,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:38,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1566591712, now seen corresponding path program 1 times [2025-03-04 07:36:38,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:38,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875546762] [2025-03-04 07:36:38,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:38,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:38,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:36:38,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:36:38,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:38,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:38,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:38,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875546762] [2025-03-04 07:36:38,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875546762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:38,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:38,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:36:38,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321895843] [2025-03-04 07:36:38,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:38,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:36:38,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:38,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:36:38,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:36:38,735 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-03-04 07:36:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:38,783 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2025-03-04 07:36:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:36:38,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-04 07:36:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:38,783 INFO L225 Difference]: With dead ends: 79 [2025-03-04 07:36:38,783 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 07:36:38,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:38,784 INFO L435 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-03-04 07:36:38,784 INFO L436 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-03-04 07:36:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 07:36:38,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-04 07:36:38,785 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-03-04 07:36:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-03-04 07:36:38,785 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 25 [2025-03-04 07:36:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:38,786 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-03-04 07:36:38,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-03-04 07:36:38,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:36:38,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:38,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:38,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:36:38,786 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:38,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1319702823, now seen corresponding path program 1 times [2025-03-04 07:36:38,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:38,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203245467] [2025-03-04 07:36:38,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:38,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:38,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:36:38,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:36:38,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:38,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:38,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:38,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203245467] [2025-03-04 07:36:38,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203245467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:38,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:38,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:36:38,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772285288] [2025-03-04 07:36:38,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:38,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:36:38,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:38,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:36:38,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:36:38,886 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-03-04 07:36:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:38,956 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2025-03-04 07:36:38,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:38,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-04 07:36:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:38,957 INFO L225 Difference]: With dead ends: 81 [2025-03-04 07:36:38,957 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 07:36:38,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:38,957 INFO L435 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-03-04 07:36:38,957 INFO L436 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-03-04 07:36:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 07:36:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-03-04 07:36:38,958 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-03-04 07:36:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2025-03-04 07:36:38,959 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 26 [2025-03-04 07:36:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:38,959 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2025-03-04 07:36:38,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2025-03-04 07:36:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:36:38,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:38,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:38,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 07:36:38,959 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:38,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:38,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2038885442, now seen corresponding path program 1 times [2025-03-04 07:36:38,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:38,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129062618] [2025-03-04 07:36:38,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:38,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:38,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:36:38,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:36:38,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:38,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:39,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:39,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129062618] [2025-03-04 07:36:39,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129062618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:39,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:39,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:36:39,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574733426] [2025-03-04 07:36:39,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:39,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:36:39,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:39,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:36:39,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:36:39,188 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-03-04 07:36:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:39,470 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2025-03-04 07:36:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:36:39,470 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-04 07:36:39,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:39,471 INFO L225 Difference]: With dead ends: 98 [2025-03-04 07:36:39,471 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 07:36:39,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:36:39,471 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:39,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 209 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:36:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 07:36:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2025-03-04 07:36:39,473 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-03-04 07:36:39,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2025-03-04 07:36:39,473 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 27 [2025-03-04 07:36:39,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:39,474 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2025-03-04 07:36:39,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2025-03-04 07:36:39,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:36:39,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:39,474 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-03-04 07:36:39,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 07:36:39,474 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:39,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:39,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1219060740, now seen corresponding path program 1 times [2025-03-04 07:36:39,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:39,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934166655] [2025-03-04 07:36:39,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:39,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:36:39,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:36:39,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:39,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:39,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:39,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934166655] [2025-03-04 07:36:39,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934166655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:39,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:39,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:39,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644464633] [2025-03-04 07:36:39,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:39,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:39,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:39,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:39,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:39,580 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-03-04 07:36:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:39,652 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2025-03-04 07:36:39,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:36:39,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 07:36:39,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:39,655 INFO L225 Difference]: With dead ends: 81 [2025-03-04 07:36:39,655 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 07:36:39,655 INFO L434 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-03-04 07:36:39,656 INFO L435 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-03-04 07:36:39,656 INFO L436 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-03-04 07:36:39,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 07:36:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-04 07:36:39,657 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-03-04 07:36:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-03-04 07:36:39,657 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 28 [2025-03-04 07:36:39,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:39,660 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-03-04 07:36:39,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:39,660 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-03-04 07:36:39,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:36:39,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:39,661 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-03-04 07:36:39,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 07:36:39,661 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:39,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:39,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1685398808, now seen corresponding path program 1 times [2025-03-04 07:36:39,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:39,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034859806] [2025-03-04 07:36:39,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:39,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:39,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:36:39,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:36:39,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:39,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:40,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:40,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034859806] [2025-03-04 07:36:40,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034859806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:40,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:40,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 07:36:40,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845808878] [2025-03-04 07:36:40,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:40,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:36:40,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:40,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:36:40,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:36:40,102 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-03-04 07:36:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:40,278 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2025-03-04 07:36:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:36:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-04 07:36:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:40,279 INFO L225 Difference]: With dead ends: 108 [2025-03-04 07:36:40,279 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 07:36:40,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:36:40,279 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:40,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 375 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:36:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 07:36:40,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2025-03-04 07:36:40,281 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-03-04 07:36:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2025-03-04 07:36:40,281 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 33 [2025-03-04 07:36:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:40,281 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2025-03-04 07:36:40,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:36:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2025-03-04 07:36:40,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:36:40,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:40,284 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-03-04 07:36:40,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 07:36:40,284 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:40,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:40,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1685399192, now seen corresponding path program 1 times [2025-03-04 07:36:40,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:40,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779935598] [2025-03-04 07:36:40,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:40,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:40,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:36:40,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:36:40,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:40,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:40,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:40,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779935598] [2025-03-04 07:36:40,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779935598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:40,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:40,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 07:36:40,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802322924] [2025-03-04 07:36:40,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:40,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:36:40,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:36:40,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:36:40,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:36:40,924 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 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-03-04 07:36:41,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:41,332 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2025-03-04 07:36:41,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:36:41,333 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 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-03-04 07:36:41,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:41,333 INFO L225 Difference]: With dead ends: 107 [2025-03-04 07:36:41,333 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 07:36:41,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:36:41,334 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:41,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 265 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:36:41,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 07:36:41,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-03-04 07:36:41,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-03-04 07:36:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2025-03-04 07:36:41,336 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 33 [2025-03-04 07:36:41,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:41,336 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2025-03-04 07:36:41,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 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-03-04 07:36:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2025-03-04 07:36:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:36:41,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:41,340 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-03-04 07:36:41,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 07:36:41,340 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-03-04 07:36:41,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:41,340 INFO L85 PathProgramCache]: Analyzing trace with hash 558619540, now seen corresponding path program 1 times [2025-03-04 07:36:41,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:36:41,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701580791] [2025-03-04 07:36:41,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:36:41,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:36:41,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:36:41,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:41,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:36:42,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:36:42,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701580791] [2025-03-04 07:36:42,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701580791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:36:42,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124257630] [2025-03-04 07:36:42,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:42,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:36:42,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:36:42,036 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:36:42,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:36:42,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:36:42,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:36:42,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:42,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:42,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-04 07:36:42,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:36:42,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:36:42,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:36:42,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:36:42,315 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:36:42,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-04 07:36:42,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 07:36:42,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-03-04 07:36:42,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 07:36:42,745 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:36:42,749 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 07:36:42,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2025-03-04 07:36:42,842 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:36:42,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 41 [2025-03-04 07:36:42,847 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:36:42,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-04 07:36:43,061 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:36:43,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2025-03-04 07:36:43,073 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:36:43,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:36:43,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2025-03-04 07:36:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:36:43,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:36:51,794 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-04 07:36:51,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 180 [2025-03-04 07:36:51,906 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-04 07:36:51,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 286 treesize of output 272 [2025-03-04 07:36:51,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:36:51,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 194 [2025-03-04 07:36:51,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:36:51,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 188 [2025-03-04 07:36:52,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-04 07:36:52,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-04 07:36:52,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:36:52,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 306 treesize of output 320 [2025-03-04 07:36:53,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:36:53,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1904 treesize of output 1874 [2025-03-04 07:37:10,990 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse345 (< |c_ULTIMATE.start_append_~plist#1.offset| 1)) (.cse47 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 1))) (let ((.cse299 (or .cse345 .cse47)) (.cse300 (or .cse47 (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ 2 |c_ULTIMATE.start_append_~plist#1.offset|)))) (.cse40 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|)) (.cse45 (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse155 (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 ((.cse409 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse410 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse410 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse410) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_15))) (or (= (select .cse409 4) 0) (= (select .cse409 .cse45) 0))))))) (.cse156 (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)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse408 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse408 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse408) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_15) .cse45) 0))))) (.cse131 (< |c_ULTIMATE.start_append_~plist#1.offset| 0)) (.cse132 (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse135 (not .cse40)) (.cse10 (and .cse299 .cse300)) (.cse19 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) (let ((.cse11 (or (forall ((v_arrayElimCell_50 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53)) v_arrayElimCell_50) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse19)) (.cse8 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_18 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse407 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse407 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse407) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_18) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse6 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_22 Int) (v_arrayElimCell_53 Int)) (= 0 (let ((.cse406 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse405 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse405 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse405) v_prenex_22) .cse406)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse406)))) (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_prenex_23 Int) (v_arrayElimCell_53 Int) (v_arrayElimCell_42 Int)) (= (let ((.cse404 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse403 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse403 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse403) v_arrayElimCell_42) .cse404)))) v_prenex_23) .cse404)) 0))))) (.cse39 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse402 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse401 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse401 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse401) |c_ULTIMATE.start_append_~item~0#1.base|) .cse402)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse402)) 0)))) (.cse12 (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (= 0 (let ((.cse400 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse399 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse399 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse399) v_prenex_12) .cse400)))) v_prenex_12) .cse400))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse10)) (.cse13 (or .cse19 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse398 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (let ((.cse397 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse398) v_prenex_13) (+ 4 v_arrayElimCell_53)))) (or (= .cse397 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse398 4 .cse397)) v_prenex_13) 4) 0))))))) (.cse14 (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse394 (+ 4 v_arrayElimCell_53))) (let ((.cse393 (let ((.cse396 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse396 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse396) v_prenex_13) .cse394))))) (let ((.cse395 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse393) v_prenex_13))) (or (= (select .cse393 .cse394) 0) (= (select .cse395 .cse394) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse395 4) 0)))))) .cse19)) (.cse21 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int) (v_arrayElimCell_53 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse392 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse392 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse392) v_arrayElimCell_42) (+ 4 v_arrayElimCell_41))))) v_prenex_23) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse32 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse391 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse391 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse391) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_53)) 0))))) (.cse20 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_53 Int)) (let ((.cse390 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse389 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse390) v_prenex_26) (+ 4 v_arrayElimCell_41)))) (let ((.cse386 (store .cse390 4 .cse389))) (let ((.cse388 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse386) v_prenex_26)) (.cse387 (+ 4 v_arrayElimCell_53))) (or (= (select .cse386 .cse387) 0) (= (select .cse388 4) 0) (= .cse389 0) (= (select .cse388 .cse387) 0)))))))))) (.cse33 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_53 Int)) (let ((.cse383 (let ((.cse385 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse385 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse385) v_prenex_26) (+ 4 v_arrayElimCell_41))))) (.cse384 (+ 4 v_arrayElimCell_53))) (or (= (select .cse383 .cse384) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse383) v_prenex_26) .cse384) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse35 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_53 Int)) (let ((.cse379 (let ((.cse382 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse382 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse382) v_prenex_26) (+ 4 v_arrayElimCell_41)))))) (let ((.cse381 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse379) v_prenex_26)) (.cse380 (+ 4 v_arrayElimCell_53))) (or (= (select .cse379 .cse380) 0) (= (select .cse381 4) 0) (= (select .cse381 .cse380) 0)))))))) (.cse36 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_25 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse378 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse378 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse378) v_prenex_25) (+ 4 v_arrayElimCell_41))))) v_prenex_25) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse34 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_22 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse377 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse377 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse377) v_prenex_22) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse15 (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse376 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53)) (.cse374 (+ 4 v_arrayElimCell_53))) (let ((.cse375 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse376) v_prenex_13) .cse374))) (let ((.cse373 (store .cse376 4 .cse375))) (or (= (select .cse373 .cse374) 0) (= .cse375 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse373) v_prenex_13) 4) 0)))))) .cse19)) (.cse16 (or .cse10 (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_16 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse364 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse364 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse364) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_16) (+ 4 v_arrayElimCell_53)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_14 Int) (v_arrayElimCell_53 Int)) (let ((.cse367 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse365 (+ 4 v_arrayElimCell_53))) (or (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse365) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse366 (store .cse367 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse366 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse366) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_14) 4) 0) (= (select (let ((.cse368 (store .cse367 0 v_arrayElimCell_53))) (store .cse368 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse368) v_prenex_14) .cse365))) .cse365) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_53 Int)) (let ((.cse370 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse371 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse369 (store .cse370 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse369 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse369) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_14) .cse371) 0) (= (select (let ((.cse372 (store .cse370 0 v_arrayElimCell_53))) (store .cse372 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse372) v_prenex_14) .cse371))) .cse371) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse2 (or (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (= (let ((.cse363 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse362 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse362 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse362) v_prenex_25) .cse363)))) v_prenex_25) .cse363)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse10)) (.cse3 (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse360 (+ 4 v_arrayElimCell_53))) (let ((.cse359 (let ((.cse361 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse361 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse361) v_prenex_26) .cse360))))) (or (= (select .cse359 .cse360) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse359) v_prenex_26) .cse360) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse10)) (.cse0 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse358 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53)) (.cse356 (+ 4 v_arrayElimCell_53))) (let ((.cse357 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse358) v_prenex_26) .cse356))) (let ((.cse355 (store .cse358 4 .cse357))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse355) v_prenex_26) 4) 0) (= (select .cse355 .cse356) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse357 0))))))) (.cse18 (forall ((v_prenex_24 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53)) v_prenex_24) (+ 4 v_arrayElimCell_53)))))) (.cse38 (or .cse10 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse353 (+ 4 v_arrayElimCell_53))) (let ((.cse352 (let ((.cse354 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse354 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse354) v_prenex_26) .cse353))))) (let ((.cse351 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse352) v_prenex_26))) (or (= (select .cse351 4) 0) (= (select .cse352 .cse353) 0) (= (select .cse351 .cse353) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))))) (.cse37 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse349 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (let ((.cse350 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse349) v_prenex_26) (+ 4 v_arrayElimCell_53)))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse349 4 .cse350)) v_prenex_26) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse350 0)))))) (.cse17 (or .cse10 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse347 (+ 4 v_arrayElimCell_53))) (let ((.cse346 (let ((.cse348 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse348 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse348) v_prenex_13) .cse347))))) (or (= (select .cse346 .cse347) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse346) v_prenex_13) .cse347) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) (.cse1 (and (or .cse345 .cse19) (or (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ |c_ULTIMATE.start_append_~plist#1.offset| 1)) .cse19))) (.cse46 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_prenex_20 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse344 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse344 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse344) v_prenex_21) .cse45)))) v_prenex_20) .cse45) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse56 (or .cse47 (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse343 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse343 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse343) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_18) .cse45)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse57 (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse342 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse342 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse342) v_arrayElimCell_42) .cse45)))) v_prenex_23) .cse45) 0))) .cse10)) (.cse24 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int) (v_arrayElimCell_53 Int)) (let ((.cse340 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse336 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse341 (store .cse340 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse341 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse341) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_14)) (.cse338 (+ 4 v_arrayElimCell_41)) (.cse337 (+ 4 v_arrayElimCell_53))) (or (= (select .cse336 .cse337) 0) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse338) 0) (= (select .cse336 4) 0) (= (select (let ((.cse339 (store .cse340 0 v_arrayElimCell_41))) (store .cse339 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse339) v_prenex_14) .cse338))) .cse337) 0)))))))) (.cse25 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_16 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_53 Int)) (let ((.cse333 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse334 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse332 (store .cse333 0 v_arrayElimCell_41))) (store .cse332 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse332) v_prenex_16) (+ 4 v_arrayElimCell_41))))) v_prenex_16) .cse334) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse335 (store .cse333 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse335 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse335) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_16) .cse334) 0))))))) (.cse133 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_15 Int) (v_arrayElimCell_53 Int)) (let ((.cse330 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse331 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse331 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse331) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_15))) (or (= (select .cse330 (+ 4 v_arrayElimCell_53)) 0) (= (select .cse330 4) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse27 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int) (v_arrayElimCell_53 Int)) (let ((.cse327 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse328 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse326 (store .cse327 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse326 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse326) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_14) .cse328) 0) (= (select (let ((.cse329 (store .cse327 0 v_arrayElimCell_41))) (store .cse329 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse329) v_prenex_14) (+ 4 v_arrayElimCell_41)))) .cse328) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse22 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int) (v_arrayElimCell_53 Int) (v_prenex_19 Int)) (let ((.cse323 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse324 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse322 (store .cse323 0 v_arrayElimCell_41))) (store .cse322 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse322) v_prenex_19) (+ 4 v_arrayElimCell_41))))) v_prenex_18) .cse324) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse325 (store .cse323 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse325 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse325) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_18) .cse324) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse134 (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_53 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse321 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse321 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse321) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_15) (+ 4 v_arrayElimCell_53)) 0))))) (.cse31 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int) (v_arrayElimCell_53 Int)) (let ((.cse317 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse320 (store .cse317 0 v_arrayElimCell_41))) (let ((.cse319 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse320) v_prenex_14) (+ 4 v_arrayElimCell_41))) (.cse318 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse316 (store .cse317 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse316 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse316) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_14) .cse318) 0) (= .cse319 0) (= (select (store .cse320 4 .cse319) .cse318) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse65 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int)) (let ((.cse313 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse315 (store .cse313 0 v_arrayElimCell_41))) (let ((.cse314 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse315) v_prenex_14) (+ 4 v_arrayElimCell_41)))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse312 (store .cse313 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse312 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse312) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_14) .cse45) 0) (= .cse314 0) (= (select (store .cse315 4 .cse314) .cse45) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse66 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int)) (let ((.cse310 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse309 (store .cse310 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse309 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse309) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_14) .cse45) 0) (= (select (let ((.cse311 (store .cse310 0 v_arrayElimCell_41))) (store .cse311 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse311) v_prenex_14) (+ 4 v_arrayElimCell_41)))) .cse45) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse74 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int)) (let ((.cse307 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse304 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse308 (store .cse307 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse308 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse308) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_14)) (.cse305 (+ 4 v_arrayElimCell_41))) (or (= (select .cse304 .cse45) 0) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse305) 0) (= (select .cse304 4) 0) (= (select (let ((.cse306 (store .cse307 0 v_arrayElimCell_41))) (store .cse306 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse306) v_prenex_14) .cse305))) .cse45) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse75 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_16 Int) (v_arrayElimCell_41 Int)) (let ((.cse302 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse301 (store .cse302 0 v_arrayElimCell_41))) (store .cse301 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse301) v_prenex_16) (+ 4 v_arrayElimCell_41))))) v_prenex_16) .cse45) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse303 (store .cse302 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse303 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse303) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_16) .cse45) 0))))))) (.cse148 (and (or .cse47 .cse40) .cse299 .cse300)) (.cse52 (forall ((v_prenex_24 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_prenex_24) .cse45) 0)))) (.cse49 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse297 (let ((.cse298 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse298 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse298) v_prenex_26) .cse45))))) (let ((.cse296 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse297) v_prenex_26))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= 0 (select .cse296 .cse45)) (= (select .cse297 .cse45) 0) (= (select .cse296 4) 0)))))) (.cse51 (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse295 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse295 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse295) v_prenex_25) .cse45)))) v_prenex_25) .cse45) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse50 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse293 (let ((.cse294 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse294 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse294) v_prenex_26) .cse45))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse293) v_prenex_26) .cse45)) (= (select .cse293 .cse45) 0))))) (.cse48 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse291 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse292 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse291) v_prenex_26) .cse45))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse291 4 .cse292)) v_prenex_26) 4) 0) (= .cse292 0)))))) (.cse26 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int) (v_arrayElimCell_53 Int)) (let ((.cse290 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse287 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse290) v_prenex_13) (+ 4 v_arrayElimCell_41)))) (let ((.cse288 (store .cse290 4 .cse287)) (.cse289 (+ 4 v_arrayElimCell_53))) (or (= .cse287 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse288) v_prenex_13) .cse289) 0) (= (select .cse288 .cse289) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse28 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_12 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse286 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse286 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse286) v_prenex_12) (+ 4 v_arrayElimCell_41))))) v_prenex_12) (+ 4 v_arrayElimCell_53)) 0))))) (.cse29 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int) (v_arrayElimCell_53 Int)) (let ((.cse283 (let ((.cse285 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse285 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse285) v_prenex_13) (+ 4 v_arrayElimCell_41))))) (.cse284 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse283) v_prenex_13) .cse284) 0) (= (select .cse283 .cse284) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse30 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int) (v_arrayElimCell_53 Int)) (let ((.cse282 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse278 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse282) v_prenex_13) (+ 4 v_arrayElimCell_41)))) (let ((.cse281 (store .cse282 4 .cse278))) (let ((.cse280 (+ 4 v_arrayElimCell_53)) (.cse279 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse281) v_prenex_13))) (or (= .cse278 0) (= (select .cse279 .cse280) 0) (= (select .cse281 .cse280) 0) (= (select .cse279 4) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse43 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse277 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse277 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse277) v_prenex_21) (+ 4 v_arrayElimCell_41))))) v_prenex_20) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse112 (or .cse47 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse275 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse276 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse275))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse275 4 (select (select .cse276 |c_ULTIMATE.start_append_~item~0#1.base|) .cse45))) v_prenex_14) .cse45) 0) (= (select (store .cse275 4 (select (select .cse276 v_prenex_14) .cse45)) .cse45) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) (.cse113 (or .cse47 (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse274 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse274 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse274) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_16) .cse45) 0))))) (.cse115 (or (and .cse155 .cse156) .cse131 .cse132 .cse135)) (.cse116 (or .cse47 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse272 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse273 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse272))) (let ((.cse271 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse272 4 (select (select .cse273 |c_ULTIMATE.start_append_~item~0#1.base|) .cse45))) v_prenex_14))) (or (= (select .cse271 .cse45) 0) (= (select .cse271 4) 0) (= (select (store .cse272 4 (select (select .cse273 v_prenex_14) .cse45)) .cse45) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))))) (.cse7 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse92 (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse269 (let ((.cse270 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse270 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse270) v_prenex_13) .cse45))))) (let ((.cse268 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse269) v_prenex_13))) (or (= (select .cse268 4) 0) (= (select .cse269 .cse45) 0) (= 0 (select .cse268 .cse45)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse19)) (.cse114 (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse266 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse267 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse266) v_prenex_13) .cse45))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse266 4 .cse267)) v_prenex_13) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse267 0))))) .cse19)) (.cse117 (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse265 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse264 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse265) v_prenex_13) .cse45))) (let ((.cse263 (store .cse265 4 .cse264))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse263) v_prenex_13) 4) 0) (= (select .cse263 .cse45) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse264 0)))))) .cse19)) (.cse145 (or .cse10 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse261 (let ((.cse262 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse262 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse262) v_prenex_13) .cse45))))) (or (= (select .cse261 .cse45) 0) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse261) v_prenex_13) .cse45)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse146 (or .cse10 (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse260 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse260 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse260) v_prenex_12) .cse45)))) v_prenex_12) .cse45) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse150 (or (forall ((v_arrayElimCell_50 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_arrayElimCell_50) .cse45) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse19))) (and (or (and (or .cse0 .cse1) .cse2 .cse3 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_21 Int) (v_prenex_20 Int) (v_arrayElimCell_53 Int)) (= (let ((.cse5 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse4 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse4 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse4) v_prenex_21) .cse5)))) v_prenex_20) .cse5)) 0)))) .cse6 (or .cse7 (and .cse8 .cse9))) .cse10) (or (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse7) (or .cse18 .cse7 .cse19) (or .cse10 (and .cse20 (or .cse7 (and .cse21 .cse22)) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse23 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse23 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse23) v_prenex_21) (+ 4 v_arrayElimCell_41))))) v_prenex_20) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) .cse7) .cse32 .cse33 .cse34 .cse35 .cse36)) (or .cse7 .cse19 .cse37) .cse38 (or .cse39 .cse1)) .cse40) (or .cse7 (and .cse11 (or .cse10 (and .cse8 .cse6 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_arrayElimCell_53 Int)) (or (= (let ((.cse42 (+ 4 v_arrayElimCell_53))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse41 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_53))) (store .cse41 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse41) v_prenex_21) .cse42)))) v_prenex_20) .cse42)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse40) .cse9)) (or .cse39 .cse19) .cse12 .cse13 .cse14 (or (and .cse24 .cse25 (or .cse43 .cse40) .cse21 .cse26 .cse27 .cse28 .cse29 .cse32 (or (and .cse20 .cse33 .cse35 .cse36) .cse40) .cse22 .cse34 .cse30 .cse31) .cse10) .cse15 .cse16 (or (and .cse2 .cse3 (or .cse0 .cse19) (or .cse18 .cse19) .cse38 (or .cse19 .cse37)) .cse40) .cse17)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse44 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse44 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse44) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse19) (or .cse46 .cse47 .cse40) (or (and (or .cse48 .cse7 .cse19) (or .cse10 .cse49) (or .cse10 .cse50) (or .cse51 .cse10) (or .cse7 .cse52 .cse19) (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse55 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse54 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse55) v_prenex_26) .cse45))) (let ((.cse53 (store .cse55 4 .cse54))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse53 .cse45) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse53) v_prenex_26) 4) 0) (= .cse54 0)))))) .cse1)) .cse40) (or (and .cse56 .cse57) .cse7) (or .cse10 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_22 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse58 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse58 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse58) v_prenex_22) .cse45)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or .cse46 .cse40) (or .cse7 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_18 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse59 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse59 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse59) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_18) .cse45))) (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_42 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse60 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse60 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse60) v_arrayElimCell_42) .cse45)))) v_prenex_23) .cse45) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) (or (and (or (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_prenex_20 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse61 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse61 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse61) v_prenex_21) (+ 4 v_arrayElimCell_41))))) v_prenex_20) .cse45) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse40) (or .cse7 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_12 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse62 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse62 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse62) v_prenex_12) (+ 4 v_arrayElimCell_41))))) v_prenex_12) .cse45) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse63 (let ((.cse64 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse64 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse64) v_prenex_13) (+ 4 v_arrayElimCell_41)))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse63) v_prenex_13) .cse45) 0) (= (select .cse63 .cse45) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse65 .cse66 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse69 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse67 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse69) v_prenex_13) (+ 4 v_arrayElimCell_41)))) (let ((.cse68 (store .cse69 4 .cse67))) (or (= .cse67 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse68) v_prenex_13) .cse45) 0) (= (select .cse68 .cse45) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse73 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse70 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse73) v_prenex_13) (+ 4 v_arrayElimCell_41)))) (let ((.cse72 (store .cse73 4 .cse70))) (let ((.cse71 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse72) v_prenex_13))) (or (= .cse70 0) (= (select .cse71 .cse45) 0) (= (select .cse72 .cse45) 0) (= (select .cse71 4) 0))))))))) .cse74 .cse75)) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_22 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse76 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse76 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse76) v_prenex_22) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse77 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse77 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse77) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45) 0)))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse78 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse78 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse78) v_arrayElimCell_42) (+ 4 v_arrayElimCell_41))))) v_prenex_23) .cse45) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int) (v_prenex_19 Int)) (let ((.cse80 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse79 (store .cse80 0 v_arrayElimCell_41))) (store .cse79 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse79) v_prenex_19) (+ 4 v_arrayElimCell_41))))) v_prenex_18) .cse45) 0) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse81 (store .cse80 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse81 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse81) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_18) .cse45)))))))) .cse7) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_25 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse82 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse82 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse82) v_prenex_25) (+ 4 v_arrayElimCell_41))))) v_prenex_25) .cse45) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int)) (let ((.cse84 (let ((.cse85 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse85 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse85) v_prenex_26) (+ 4 v_arrayElimCell_41)))))) (let ((.cse83 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse84) v_prenex_26))) (or (= (select .cse83 4) 0) (= (select .cse84 .cse45) 0) (= (select .cse83 .cse45) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int)) (let ((.cse86 (let ((.cse87 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse87 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse87) v_prenex_26) (+ 4 v_arrayElimCell_41)))))) (or (= (select .cse86 .cse45) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse86) v_prenex_26) .cse45) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int)) (let ((.cse91 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse90 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse91) v_prenex_26) (+ 4 v_arrayElimCell_41)))) (let ((.cse89 (store .cse91 4 .cse90))) (let ((.cse88 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse89) v_prenex_26))) (or (= (select .cse88 4) 0) (= (select .cse89 .cse45) 0) (= .cse90 0) (= (select .cse88 .cse45) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse40)) .cse10) (or .cse7 (and .cse92 (or .cse10 (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_13 Int) (v_arrayElimCell_53 Int)) (let ((.cse97 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse94 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse97) v_prenex_13) .cse45))) (let ((.cse95 (store .cse97 4 .cse94))) (let ((.cse93 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse95) v_prenex_13)) (.cse96 (+ 4 v_arrayElimCell_53))) (or (= (select .cse93 4) 0) (= .cse94 0) (= (select .cse95 .cse96) 0) (= (select .cse93 .cse96) 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_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse98 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse98 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse98) v_prenex_12) .cse45)))) v_prenex_12) (+ 4 v_arrayElimCell_53)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_53 Int)) (let ((.cse102 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse99 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse102) v_prenex_13) .cse45))) (let ((.cse100 (store .cse102 4 .cse99)) (.cse101 (+ 4 v_arrayElimCell_53))) (or (= .cse99 0) (= (select .cse100 .cse101) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse100) v_prenex_13) .cse101) 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_13 Int) (v_arrayElimCell_53 Int)) (let ((.cse103 (let ((.cse105 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse105 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse105) v_prenex_13) .cse45)))) (.cse104 (+ 4 v_arrayElimCell_53))) (or (= (select .cse103 .cse104) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse103) v_prenex_13) .cse104) 0)))))))) (or .cse47 (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse106 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse106 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse106) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_18) (+ 4 v_arrayElimCell_53)) 0)))) (or .cse47 (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse107 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse107 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse107) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_16) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse47 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse108 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse109 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse108))) (let ((.cse111 (select (select .cse109 v_prenex_14) .cse45)) (.cse110 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse108 4 (select (select .cse109 |c_ULTIMATE.start_append_~item~0#1.base|) .cse45))) v_prenex_14) .cse110) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse111 0) (= (select (store .cse108 4 .cse111) .cse110) 0))))))) .cse112 .cse113 .cse114 .cse56 .cse57 .cse115 .cse116 .cse117 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_53 Int)) (let ((.cse122 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse121 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse122) v_prenex_26) .cse45))) (let ((.cse120 (store .cse122 4 .cse121))) (let ((.cse119 (+ 4 v_arrayElimCell_53)) (.cse118 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse120) v_prenex_26))) (or (= (select .cse118 .cse119) 0) (= (select .cse120 .cse119) 0) (= (select .cse118 4) 0) (= .cse121 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_53 Int)) (let ((.cse123 (let ((.cse125 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse125 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse125) v_prenex_26) .cse45)))) (.cse124 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse123) v_prenex_26) .cse124) 0) (= (select .cse123 .cse124) 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_25 Int) (v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse126 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse126 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse126) v_prenex_25) .cse45)))) v_prenex_25) (+ 4 v_arrayElimCell_53)) 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_26 Int) (v_arrayElimCell_53 Int)) (let ((.cse129 (let ((.cse130 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse130 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse130) v_prenex_26) .cse45))))) (let ((.cse128 (+ 4 v_arrayElimCell_53)) (.cse127 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse129) v_prenex_26))) (or (= (select .cse127 .cse128) 0) (= (select .cse129 .cse128) 0) (= (select .cse127 4) 0)))))))) .cse47 .cse40) (or .cse131 .cse132 (and .cse133 .cse134) .cse135) (or .cse47 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse138 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse139 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse138))) (let ((.cse136 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse138 4 (select (select .cse139 |c_ULTIMATE.start_append_~item~0#1.base|) .cse45))) v_prenex_14)) (.cse137 (+ 4 v_arrayElimCell_53))) (or (= (select .cse136 .cse137) 0) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse45) 0) (= (select .cse136 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (store .cse138 4 (select (select .cse139 v_prenex_14) .cse45)) .cse137) 0))))))) (or (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse140 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse141 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse140)) (.cse142 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse140 4 (select (select .cse141 |c_ULTIMATE.start_append_~item~0#1.base|) .cse45))) v_prenex_14) .cse142) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (store .cse140 4 (select (select .cse141 v_prenex_14) .cse45)) .cse142) 0))))) .cse47) (or .cse47 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse143 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse143 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse143) v_prenex_21) .cse45)))) v_prenex_20) (+ 4 v_arrayElimCell_53)) 0))) .cse40) (or .cse10 (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse144 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse144 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse144) v_arrayElimCell_42) .cse45)))) v_prenex_23) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse145 .cse146 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse147 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse147 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse147) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_53)) 0))) .cse47) (or .cse148 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse149 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse149 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse149) v_prenex_22) .cse45)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_53)) 0)))) .cse150)) (or .cse131 (and (or (and .cse24 .cse25 .cse133 .cse27 .cse22 .cse134 .cse31 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_53 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse151 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse151 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse151) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_53)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse7) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (let ((.cse153 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse152 (store .cse153 0 v_arrayElimCell_41))) (store .cse152 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse152) v_prenex_19) (+ 4 v_arrayElimCell_41))))) v_prenex_18) .cse45) 0) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse154 (store .cse153 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse154 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse154) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_18) .cse45)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse7) (or (and .cse155 .cse65 .cse66 .cse156 .cse74 .cse75) .cse7)) .cse132 .cse135) (or (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse157 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse157 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse157) v_prenex_22) .cse45)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45) 0))) .cse148) (or (and (or .cse52 .cse19) (or .cse49 .cse19) (or .cse51 .cse47) (or .cse50 .cse47) (or .cse48 .cse19)) .cse40) (or (let ((.cse173 (or (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse254 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41)) (.cse253 (+ 4 v_arrayElimCell_41))) (let ((.cse251 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse254) v_prenex_13) .cse253))) (let ((.cse252 (store .cse254 4 .cse251))) (or (= .cse251 0) (= (select .cse252 .cse253) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse252) v_prenex_13) 4) 0)))))) .cse19)) (.cse174 (or (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41)) v_arrayElimCell_50) (+ 4 v_arrayElimCell_41)) 0))) .cse19)) (.cse175 (or .cse10 (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse249 (+ 4 v_arrayElimCell_41))) (let ((.cse248 (let ((.cse250 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse250 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse250) v_prenex_13) .cse249))))) (or (= (select .cse248 .cse249) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse248) v_prenex_13) .cse249) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) (.cse176 (or .cse19 (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse247 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse246 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse247) v_prenex_13) (+ 4 v_arrayElimCell_41)))) (or (= .cse246 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse247 4 .cse246)) v_prenex_13) 4) 0))))))) (.cse177 (or .cse10 (forall ((v_arrayElimCell_41 Int) (v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse245 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse244 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse244 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse244) v_prenex_12) .cse245)))) v_prenex_12) .cse245)) 0))))) (.cse178 (or (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse241 (+ 4 v_arrayElimCell_41))) (let ((.cse240 (let ((.cse243 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse243 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse243) v_prenex_13) .cse241))))) (let ((.cse242 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse240) v_prenex_13))) (or (= (select .cse240 .cse241) 0) (= (select .cse242 .cse241) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse242 4) 0)))))) .cse19)) (.cse179 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int)) (let ((.cse232 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse231 (+ 4 v_arrayElimCell_41))) (or (= (select (let ((.cse230 (store .cse232 0 v_arrayElimCell_41))) (store .cse230 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse230) v_prenex_14) .cse231))) .cse231) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse233 (store .cse232 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse233 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse233) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_14) .cse231) 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_arrayElimCell_41 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse234 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse234 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse234) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_16) (+ 4 v_arrayElimCell_41)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int)) (let ((.cse237 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse236 (+ 4 v_arrayElimCell_41)) (.cse238 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse239 (store .cse237 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse239 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse239) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_14))) (or (= (select (let ((.cse235 (store .cse237 0 v_arrayElimCell_41))) (store .cse235 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse235) v_prenex_14) .cse236))) .cse236) 0) (= (select .cse238 .cse236) 0) (= (select .cse238 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse47)) (.cse182 (or (forall ((v_prenex_18 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse229 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse229 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse229) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_18) (+ 4 v_arrayElimCell_41)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse47)) (.cse183 (or .cse10 (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse228 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse227 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse227 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse227) v_arrayElimCell_42) .cse228)))) v_prenex_23) .cse228)) 0)))))) (and (or (forall ((v_arrayElimCell_41 Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (let ((.cse159 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse158 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse158 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse158) v_prenex_25) .cse159)))) v_prenex_25) .cse159)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse47) (or .cse19 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (let ((.cse161 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse160 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse160 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse160) |c_ULTIMATE.start_append_~item~0#1.base|) .cse161)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse161)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse163 (+ 4 v_arrayElimCell_41))) (let ((.cse164 (let ((.cse165 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse165 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse165) v_prenex_26) .cse163))))) (let ((.cse162 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse164) v_prenex_26))) (or (= (select .cse162 4) 0) (= (select .cse162 .cse163) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse164 .cse163) 0)))))) .cse19) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (let ((.cse167 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse166 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse166 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse166) v_prenex_22) .cse167)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse167)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse47) (or .cse47 (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse169 (+ 4 v_arrayElimCell_41))) (let ((.cse168 (let ((.cse170 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse170 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse170) v_prenex_26) .cse169))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse168) v_prenex_26) .cse169) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse168 .cse169) 0)))))) (or .cse47 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_prenex_20 Int)) (or (= (let ((.cse172 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse171 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse171 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse171) v_prenex_21) .cse172)))) v_prenex_20) .cse172)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse7 (and .cse173 .cse174 .cse175 .cse176 .cse177 .cse178 .cse179)) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse180 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse181 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse180) v_prenex_26) (+ 4 v_arrayElimCell_41)))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse180 4 .cse181)) v_prenex_26) 4) 0) (= .cse181 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse19) (or (and .cse182 .cse183) .cse7) (or .cse7 (and (or (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse184 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse184 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse184) v_arrayElimCell_42) (+ 4 v_arrayElimCell_41))))) v_prenex_23) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse10) (or (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse186 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse187 (+ 4 v_arrayElimCell_53))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse185 (store .cse186 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse185 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse185) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse187) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse188 (store .cse186 0 v_arrayElimCell_41))) (store .cse188 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse188) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse187) 0)))) .cse47) .cse173 (or (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse189 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse189 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse189) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_53)) 0))) .cse47) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse194 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (let ((.cse193 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse194) v_prenex_26) (+ 4 v_arrayElimCell_41)))) (let ((.cse190 (store .cse194 4 .cse193))) (let ((.cse192 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse190) v_prenex_26)) (.cse191 (+ 4 v_arrayElimCell_53))) (or (= (select .cse190 .cse191) 0) (= (select .cse192 4) 0) (= .cse193 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse192 .cse191) 0))))))) .cse47) .cse174 (or .cse47 (forall ((v_arrayElimCell_41 Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse195 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse195 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse195) v_prenex_25) (+ 4 v_arrayElimCell_41))))) v_prenex_25) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse10 (and .cse26 .cse28 .cse29 .cse30)) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse197 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse198 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse196 (store .cse197 0 v_arrayElimCell_41))) (store .cse196 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse196) v_prenex_16) (+ 4 v_arrayElimCell_41))))) v_prenex_16) .cse198) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse199 (store .cse197 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse199 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse199) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_16) .cse198) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse47) .cse175 (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse200 (let ((.cse202 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse202 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse202) v_prenex_26) (+ 4 v_arrayElimCell_41))))) (.cse201 (+ 4 v_arrayElimCell_53))) (or (= (select .cse200 .cse201) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse200) v_prenex_26) .cse201) 0)))) .cse47) .cse176 (or (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse207 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse203 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse208 (store .cse207 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse208 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse208) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_14)) (.cse205 (+ 4 v_arrayElimCell_41)) (.cse204 (+ 4 v_arrayElimCell_53))) (or (= (select .cse203 .cse204) 0) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse205) 0) (= (select .cse203 4) 0) (= (select (let ((.cse206 (store .cse207 0 v_arrayElimCell_41))) (store .cse206 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse206) v_prenex_14) .cse205))) .cse204) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse47) .cse177 .cse178 (or .cse47 (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int) (v_arrayElimCell_53 Int)) (let ((.cse210 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse211 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse209 (store .cse210 0 v_arrayElimCell_41))) (store .cse209 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse209) v_prenex_19) (+ 4 v_arrayElimCell_41))))) v_prenex_18) .cse211) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse212 (store .cse210 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse212 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse212) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_18) .cse211) 0))))) (or .cse43 .cse47) (or .cse47 (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse213 (let ((.cse216 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse216 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse216) v_prenex_26) (+ 4 v_arrayElimCell_41)))))) (let ((.cse215 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse213) v_prenex_26)) (.cse214 (+ 4 v_arrayElimCell_53))) (or (= (select .cse213 .cse214) 0) (= (select .cse215 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse215 .cse214) 0)))))) .cse179 (or .cse47 (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse218 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse221 (store .cse218 0 v_arrayElimCell_41))) (let ((.cse220 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse221) v_prenex_14) (+ 4 v_arrayElimCell_41))) (.cse219 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse217 (store .cse218 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse217 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse217) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_14) .cse219) 0) (= .cse220 0) (= (select (store .cse221 4 .cse220) .cse219) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) .cse182 .cse183 (or (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (let ((.cse223 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse224 (+ 4 v_arrayElimCell_53))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse222 (store .cse223 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse222 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse222) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_14) .cse224) 0) (= (select (let ((.cse225 (store .cse223 0 v_arrayElimCell_41))) (store .cse225 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse225) v_prenex_14) (+ 4 v_arrayElimCell_41)))) .cse224) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse47) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_53 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse226 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41))) (store .cse226 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse226) v_prenex_22) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_53)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse47))) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_24 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_41)) v_prenex_24) (+ 4 v_arrayElimCell_41)) 0))) .cse19))) .cse40) (or .cse7 (and .cse92 .cse112 .cse113 .cse114 .cse115 .cse116 .cse117 .cse145 .cse146 .cse150)) (or .cse7 (and .cse92 .cse114 (or .cse10 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse255 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse255 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse255) |c_ULTIMATE.start_append_~item~0#1.base|) .cse45)))) v_prenex_16) .cse45) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int)) (let ((.cse256 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse257 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse256))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse256 4 (select (select .cse257 |c_ULTIMATE.start_append_~item~0#1.base|) .cse45))) v_prenex_14) .cse45) 0) (= (select (store .cse256 4 (select (select .cse257 v_prenex_14) .cse45)) .cse45) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_14 Int)) (let ((.cse258 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse259 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse258))) (or (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse45) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse258 4 (select (select .cse259 |c_ULTIMATE.start_append_~item~0#1.base|) .cse45))) v_prenex_14) 4) 0) (= (select (store .cse258 4 (select (select .cse259 v_prenex_14) .cse45)) .cse45) 0))))))))) .cse117 .cse145 .cse146 .cse150))))))) is different from true