./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:42:01,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:42:01,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:42:01,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:42:01,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:42:01,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:42:01,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:42:01,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:42:01,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:42:01,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:42:01,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:42:01,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:42:01,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:42:01,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:42:01,342 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:42:01,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:42:01,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:42:01,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:42:01,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:42:01,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:42:01,342 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:42:01,342 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:42:01,343 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:42:01,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:42:01,343 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:42:01,343 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:42:01,343 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:42:01,343 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:42:01,343 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:42:01,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:42:01,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:42:01,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:42:01,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:42:01,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:42:01,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:42:01,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:42:01,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:42:01,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:42:01,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:42:01,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:42:01,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:42:01,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:42:01,344 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-jdk21/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 -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2025-02-06 10:42:01,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:42:01,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:42:01,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:42:01,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:42:01,552 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:42:01,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2025-02-06 10:42:02,698 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d450673f/626640ddbadd4ef18ac6a4f184c1d62a/FLAG11ab14018 [2025-02-06 10:42:03,010 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:42:03,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2025-02-06 10:42:03,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d450673f/626640ddbadd4ef18ac6a4f184c1d62a/FLAG11ab14018 [2025-02-06 10:42:03,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d450673f/626640ddbadd4ef18ac6a4f184c1d62a [2025-02-06 10:42:03,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:42:03,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:42:03,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:42:03,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:42:03,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:42:03,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:42:03" (1/1) ... [2025-02-06 10:42:03,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e131198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03, skipping insertion in model container [2025-02-06 10:42:03,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:42:03" (1/1) ... [2025-02-06 10:42:03,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:42:03,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:42:03,263 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:42:03,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:42:03,327 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:42:03,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03 WrapperNode [2025-02-06 10:42:03,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:42:03,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:42:03,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:42:03,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:42:03,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03" (1/1) ... [2025-02-06 10:42:03,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03" (1/1) ... [2025-02-06 10:42:03,356 INFO L138 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2025-02-06 10:42:03,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:42:03,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:42:03,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:42:03,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:42:03,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03" (1/1) ... [2025-02-06 10:42:03,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03" (1/1) ... [2025-02-06 10:42:03,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03" (1/1) ... [2025-02-06 10:42:03,379 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-02-06 10:42:03,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03" (1/1) ... [2025-02-06 10:42:03,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03" (1/1) ... [2025-02-06 10:42:03,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03" (1/1) ... [2025-02-06 10:42:03,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03" (1/1) ... [2025-02-06 10:42:03,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03" (1/1) ... [2025-02-06 10:42:03,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03" (1/1) ... [2025-02-06 10:42:03,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:42:03,393 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:42:03,393 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:42:03,393 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:42:03,394 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03" (1/1) ... [2025-02-06 10:42:03,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:42:03,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:03,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:42:03,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:42:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-02-06 10:42:03,444 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-02-06 10:42:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:42:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:42:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:42:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:42:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:42:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:42:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:42:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:42:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:42:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:42:03,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:42:03,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:42:03,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:42:03,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:42:03,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:42:03,524 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:42:03,526 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:42:03,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-02-06 10:42:03,812 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2025-02-06 10:42:03,813 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:42:03,824 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:42:03,828 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:42:03,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:42:03 BoogieIcfgContainer [2025-02-06 10:42:03,828 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:42:03,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:42:03,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:42:03,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:42:03,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:42:03" (1/3) ... [2025-02-06 10:42:03,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbc479a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:42:03, skipping insertion in model container [2025-02-06 10:42:03,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:03" (2/3) ... [2025-02-06 10:42:03,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbc479a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:42:03, skipping insertion in model container [2025-02-06 10:42:03,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:42:03" (3/3) ... [2025-02-06 10:42:03,836 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2025-02-06 10:42:03,851 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:42:03,852 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_circular_traversal-2.i that has 2 procedures, 85 locations, 1 initial locations, 3 loop locations, and 35 error locations. [2025-02-06 10:42:03,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:42:03,900 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;@4a6b5585, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:42:03,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-06 10:42:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 82 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:03,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:42:03,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:03,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:42:03,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:03,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:03,916 INFO L85 PathProgramCache]: Analyzing trace with hash 3939324, now seen corresponding path program 1 times [2025-02-06 10:42:03,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:03,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783627876] [2025-02-06 10:42:03,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:03,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:03,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:42:03,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:42:03,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:03,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:04,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783627876] [2025-02-06 10:42:04,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783627876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:04,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:04,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:42:04,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038874841] [2025-02-06 10:42:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:04,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:42:04,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:04,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:42:04,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:04,082 INFO L87 Difference]: Start difference. First operand has 84 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 82 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:04,157 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2025-02-06 10:42:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:42:04,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 10:42:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:04,162 INFO L225 Difference]: With dead ends: 79 [2025-02-06 10:42:04,162 INFO L226 Difference]: Without dead ends: 73 [2025-02-06 10:42:04,164 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-02-06 10:42:04,165 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 21 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 97 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-02-06 10:42:04,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 97 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-06 10:42:04,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-06 10:42:04,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 72 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-02-06 10:42:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2025-02-06 10:42:04,189 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 4 [2025-02-06 10:42:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:04,189 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2025-02-06 10:42:04,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2025-02-06 10:42:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:42:04,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:04,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:42:04,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:42:04,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:04,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash 3939325, now seen corresponding path program 1 times [2025-02-06 10:42:04,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:04,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248950226] [2025-02-06 10:42:04,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:04,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:04,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:42:04,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:42:04,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:04,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:04,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:04,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248950226] [2025-02-06 10:42:04,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248950226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:04,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:04,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:42:04,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493346421] [2025-02-06 10:42:04,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:04,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:42:04,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:04,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:42:04,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:04,299 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:04,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:04,342 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2025-02-06 10:42:04,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:42:04,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 10:42:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:04,343 INFO L225 Difference]: With dead ends: 69 [2025-02-06 10:42:04,343 INFO L226 Difference]: Without dead ends: 69 [2025-02-06 10:42:04,343 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-02-06 10:42:04,344 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:04,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 90 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:42:04,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-06 10:42:04,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-06 10:42:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 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-02-06 10:42:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2025-02-06 10:42:04,352 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 4 [2025-02-06 10:42:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:04,352 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2025-02-06 10:42:04,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2025-02-06 10:42:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:42:04,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:04,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:04,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:42:04,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:04,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:04,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1539857070, now seen corresponding path program 1 times [2025-02-06 10:42:04,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:04,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645136654] [2025-02-06 10:42:04,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:04,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:04,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:42:04,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:42:04,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:04,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:04,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:04,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645136654] [2025-02-06 10:42:04,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645136654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:04,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:04,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:42:04,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979943869] [2025-02-06 10:42:04,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:04,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:42:04,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:04,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:42:04,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:04,447 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-02-06 10:42:04,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:04,513 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2025-02-06 10:42:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:42:04,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-02-06 10:42:04,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:04,514 INFO L225 Difference]: With dead ends: 67 [2025-02-06 10:42:04,514 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 10:42:04,514 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-02-06 10:42:04,515 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:04,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 96 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:04,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 10:42:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-06 10:42:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 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-02-06 10:42:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2025-02-06 10:42:04,522 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 10 [2025-02-06 10:42:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:04,522 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2025-02-06 10:42:04,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-02-06 10:42:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2025-02-06 10:42:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:42:04,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:04,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:04,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:42:04,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:04,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:04,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1539857069, now seen corresponding path program 1 times [2025-02-06 10:42:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:04,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283130546] [2025-02-06 10:42:04,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:04,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:04,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:42:04,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:42:04,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:04,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:04,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-02-06 10:42:04,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:04,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283130546] [2025-02-06 10:42:04,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283130546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:04,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:04,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:42:04,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062022740] [2025-02-06 10:42:04,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:04,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:42:04,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:04,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:42:04,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:04,633 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-02-06 10:42:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:04,666 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2025-02-06 10:42:04,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:42:04,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-02-06 10:42:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:04,667 INFO L225 Difference]: With dead ends: 65 [2025-02-06 10:42:04,667 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 10:42:04,668 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-02-06 10:42:04,668 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:04,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 99 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:42:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 10:42:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-06 10:42:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.619047619047619) internal successors, (68), 64 states have internal predecessors, (68), 0 states have call successors, (0), 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-02-06 10:42:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2025-02-06 10:42:04,671 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 10 [2025-02-06 10:42:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:04,671 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2025-02-06 10:42:04,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-02-06 10:42:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2025-02-06 10:42:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:42:04,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:04,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:04,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:42:04,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:04,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:04,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1539856587, now seen corresponding path program 1 times [2025-02-06 10:42:04,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:04,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669127815] [2025-02-06 10:42:04,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:04,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:04,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:42:04,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:42:04,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:04,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:04,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:04,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669127815] [2025-02-06 10:42:04,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669127815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:04,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:04,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:42:04,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000994399] [2025-02-06 10:42:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:04,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:42:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:04,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:42:04,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:04,710 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-06 10:42:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:04,717 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2025-02-06 10:42:04,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:42:04,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-06 10:42:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:04,718 INFO L225 Difference]: With dead ends: 73 [2025-02-06 10:42:04,718 INFO L226 Difference]: Without dead ends: 73 [2025-02-06 10:42:04,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:04,719 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 7 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:04,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:42:04,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-06 10:42:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2025-02-06 10:42:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 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-02-06 10:42:04,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-02-06 10:42:04,722 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 10 [2025-02-06 10:42:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:04,723 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-02-06 10:42:04,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-06 10:42:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-02-06 10:42:04,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:42:04,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:04,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:04,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:42:04,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:04,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:04,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1961074223, now seen corresponding path program 1 times [2025-02-06 10:42:04,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:04,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594497917] [2025-02-06 10:42:04,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:04,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:04,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:42:04,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:42:04,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:04,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:04,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:04,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594497917] [2025-02-06 10:42:04,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594497917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:04,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:04,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:42:04,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145353459] [2025-02-06 10:42:04,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:04,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:42:04,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:04,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:42:04,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:42:04,848 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-02-06 10:42:04,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:04,910 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2025-02-06 10:42:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:42:04,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:42:04,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:04,911 INFO L225 Difference]: With dead ends: 70 [2025-02-06 10:42:04,911 INFO L226 Difference]: Without dead ends: 70 [2025-02-06 10:42:04,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:42:04,912 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 18 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:04,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 112 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-06 10:42:04,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-06 10:42:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.574468085106383) internal successors, (74), 69 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-02-06 10:42:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2025-02-06 10:42:04,915 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 12 [2025-02-06 10:42:04,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:04,915 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2025-02-06 10:42:04,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-02-06 10:42:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2025-02-06 10:42:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:42:04,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:04,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:04,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:42:04,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:04,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:04,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1961074224, now seen corresponding path program 1 times [2025-02-06 10:42:04,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:04,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824407986] [2025-02-06 10:42:04,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:04,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:04,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:42:04,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:42:04,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:04,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:05,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:05,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824407986] [2025-02-06 10:42:05,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824407986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:05,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:05,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:42:05,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236565390] [2025-02-06 10:42:05,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:05,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:42:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:05,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:42:05,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:42:05,060 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-02-06 10:42:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:05,160 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2025-02-06 10:42:05,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:42:05,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:42:05,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:05,161 INFO L225 Difference]: With dead ends: 70 [2025-02-06 10:42:05,161 INFO L226 Difference]: Without dead ends: 70 [2025-02-06 10:42:05,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:42:05,161 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 20 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:05,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-06 10:42:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-06 10:42:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.553191489361702) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2025-02-06 10:42:05,164 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 12 [2025-02-06 10:42:05,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:05,164 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2025-02-06 10:42:05,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-02-06 10:42:05,164 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2025-02-06 10:42:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:42:05,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:05,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:05,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:42:05,165 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:05,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:05,165 INFO L85 PathProgramCache]: Analyzing trace with hash 9270426, now seen corresponding path program 1 times [2025-02-06 10:42:05,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:05,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345297052] [2025-02-06 10:42:05,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:05,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:05,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:42:05,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:42:05,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:05,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:05,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:05,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345297052] [2025-02-06 10:42:05,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345297052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:05,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:05,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:42:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944620986] [2025-02-06 10:42:05,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:05,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:42:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:05,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:42:05,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:42:05,234 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:05,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:05,291 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2025-02-06 10:42:05,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:42:05,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 10:42:05,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:05,292 INFO L225 Difference]: With dead ends: 68 [2025-02-06 10:42:05,292 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 10:42:05,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-06 10:42:05,293 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:05,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:05,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 10:42:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-06 10:42:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 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-02-06 10:42:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2025-02-06 10:42:05,295 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 16 [2025-02-06 10:42:05,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:05,295 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2025-02-06 10:42:05,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2025-02-06 10:42:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:42:05,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:05,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:05,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:42:05,296 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:05,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:05,297 INFO L85 PathProgramCache]: Analyzing trace with hash 9270427, now seen corresponding path program 1 times [2025-02-06 10:42:05,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:05,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497783895] [2025-02-06 10:42:05,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:05,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:05,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:42:05,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:42:05,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:05,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:05,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:05,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497783895] [2025-02-06 10:42:05,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497783895] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:05,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181371540] [2025-02-06 10:42:05,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:05,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:05,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:05,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:42:05,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:42:05,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:42:05,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:42:05,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:05,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:05,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:42:05,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:05,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:42:05,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:05,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181371540] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:42:05,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:42:05,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-06 10:42:05,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146685224] [2025-02-06 10:42:05,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:42:05,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:42:05,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:05,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:42:05,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:42:05,497 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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-02-06 10:42:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:05,512 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2025-02-06 10:42:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:42:05,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 10:42:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:05,513 INFO L225 Difference]: With dead ends: 84 [2025-02-06 10:42:05,513 INFO L226 Difference]: Without dead ends: 84 [2025-02-06 10:42:05,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:42:05,514 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 14 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:05,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 181 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:42:05,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-06 10:42:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2025-02-06 10:42:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2025-02-06 10:42:05,517 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 16 [2025-02-06 10:42:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:05,517 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2025-02-06 10:42:05,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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-02-06 10:42:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2025-02-06 10:42:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:42:05,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:05,518 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:05,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:42:05,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:05,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:05,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:05,720 INFO L85 PathProgramCache]: Analyzing trace with hash 318482005, now seen corresponding path program 1 times [2025-02-06 10:42:05,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:05,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968548857] [2025-02-06 10:42:05,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:05,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:05,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:42:05,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:42:05,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:05,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:05,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:05,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968548857] [2025-02-06 10:42:05,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968548857] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:05,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996826658] [2025-02-06 10:42:05,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:05,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:05,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:05,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:42:05,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:42:05,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:42:05,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:42:05,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:05,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:05,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 10:42:05,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:05,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:42:06,039 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:42:06,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 10:42:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:06,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:42:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:06,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996826658] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:42:06,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:42:06,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 8 [2025-02-06 10:42:06,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126223530] [2025-02-06 10:42:06,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:42:06,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:42:06,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:06,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:42:06,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:42:06,173 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:06,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:06,289 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2025-02-06 10:42:06,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:42:06,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 10:42:06,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:06,290 INFO L225 Difference]: With dead ends: 80 [2025-02-06 10:42:06,290 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 10:42:06,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:42:06,291 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 7 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:06,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 180 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 10:42:06,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-06 10:42:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.360655737704918) 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-02-06 10:42:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2025-02-06 10:42:06,298 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 18 [2025-02-06 10:42:06,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:06,298 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2025-02-06 10:42:06,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:06,298 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2025-02-06 10:42:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 10:42:06,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:06,299 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:06,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:42:06,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:06,500 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:06,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:06,500 INFO L85 PathProgramCache]: Analyzing trace with hash 481333700, now seen corresponding path program 1 times [2025-02-06 10:42:06,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:06,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382622376] [2025-02-06 10:42:06,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:06,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:06,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:42:06,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:42:06,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:06,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 10:42:06,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:06,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382622376] [2025-02-06 10:42:06,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382622376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:06,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:06,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:42:06,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871594725] [2025-02-06 10:42:06,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:06,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:42:06,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:06,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:42:06,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:42:06,671 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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-02-06 10:42:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:06,774 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2025-02-06 10:42:06,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:42:06,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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 38 [2025-02-06 10:42:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:06,775 INFO L225 Difference]: With dead ends: 78 [2025-02-06 10:42:06,775 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 10:42:06,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:42:06,775 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:06,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 124 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:06,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 10:42:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-06 10:42:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 77 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-02-06 10:42:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2025-02-06 10:42:06,778 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2025-02-06 10:42:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:06,778 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2025-02-06 10:42:06,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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-02-06 10:42:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2025-02-06 10:42:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 10:42:06,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:06,779 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:06,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:42:06,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:06,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:06,780 INFO L85 PathProgramCache]: Analyzing trace with hash 481333701, now seen corresponding path program 1 times [2025-02-06 10:42:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:06,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442142527] [2025-02-06 10:42:06,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:06,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:06,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:42:06,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:42:06,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:06,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 10:42:07,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442142527] [2025-02-06 10:42:07,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442142527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:07,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:07,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:42:07,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715133459] [2025-02-06 10:42:07,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:07,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:42:07,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:07,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:42:07,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:42:07,025 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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-02-06 10:42:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:07,128 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2025-02-06 10:42:07,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:42:07,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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 38 [2025-02-06 10:42:07,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:07,129 INFO L225 Difference]: With dead ends: 85 [2025-02-06 10:42:07,129 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 10:42:07,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:42:07,129 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 10 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:07,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 156 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:07,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 10:42:07,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2025-02-06 10:42:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 80 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-02-06 10:42:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2025-02-06 10:42:07,132 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 38 [2025-02-06 10:42:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:07,132 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2025-02-06 10:42:07,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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-02-06 10:42:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2025-02-06 10:42:07,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:42:07,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:07,133 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:07,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:42:07,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:07,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1255423576, now seen corresponding path program 1 times [2025-02-06 10:42:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:07,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247472673] [2025-02-06 10:42:07,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:07,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:42:07,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:42:07,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:07,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:42:07,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:07,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247472673] [2025-02-06 10:42:07,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247472673] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:07,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723639110] [2025-02-06 10:42:07,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:07,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:07,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:07,783 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:42:07,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:42:07,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:42:07,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:42:07,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:07,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:07,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 10:42:07,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:08,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:42:08,102 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:42:08,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:42:08,152 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 11 treesize of output 7 [2025-02-06 10:42:08,191 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 16 treesize of output 11 [2025-02-06 10:42:08,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:42:08,256 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 11 [2025-02-06 10:42:08,280 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 11 [2025-02-06 10:42:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 10:42:08,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:42:08,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_843 (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_843 .cse0))))))) is different from false [2025-02-06 10:42:08,452 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_842))) (or (= (select (select (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_843 (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_843 .cse1)))))))) is different from false [2025-02-06 10:42:08,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:08,464 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2025-02-06 10:42:08,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:08,472 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 160 treesize of output 160 [2025-02-06 10:42:08,490 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2025-02-06 10:42:08,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 76 [2025-02-06 10:42:08,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-06 10:42:08,575 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-06 10:42:08,575 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 51 treesize of output 45 [2025-02-06 10:42:08,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:08,594 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 55 treesize of output 59 [2025-02-06 10:42:08,692 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2025-02-06 10:42:08,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 58 [2025-02-06 10:42:08,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:08,713 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 26 treesize of output 30 [2025-02-06 10:42:08,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:08,723 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 26 treesize of output 30 [2025-02-06 10:42:08,731 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 62 treesize of output 56 [2025-02-06 10:42:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 6 not checked. [2025-02-06 10:42:08,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723639110] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:42:08,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:42:08,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2025-02-06 10:42:08,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822197414] [2025-02-06 10:42:08,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:42:08,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:42:08,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:08,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:42:08,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=710, Unknown=22, NotChecked=110, Total=930 [2025-02-06 10:42:08,947 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 31 states, 31 states have (on average 2.967741935483871) internal successors, (92), 31 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:09,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:09,419 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2025-02-06 10:42:09,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:42:09,420 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.967741935483871) internal successors, (92), 31 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-06 10:42:09,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:09,420 INFO L225 Difference]: With dead ends: 81 [2025-02-06 10:42:09,420 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:42:09,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=1226, Unknown=25, NotChecked=150, Total=1640 [2025-02-06 10:42:09,421 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 25 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:09,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 720 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 528 Invalid, 0 Unknown, 72 Unchecked, 0.3s Time] [2025-02-06 10:42:09,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:42:09,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 10:42:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.2727272727272727) 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-02-06 10:42:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-02-06 10:42:09,423 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 42 [2025-02-06 10:42:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:09,423 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-02-06 10:42:09,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.967741935483871) internal successors, (92), 31 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-02-06 10:42:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:42:09,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:09,424 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:09,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:42:09,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:09,628 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:09,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:09,629 INFO L85 PathProgramCache]: Analyzing trace with hash -359875526, now seen corresponding path program 1 times [2025-02-06 10:42:09,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:09,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277083518] [2025-02-06 10:42:09,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:09,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:09,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:42:09,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:42:09,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:09,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 10:42:09,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:09,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277083518] [2025-02-06 10:42:09,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277083518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:09,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:09,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:42:09,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254770834] [2025-02-06 10:42:09,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:09,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:42:09,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:09,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:42:09,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:42:09,745 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-02-06 10:42:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:09,861 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2025-02-06 10:42:09,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:42:09,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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 44 [2025-02-06 10:42:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:09,862 INFO L225 Difference]: With dead ends: 83 [2025-02-06 10:42:09,862 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 10:42:09,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:42:09,863 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:09,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 114 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 10:42:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2025-02-06 10:42:09,865 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-02-06 10:42:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-02-06 10:42:09,865 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 44 [2025-02-06 10:42:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:09,865 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-02-06 10:42:09,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-02-06 10:42:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-02-06 10:42:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:42:09,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:09,866 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:09,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:42:09,866 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:09,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash -359875525, now seen corresponding path program 1 times [2025-02-06 10:42:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:09,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739129655] [2025-02-06 10:42:09,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:09,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:42:09,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:42:09,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:09,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 10:42:10,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:10,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739129655] [2025-02-06 10:42:10,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739129655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:10,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:10,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:42:10,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246384561] [2025-02-06 10:42:10,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:10,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:42:10,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:10,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:42:10,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:42:10,123 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:10,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:10,257 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2025-02-06 10:42:10,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:42:10,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-06 10:42:10,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:10,258 INFO L225 Difference]: With dead ends: 81 [2025-02-06 10:42:10,258 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:42:10,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:42:10,259 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:10,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 145 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:10,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:42:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2025-02-06 10:42:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 76 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2025-02-06 10:42:10,261 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 44 [2025-02-06 10:42:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:10,261 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2025-02-06 10:42:10,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2025-02-06 10:42:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:42:10,262 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:10,262 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:10,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:42:10,263 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:10,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:10,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1728760204, now seen corresponding path program 1 times [2025-02-06 10:42:10,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:10,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847586765] [2025-02-06 10:42:10,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:10,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:10,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:42:10,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:42:10,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:10,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:42:11,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:11,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847586765] [2025-02-06 10:42:11,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847586765] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:11,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713083596] [2025-02-06 10:42:11,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:11,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:11,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:11,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:42:11,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:42:11,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:42:11,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:42:11,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:11,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:11,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-06 10:42:11,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:11,327 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 10:42:11,328 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 19 treesize of output 16 [2025-02-06 10:42:11,362 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:42:11,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 10:42:11,419 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-02-06 10:42:11,419 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 16 treesize of output 18 [2025-02-06 10:42:11,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:42:11,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:42:11,478 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:42:11,478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 10:42:11,529 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 30 treesize of output 23 [2025-02-06 10:42:11,556 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2025-02-06 10:42:11,608 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2025-02-06 10:42:11,614 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 31 treesize of output 13 [2025-02-06 10:42:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:42:11,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:42:11,684 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 1)) is different from false [2025-02-06 10:42:11,691 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))))) is different from false [2025-02-06 10:42:11,700 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2025-02-06 10:42:11,700 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 24 treesize of output 23 [2025-02-06 10:42:15,755 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1322) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1323) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (not (= v_ArrVal_1322 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1322 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) is different from false [2025-02-06 10:42:15,760 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 74 treesize of output 72 [2025-02-06 10:42:15,763 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 28 treesize of output 24 [2025-02-06 10:42:15,767 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 54 treesize of output 46 [2025-02-06 10:42:15,916 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 10:42:15,916 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 16 treesize of output 15 [2025-02-06 10:42:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 21 refuted. 1 times theorem prover too weak. 2 trivial. 10 not checked. [2025-02-06 10:42:15,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713083596] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:42:15,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:42:15,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 39 [2025-02-06 10:42:15,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245178429] [2025-02-06 10:42:15,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:42:15,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 10:42:15,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:15,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 10:42:15,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1200, Unknown=10, NotChecked=216, Total=1560 [2025-02-06 10:42:15,924 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 40 states, 39 states have (on average 2.871794871794872) internal successors, (112), 40 states have internal predecessors, (112), 0 states have call successors, (0), 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-02-06 10:42:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:16,615 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2025-02-06 10:42:16,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:42:16,615 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.871794871794872) internal successors, (112), 40 states have internal predecessors, (112), 0 states have call successors, (0), 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 45 [2025-02-06 10:42:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:16,616 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:42:16,616 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 10:42:16,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=298, Invalid=1960, Unknown=10, NotChecked=282, Total=2550 [2025-02-06 10:42:16,618 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:16,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 438 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 741 Invalid, 0 Unknown, 171 Unchecked, 0.4s Time] [2025-02-06 10:42:16,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 10:42:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-02-06 10:42:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2025-02-06 10:42:16,621 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 45 [2025-02-06 10:42:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:16,621 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2025-02-06 10:42:16,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.871794871794872) internal successors, (112), 40 states have internal predecessors, (112), 0 states have call successors, (0), 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-02-06 10:42:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2025-02-06 10:42:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:42:16,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:16,623 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:16,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:42:16,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 10:42:16,827 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:16,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:16,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1728760205, now seen corresponding path program 1 times [2025-02-06 10:42:16,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:16,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243487637] [2025-02-06 10:42:16,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:16,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:42:16,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:42:16,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:16,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:42:17,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243487637] [2025-02-06 10:42:17,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243487637] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424962985] [2025-02-06 10:42:17,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:17,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:17,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:17,796 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:42:17,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:42:17,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:42:17,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:42:17,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:17,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:17,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-02-06 10:42:17,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:17,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:42:18,010 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:42:18,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 10:42:18,042 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 10:42:18,042 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 19 treesize of output 16 [2025-02-06 10:42:18,061 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:42:18,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 10:42:18,129 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-02-06 10:42:18,130 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 16 treesize of output 18 [2025-02-06 10:42:18,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:42:18,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:42:18,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:42:18,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-02-06 10:42:18,206 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:42:18,207 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-02-06 10:42:18,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-02-06 10:42:18,276 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 38 treesize of output 31 [2025-02-06 10:42:18,281 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 37 treesize of output 30 [2025-02-06 10:42:18,312 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 49 treesize of output 27 [2025-02-06 10:42:18,318 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 48 treesize of output 26 [2025-02-06 10:42:18,394 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 45 treesize of output 27 [2025-02-06 10:42:18,397 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 44 treesize of output 26 [2025-02-06 10:42:18,405 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 39 treesize of output 21 [2025-02-06 10:42:18,407 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 32 treesize of output 14 [2025-02-06 10:42:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:42:18,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:42:18,683 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1579 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (forall ((v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1578 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)))))) is different from false [2025-02-06 10:42:18,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:18,697 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 55 treesize of output 59 [2025-02-06 10:42:18,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1576 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1576) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1575 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1575) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) is different from false [2025-02-06 10:42:18,775 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1574 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1574 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1574)) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1576) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1573 (Array Int Int))) (or (forall ((v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1575 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1575) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1573 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1573)))) (forall ((v_ArrVal_1573 (Array Int Int))) (or (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (not (= (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1573 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1573)))))) is different from false [2025-02-06 10:42:18,789 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 82 treesize of output 80 [2025-02-06 10:42:18,797 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 32 treesize of output 28 [2025-02-06 10:42:18,800 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 62 treesize of output 54 [2025-02-06 10:42:18,810 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:42:18,810 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:42:18,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-02-06 10:42:18,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:18,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2025-02-06 10:42:18,818 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 18 treesize of output 10 [2025-02-06 10:42:18,820 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:42:18,821 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:42:18,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-02-06 10:42:18,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2025-02-06 10:42:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 9 not checked. [2025-02-06 10:42:19,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424962985] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:42:19,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:42:19,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 45 [2025-02-06 10:42:19,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634376769] [2025-02-06 10:42:19,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:42:19,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-06 10:42:19,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:19,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-06 10:42:19,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1636, Unknown=16, NotChecked=252, Total=2070 [2025-02-06 10:42:19,110 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 46 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 46 states have internal predecessors, (129), 0 states have call successors, (0), 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-02-06 10:42:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:20,482 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2025-02-06 10:42:20,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 10:42:20,482 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 46 states have internal predecessors, (129), 0 states have call successors, (0), 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 45 [2025-02-06 10:42:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:20,485 INFO L225 Difference]: With dead ends: 88 [2025-02-06 10:42:20,485 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 10:42:20,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=401, Invalid=2900, Unknown=17, NotChecked=342, Total=3660 [2025-02-06 10:42:20,486 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:20,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 525 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 817 Invalid, 0 Unknown, 185 Unchecked, 0.5s Time] [2025-02-06 10:42:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 10:42:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2025-02-06 10:42:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 82 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-02-06 10:42:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2025-02-06 10:42:20,494 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 45 [2025-02-06 10:42:20,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:20,494 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2025-02-06 10:42:20,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 46 states have internal predecessors, (129), 0 states have call successors, (0), 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-02-06 10:42:20,494 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2025-02-06 10:42:20,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:42:20,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:20,495 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:20,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 10:42:20,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 10:42:20,696 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-02-06 10:42:20,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:20,696 INFO L85 PathProgramCache]: Analyzing trace with hash -365080032, now seen corresponding path program 1 times [2025-02-06 10:42:20,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:20,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123808484] [2025-02-06 10:42:20,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:20,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:20,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:42:20,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:42:20,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:20,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:22,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:22,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123808484] [2025-02-06 10:42:22,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123808484] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:22,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017502421] [2025-02-06 10:42:22,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:22,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:22,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:22,175 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:42:22,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:42:22,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:42:22,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:42:22,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:22,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:22,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-02-06 10:42:22,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:22,476 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:42:22,476 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 17 treesize of output 21 [2025-02-06 10:42:22,588 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-02-06 10:42:22,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-02-06 10:42:22,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-02-06 10:42:22,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:42:22,845 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-02-06 10:42:22,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2025-02-06 10:42:22,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:42:22,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-06 10:42:22,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-02-06 10:42:22,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:42:22,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:42:22,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:42:23,005 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:42:23,006 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2025-02-06 10:42:23,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-02-06 10:42:23,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:42:23,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:42:23,133 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 36 treesize of output 27 [2025-02-06 10:42:23,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 10:42:23,179 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 23 treesize of output 11 [2025-02-06 10:42:23,182 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 35 treesize of output 19 [2025-02-06 10:42:23,185 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 20 treesize of output 15 [2025-02-06 10:42:23,300 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 23 treesize of output 11 [2025-02-06 10:42:23,306 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 35 treesize of output 19 [2025-02-06 10:42:23,308 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 20 treesize of output 15 [2025-02-06 10:42:23,317 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 15 treesize of output 7 [2025-02-06 10:42:23,320 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 27 treesize of output 15 [2025-02-06 10:42:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:23,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:42:23,889 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse2))) (and (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_1851 (Array Int Int))) (or (< .cse1 |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_1851) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0)))) (forall ((v_prenex_4 Int) (v_ArrVal_1851 (Array Int Int))) (or (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_1851) .cse0) v_prenex_4) |c_ULTIMATE.start_main_~data_init~0#1|) (< .cse1 v_prenex_4) (= v_prenex_4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (< v_prenex_4 0)))))) is different from false [2025-02-06 10:42:24,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_1851 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1851) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|)) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|)))))) (forall ((v_prenex_4 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1851 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1) v_prenex_4) (= v_prenex_4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1851) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) v_prenex_4) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_4 0))))) is different from false [2025-02-06 10:42:24,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_1851 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_prenex_4 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1851 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_4) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_4) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) v_prenex_4) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_4 0))))) is different from false [2025-02-06 10:42:24,139 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1837 Int) (v_prenex_4 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_4) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1838) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) v_prenex_4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_4) (< v_prenex_4 0))) (forall ((v_ArrVal_1837 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1838) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_1851 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0)))))))) is different from false [2025-02-06 10:42:24,281 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_1834 (Array Int Int))) (or (not (= v_ArrVal_1834 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1834 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1835 (Array Int Int))) (or (forall ((v_ArrVal_1837 Int) (v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse1 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1838) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_ArrVal_1851 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0) (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|)))))) (not (= (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1835 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1835)))))) (forall ((v_ArrVal_1834 (Array Int Int))) (or (forall ((v_ArrVal_1835 (Array Int Int))) (or (forall ((v_ArrVal_1837 Int) (v_ArrVal_1833 (Array Int Int)) (v_prenex_4 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1838) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) v_prenex_4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_4) (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) v_prenex_4) (< v_prenex_4 0))) (not (= (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1835 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1835)))) (not (= v_ArrVal_1834 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1834 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) is different from false [2025-02-06 10:42:24,308 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 855 treesize of output 851 [2025-02-06 10:42:24,318 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 463 treesize of output 455 [2025-02-06 10:42:24,327 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 455 treesize of output 439 [2025-02-06 10:42:24,333 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 439 treesize of output 435 [2025-02-06 10:42:24,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:24,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 435 treesize of output 466 [2025-02-06 10:42:24,366 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 493 treesize of output 489 [2025-02-06 10:42:24,382 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 505 treesize of output 497 [2025-02-06 10:42:24,394 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 497 treesize of output 493 [2025-02-06 10:42:24,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:24,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 493 treesize of output 524 [2025-02-06 10:42:24,435 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 473 treesize of output 465 [2025-02-06 10:42:24,451 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 465 treesize of output 461 [2025-02-06 10:42:24,473 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 461 treesize of output 453 [2025-02-06 10:42:24,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:24,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-02-06 10:42:24,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:24,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-02-06 10:42:25,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:25,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-02-06 10:42:25,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:25,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-02-06 10:42:25,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:25,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-02-06 10:42:25,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:25,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-02-06 10:42:25,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:25,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-02-06 10:42:26,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:26,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 45 [2025-02-06 10:42:26,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:26,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-02-06 10:42:27,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:27,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-02-06 10:42:27,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:27,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-02-06 10:42:27,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:27,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-02-06 10:42:27,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:27,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 45 [2025-02-06 10:42:27,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:27,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-02-06 10:42:28,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:28,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-02-06 10:42:28,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:28,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-02-06 10:42:28,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:28,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-02-06 10:42:28,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:28,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 45 [2025-02-06 10:42:28,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:28,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-02-06 10:42:29,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:29,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-02-06 10:42:29,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:29,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-02-06 10:42:29,533 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 8 treesize of output 6 [2025-02-06 10:42:29,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:29,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-02-06 10:42:29,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:29,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-02-06 10:42:29,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:29,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-02-06 10:42:30,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:30,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 45 [2025-02-06 10:42:30,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:30,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-02-06 10:42:30,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:30,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-02-06 10:42:30,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:30,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-02-06 10:42:30,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:30,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-02-06 10:42:31,394 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 5101 treesize of output 5047 [2025-02-06 10:42:34,540 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 8 treesize of output 6 [2025-02-06 10:42:36,735 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 8 treesize of output 6 [2025-02-06 10:42:36,740 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 8 treesize of output 6 [2025-02-06 10:42:36,775 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 8 treesize of output 6 [2025-02-06 10:42:36,902 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 8 treesize of output 6 [2025-02-06 10:42:37,977 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 8 treesize of output 6 [2025-02-06 10:42:37,998 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 8 treesize of output 6 [2025-02-06 10:42:38,050 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 8 treesize of output 6 [2025-02-06 10:42:38,093 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 5037 treesize of output 4869 [2025-02-06 10:42:39,179 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 8 treesize of output 6 [2025-02-06 10:42:39,228 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 8 treesize of output 6 [2025-02-06 10:42:39,230 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 8 treesize of output 6 [2025-02-06 10:42:39,295 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 8 treesize of output 6 [2025-02-06 10:42:39,299 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 8 treesize of output 6 [2025-02-06 10:42:39,379 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 8 treesize of output 6 [2025-02-06 10:42:40,224 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 8 treesize of output 6 [2025-02-06 10:42:40,248 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 4866 treesize of output 4674 [2025-02-06 10:42:43,579 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse6 (not .cse4)) (.cse9 (not .cse8))) (and (forall ((v_prenex_1976 Int) (v_prenex_60 (Array Int Int)) (v_prenex_1979 (Array Int Int)) (v_prenex_57 Int) (v_prenex_1978 Int) (v_prenex_1975 (Array Int Int)) (v_prenex_1977 Int)) (let ((.cse0 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_60) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_57)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1975) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1979))) (or (= (select (select .cse0 v_prenex_1976) v_prenex_1977) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1977 0) (= v_prenex_1978 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_prenex_1976 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse0 v_prenex_1978) v_prenex_1977)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1977) (= (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1977) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (and (forall ((v_prenex_1888 Int) (v_prenex_1889 (Array Int Int)) (v_prenex_1887 Int) (v_prenex_2036 Int) (v_prenex_1890 Int) (v_prenex_1886 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1890)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1886) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1889))) (or (= (select (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1888) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1888 0) (= (select (select .cse2 v_prenex_2036) v_prenex_1888) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse2 v_prenex_1887) v_prenex_1888)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1888) (= v_prenex_1887 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or .cse4 (forall ((v_prenex_1901 (Array Int Int)) (v_prenex_1903 (Array Int Int)) (v_prenex_1904 Int) (v_prenex_1902 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1902) (< v_prenex_1902 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1904)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1901) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1903) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1902))))) (or .cse4 (forall ((v_prenex_1898 Int) (v_prenex_1897 Int) (v_prenex_1896 (Array Int Int)) (v_prenex_1899 (Array Int Int)) (v_prenex_1900 Int)) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1900)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1896) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1899))) (or (= (select (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1897) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1897 0) (= (select (select .cse5 v_prenex_1898) v_prenex_1897) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1897))))) (or (forall ((v_prenex_2040 (Array Int Int)) (v_prenex_2035 Int) (v_prenex_2037 Int) (v_prenex_2038 Int) (v_prenex_2039 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_2038)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2039) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2040) v_prenex_2035) v_prenex_2037)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2037) (= v_prenex_2035 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_2037 0))) .cse6) (forall ((v_prenex_1895 Int) (v_prenex_1891 (Array Int Int)) (v_prenex_1893 Int) (v_prenex_1892 Int) (v_prenex_1894 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1895)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1891) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1894))) (or (= (select (select .cse7 v_prenex_1892) v_prenex_1893) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1893)) (= v_prenex_1892 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1893 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1893))))) .cse8) (or (and (forall ((v_prenex_1597 Int) (v_prenex_1593 (Array Int Int)) (v_prenex_1596 (Array Int Int)) (v_prenex_1594 Int) (v_prenex_1595 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 (select v_prenex_1593 .cse1))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1595) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1596) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1594) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1594 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1594 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1593) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1595) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1596) v_prenex_1597) v_prenex_1594)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1594))) (or .cse9 (forall ((v_prenex_1635 Int) (v_prenex_1634 Int) (v_arrayElimArr_8 (Array Int Int)) (v_prenex_1633 (Array Int Int)) (v_prenex_1632 (Array Int Int))) (or (< v_prenex_1634 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1632) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1633) v_prenex_1635) v_prenex_1634) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1634 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1634)))) (or .cse8 (forall ((v_prenex_1631 Int) (v_prenex_1598 Int) (v_prenex_1600 (Array Int Int)) (v_prenex_1599 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1631)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1599) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1600) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1598) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1598) (< v_prenex_1598 0) (= v_prenex_1598 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse4) (or (and (or (forall ((v_prenex_1586 Int) (v_prenex_1585 (Array Int Int)) (v_prenex_1583 Int) (v_prenex_1582 Int) (v_prenex_1584 (Array Int Int))) (or (= v_prenex_1583 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1582)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1584) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1585) v_prenex_1586) v_prenex_1583) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1583 0))) .cse8) (or .cse9 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_1575 Int) (v_prenex_1572 Int) (v_prenex_1574 (Array Int Int)) (v_prenex_1573 (Array Int Int)) (v_prenex_1629 Int)) (let ((.cse10 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1573) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1574))) (or (< v_prenex_1572 0) (= v_prenex_1572 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse10 v_prenex_1575) v_prenex_1572) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse10 v_prenex_1629) v_prenex_1572)))))) (forall ((v_prenex_1625 (Array Int Int)) (v_prenex_1577 Int) (v_prenex_1576 Int) (v_prenex_1581 Int) (v_prenex_1580 Int) (v_prenex_1578 (Array Int Int)) (v_prenex_1579 (Array Int Int))) (or (= v_prenex_1577 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_prenex_1625 .cse1 v_prenex_1576)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1578) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1579) v_prenex_1581) v_prenex_1577) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1576)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1578) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1577)) (< v_prenex_1577 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1625) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1576)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1578) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1579) v_prenex_1580) v_prenex_1577) |c_ULTIMATE.start_main_~data_init~0#1|))) (or (forall ((v_prenex_1624 Int) (v_prenex_1626 (Array Int Int)) (v_prenex_1630 (Array Int Int)) (v_prenex_1628 Int) (v_prenex_1627 Int)) (let ((.cse11 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1624)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1630) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1626))) (or (= (select (select .cse11 v_prenex_1627) v_prenex_1628) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1628) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1628 0) (= v_prenex_1628 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) .cse8) (forall ((v_prenex_1590 (Array Int Int)) (v_prenex_1589 Int) (v_prenex_1587 Int) (v_prenex_1591 (Array Int Int)) (v_prenex_1592 Int) (v_prenex_1588 (Array Int Int))) (or (< v_prenex_1589 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1588) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1587)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1590) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1591) v_prenex_1592) v_prenex_1589)) (= v_prenex_1589 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) .cse6) (or (forall ((v_prenex_1657 Int) (v_prenex_1654 Int) (v_prenex_1653 Int) (v_prenex_1655 (Array Int Int)) (v_prenex_1656 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1653)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1655) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1656))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1654) (= (select (select .cse12 v_prenex_1657) v_prenex_1654) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1654 0) (= v_prenex_1654 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1654))))) .cse8) (or (and (or .cse4 (forall ((v_prenex_1846 (Array Int Int)) (v_prenex_1848 (Array Int Int)) (v_prenex_1849 Int) (v_prenex_1847 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1849)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1848) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1847) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1847 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1847)))) (forall ((v_prenex_2017 Int) (v_prenex_2018 Int) (v_prenex_2020 Int) (v_prenex_2016 (Array Int Int)) (v_prenex_2019 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_2020)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2016) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2019))) (or (= v_prenex_2017 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse13 v_prenex_2017) v_prenex_2018) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2018) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2018) (< v_prenex_2018 0))))) .cse8) (or .cse8 (forall ((v_prenex_2013 Int) (v_prenex_2015 Int) (v_prenex_2010 (Array Int Int)) (v_prenex_2011 Int) (v_prenex_2014 (Array Int Int)) (v_prenex_2012 Int)) (let ((.cse14 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_2015)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2010) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2014))) (or (= v_prenex_2011 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse14 v_prenex_2011) v_prenex_2012) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2012 0) (= (select (select .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2012) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2013 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse14 v_prenex_2013) v_prenex_2012) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2012))))) (or (and (or .cse8 (forall ((v_prenex_1885 Int) (v_prenex_1883 Int) (v_prenex_1882 Int) (v_prenex_1881 (Array Int Int)) (v_prenex_1884 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1885)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1881) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1884) v_prenex_1882) v_prenex_1883) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1883 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1883) (= v_prenex_1882 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_prenex_2030 (Array Int Int)) (v_prenex_2033 (Array Int Int)) (v_prenex_2031 Int) (v_prenex_2032 Int) (v_prenex_2034 Int) (v_prenex_2029 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2030) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_2034)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2029) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2033) v_prenex_2031) v_prenex_2032) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2032) (= v_prenex_2031 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_2032 0)))) .cse6) (or .cse4 (and (forall ((v_prenex_2003 Int) (v_prenex_2002 (Array Int Int)) (v_prenex_2000 Int) (v_prenex_2001 Int) (v_prenex_1998 (Array Int Int)) (v_prenex_1997 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1998) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_2003)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1997) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2002))) (or (< v_prenex_2000 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2000) (= (select (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2000) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse15 v_prenex_2001) v_prenex_2000)) (= v_prenex_2001 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or (forall ((v_prenex_1844 Int) (v_prenex_1999 (Array Int Int)) (v_prenex_1845 (Array Int Int)) (v_prenex_1843 Int) (v_prenex_1842 (Array Int Int))) (or (= v_prenex_1843 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1844 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1844) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1999) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1845) v_prenex_1843) v_prenex_1844)))) .cse9))) (or (and (or (forall ((v_prenex_1822 Int) (v_prenex_1823 (Array Int Int)) (v_prenex_1821 Int) (v_prenex_1990 Int) (v_prenex_1820 (Array Int Int)) (v_prenex_1824 Int)) (let ((.cse16 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1824)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1820) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1823))) (or (= v_prenex_1821 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1822) (= (select (select .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1822) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse16 v_prenex_1821) v_prenex_1822) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse16 v_prenex_1990) v_prenex_1822) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1822 0)))) .cse8) (or .cse8 (forall ((v_prenex_1825 (Array Int Int)) (v_prenex_1828 (Array Int Int)) (v_prenex_1829 Int) (v_prenex_1827 Int) (v_prenex_1826 Int)) (or (< v_prenex_1827 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1827) (= v_prenex_1826 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1829)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1825) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1828) v_prenex_1826) v_prenex_1827) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1815 (Array Int Int)) (v_prenex_1818 (Array Int Int)) (v_prenex_1819 Int) (v_prenex_1817 Int) (v_prenex_1816 Int) (v_prenex_1995 (Array Int Int))) (or (= v_prenex_1816 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1817 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1995) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1819)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1815) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1818) v_prenex_1816) v_prenex_1817) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1817))) (or .cse8 (forall ((v_prenex_1993 Int) (v_prenex_1992 Int) (v_prenex_1994 (Array Int Int)) (v_prenex_1996 (Array Int Int)) (v_prenex_1989 Int)) (let ((.cse17 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1993)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1994) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1996))) (or (= (select (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1992) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1992 0) (= v_prenex_1989 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse17 v_prenex_1989) v_prenex_1992)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1992))))) (or .cse9 (forall ((v_prenex_1837 (Array Int Int)) (v_prenex_1840 Int) (v_prenex_1991 (Array Int Int)) (v_prenex_1839 Int) (v_prenex_1838 Int) (v_prenex_1841 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1991) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1841))) (or (= v_prenex_1838 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse18 v_prenex_1840) v_prenex_1839) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse18 v_prenex_1838) v_prenex_1839) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1839) (< v_prenex_1839 0))))) (forall ((v_prenex_1835 (Array Int Int)) (v_prenex_1833 Int) (v_prenex_1832 Int) (v_prenex_1831 (Array Int Int)) (v_prenex_1836 Int) (v_prenex_1830 (Array Int Int)) (v_prenex_1834 Int)) (let ((.cse19 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1836)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1830) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1835))) (or (< v_prenex_1833 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1833) (= (select (select .cse19 v_prenex_1832) v_prenex_1833) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse19 v_prenex_1834) v_prenex_1833) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1833) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1832 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse6) (or (and (or (and (forall ((v_prenex_1756 Int) (v_prenex_1757 (Array Int Int)) (v_prenex_1755 Int) (v_prenex_1780 Int) (v_prenex_1754 (Array Int Int)) (v_prenex_1758 Int)) (let ((.cse20 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1758)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1754) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1757))) (or (= (select (select .cse20 v_prenex_1780) v_prenex_1756) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse20 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1756)) (< v_prenex_1756 0) (= v_prenex_1755 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse20 v_prenex_1755) v_prenex_1756) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1782 Int) (v_prenex_1783 (Array Int Int)) (v_prenex_1781 Int) (v_prenex_1784 (Array Int Int)) (v_prenex_1779 Int)) (or (= v_prenex_1779 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1781 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1782)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1783) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1784) v_prenex_1779) v_prenex_1781) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_1759 (Array Int Int)) (v_prenex_1763 Int) (v_prenex_1761 Int) (v_prenex_1760 Int) (v_prenex_1762 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1763)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1759) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1762))) (or (< v_prenex_1761 0) (= (select (select .cse21 v_prenex_1760) v_prenex_1761) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1761) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1760 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse8) (forall ((v_prenex_1796 Int) (v_prenex_1792 (Array Int Int)) (v_prenex_1794 Int) (v_prenex_1791 (Array Int Int)) (v_prenex_1793 Int) (v_prenex_1795 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1792) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1796)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1791) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1795) v_prenex_1793) v_prenex_1794) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1794 0) (= v_prenex_1793 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (forall ((v_prenex_1799 Int) (v_prenex_1798 Int) (v_prenex_1797 (Array Int Int)) (v_prenex_1800 (Array Int Int)) (v_prenex_1801 Int)) (or (= v_prenex_1798 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1801)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1797) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1800) v_prenex_1798) v_prenex_1799) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1799 0))) .cse8) (or .cse8 (forall ((v_prenex_1778 Int) (v_prenex_1776 Int) (v_prenex_1775 Int) (v_prenex_1774 (Array Int Int)) (v_prenex_1777 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1778)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1774) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1777))) (or (< v_prenex_1776 0) (= v_prenex_1775 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse22 v_prenex_1775) v_prenex_1776) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse22 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1776) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (forall ((v_prenex_1769 (Array Int Int)) (v_prenex_1985 Int) (v_prenex_1772 Int) (v_prenex_1771 Int) (v_prenex_1770 Int) (v_prenex_1773 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1985)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1769) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1773))) (or (= (select (select .cse23 v_prenex_1772) v_prenex_1771) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1772 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1771 0) (= (select (select .cse23 v_prenex_1770) v_prenex_1771) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1770 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1771) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse8) (or (forall ((v_prenex_1988 (Array Int Int)) (v_prenex_1982 Int) (v_prenex_1981 Int) (v_prenex_1980 Int) (v_prenex_1984 (Array Int Int)) (v_prenex_1986 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1984) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1986) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1988))) (or (= (select (select .cse24 v_prenex_1981) v_prenex_1982) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1980 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse24 v_prenex_1980) v_prenex_1982)) (= v_prenex_1981 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1982 0)))) .cse9) (or .cse9 (forall ((v_prenex_1767 Int) (v_prenex_1766 Int) (v_prenex_1768 (Array Int Int)) (v_prenex_1765 Int) (v_prenex_1983 (Array Int Int)) (v_prenex_1764 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1983) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1764) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1768))) (or (< v_prenex_1766 0) (= (select (select .cse25 v_prenex_1767) v_prenex_1766) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1765 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse25 v_prenex_1765) v_prenex_1766) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse8 (forall ((v_prenex_1802 (Array Int Int)) (v_prenex_1806 (Array Int Int)) (v_prenex_1807 Int) (v_prenex_1805 Int) (v_prenex_1804 Int) (v_prenex_1803 Int)) (let ((.cse26 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1807)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1802) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1806))) (or (< v_prenex_1804 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse26 v_prenex_1803) v_prenex_1804)) (= v_prenex_1803 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1804) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse26 v_prenex_1805) v_prenex_1804) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((v_prenex_1813 (Array Int Int)) (v_prenex_1811 Int) (v_prenex_1810 Int) (v_prenex_1808 (Array Int Int)) (v_prenex_1809 (Array Int Int)) (v_prenex_1814 Int) (v_prenex_1812 Int)) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1809) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1814)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1808) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1813))) (or (= (select (select .cse27 v_prenex_1812) v_prenex_1811) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1810 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1811 0) (= (select (select .cse27 v_prenex_1810) v_prenex_1811) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1811) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1788 Int) (v_prenex_1787 Int) (v_prenex_1786 Int) (v_prenex_1785 (Array Int Int)) (v_prenex_1790 Int) (v_prenex_1987 (Array Int Int)) (v_prenex_1789 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1987) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1790)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1785) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1789))) (or (< v_prenex_1787 0) (= (select (select .cse28 v_prenex_1788) v_prenex_1787) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse28 v_prenex_1786) v_prenex_1787)) (= v_prenex_1786 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1787) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1788 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse6) (or (and (or (and (forall ((v_prenex_1704 (Array Int Int)) (v_prenex_1707 (Array Int Int)) (v_prenex_1708 (Array Int Int)) (v_prenex_1706 Int) (v_prenex_1705 Int) (v_prenex_1703 Int)) (let ((.cse29 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1704) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1707) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1708))) (or (< v_prenex_1705 0) (= v_prenex_1703 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse29 v_prenex_1703) v_prenex_1705) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse29 v_prenex_1706) v_prenex_1705) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_prenex_1684 Int) (v_prenex_1681 (Array Int Int)) (v_prenex_1683 Int) (v_prenex_1682 Int) (v_prenex_1685 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1681) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1685))) (or (= (select (select .cse30 v_prenex_1682) v_prenex_1683) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1683) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1682 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse30 v_prenex_1684) v_prenex_1683)) (< v_prenex_1683 0)))) (forall ((v_prenex_1679 Int) (v_prenex_1678 Int) (v_arrayElimArr_24 (Array Int Int)) (v_prenex_1680 (Array Int Int)) (v_prenex_1677 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1677) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1680) v_prenex_1678) v_prenex_1679) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1678 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1679 0)))) .cse6) (or (forall ((v_arrayElimArr_33 (Array Int Int)) (v_prenex_1711 Int) (v_prenex_1710 Int) (v_prenex_1709 (Array Int Int)) (v_prenex_1712 (Array Int Int))) (or (= v_prenex_1710 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1711) (< v_prenex_1711 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_33) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1709) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1712) v_prenex_1710) v_prenex_1711) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse6) (or (and (forall ((v_arrayElimArr_35 (Array Int Int)) (v_prenex_1741 Int) (v_prenex_1743 (Array Int Int)) (v_prenex_1738 Int) (v_prenex_1742 (Array Int Int))) (or (< v_prenex_1741 0) (= v_prenex_1738 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1741) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_35) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1742) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1743) v_prenex_1738) v_prenex_1741) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_1701 Int) (v_prenex_1702 (Array Int Int)) (v_prenex_1700 Int) (v_prenex_1699 Int) (v_prenex_1740 (Array Int Int)) (v_prenex_1698 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1740) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1698) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1702))) (or (< v_prenex_1700 0) (= v_prenex_1699 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1700) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse31 v_prenex_1701) v_prenex_1700)) (= (select (select .cse31 v_prenex_1699) v_prenex_1700) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_arrayElimArr_36 (Array Int Int)) (v_prenex_1696 Int) (v_prenex_1695 Int) (v_prenex_1694 (Array Int Int)) (v_prenex_1697 (Array Int Int)) (v_prenex_1739 Int)) (let ((.cse32 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1694) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1697))) (or (= (select (select .cse32 v_prenex_1695) v_prenex_1696) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1696) (< v_prenex_1696 0) (= v_prenex_1695 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse32 v_prenex_1739) v_prenex_1696) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse32 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1696) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse6) (forall ((v_prenex_1727 (Array Int Int)) (v_prenex_1730 Int) (v_prenex_1729 Int) (v_prenex_1728 Int) (v_prenex_1732 (Array Int Int)) (v_prenex_1731 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1731) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1727) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1732))) (or (< v_prenex_1730 0) (= v_prenex_1729 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse33 v_prenex_1728) v_prenex_1730) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1728 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse33 v_prenex_1729) v_prenex_1730) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_prenex_1713 (Array Int Int)) (v_prenex_1717 (Array Int Int)) (v_prenex_1716 Int) (v_prenex_1715 Int) (v_prenex_1714 Int)) (let ((.cse34 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_22) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1713) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1717))) (or (= v_prenex_1716 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse34 v_prenex_1714) v_prenex_1715)) (= v_prenex_1714 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1715) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse34 v_prenex_1716) v_prenex_1715) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1715 0)))) (forall ((v_prenex_1745 Int) (v_prenex_1749 (Array Int Int)) (v_prenex_1748 (Array Int Int)) (v_prenex_1747 Int) (v_prenex_1744 (Array Int Int)) (v_prenex_1746 Int)) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1748) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1744) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1749))) (or (= v_prenex_1745 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1747) (< v_prenex_1747 0) (= (select (select .cse35 v_prenex_1745) v_prenex_1747) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1746 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse35 v_prenex_1746) v_prenex_1747))))) (or (forall ((v_arrayElimArr_26 (Array Int Int)) (v_prenex_1752 Int) (v_prenex_1751 Int) (v_prenex_1750 (Array Int Int)) (v_prenex_1753 (Array Int Int))) (or (< v_prenex_1752 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_26) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1750) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1753) v_prenex_1751) v_prenex_1752)) (= v_prenex_1751 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse6) (or .cse4 (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_prenex_1720 Int) (v_prenex_1718 (Array Int Int)) (v_prenex_1719 Int) (v_prenex_1721 (Array Int Int))) (or (< v_prenex_1720 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1720) (= v_prenex_1719 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1718) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1721) v_prenex_1719) v_prenex_1720)))) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_prenex_1688 Int) (v_prenex_1687 Int) (v_prenex_1686 (Array Int Int)) (v_prenex_1689 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1686) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1689))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1687) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1687)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 v_prenex_1688) v_prenex_1687)) (< v_prenex_1687 0) (= v_prenex_1688 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (or .cse4 (and (forall ((v_prenex_1726 (Array Int Int)) (v_prenex_1723 (Array Int Int)) (v_prenex_1725 Int) (v_prenex_1722 (Array Int Int)) (v_prenex_1724 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1723) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1722) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1726) v_prenex_1724) v_prenex_1725) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1725 0) (= v_prenex_1724 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_arrayElimArr_25 (Array Int Int)) (v_prenex_1690 (Array Int Int)) (v_prenex_1693 (Array Int Int)) (v_prenex_1692 Int) (v_prenex_1691 Int)) (let ((.cse37 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1690) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1693))) (or (= (select (select .cse37 v_prenex_1692) v_prenex_1691) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1691 0) (= v_prenex_1692 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1691) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (and (forall ((v_prenex_1658 (Array Int Int)) (v_prenex_1660 Int) (v_prenex_1661 (Array Int Int)) (v_prenex_1659 Int) (v_arrayElimArr_31 (Array Int Int))) (or (< v_prenex_1660 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_31) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1658) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1661) v_prenex_1659) v_prenex_1660)) (= v_prenex_1659 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_prenex_1665 Int) (v_prenex_1664 Int) (v_prenex_1663 Int) (v_arrayElimArr_14 (Array Int Int)) (v_prenex_1662 (Array Int Int)) (v_prenex_1666 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1662) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1666))) (or (= v_prenex_1664 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse38 v_prenex_1664) v_prenex_1665) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1663 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1665 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse38 v_prenex_1663) v_prenex_1665))))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_prenex_1675 Int) (v_prenex_1674 Int) (v_prenex_1673 Int) (v_prenex_1672 (Array Int Int)) (v_prenex_1676 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1672) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1676))) (or (= v_prenex_1673 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse39 v_prenex_1673) v_prenex_1674) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1674 0) (= (select (select .cse39 v_prenex_1675) v_prenex_1674) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1668 Int) (v_prenex_1671 (Array Int Int)) (v_prenex_1670 Int) (v_arrayElimArr_30 (Array Int Int)) (v_prenex_1667 (Array Int Int)) (v_prenex_1669 Int)) (let ((.cse40 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1667) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1671))) (or (= (select (select .cse40 v_prenex_1670) v_prenex_1669) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1669 0) (= v_prenex_1668 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1669)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse40 v_prenex_1668) v_prenex_1669))))) (forall ((v_prenex_61 (Array Int Int)) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_prenex_63 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (let ((.cse41 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_61) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_63))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_95) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 v_arrayElimCell_96) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 v_arrayElimCell_95) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_96))))) .cse6) (forall ((v_prenex_1734 Int) (v_arrayElimArr_34 (Array Int Int)) (v_prenex_1737 (Array Int Int)) (v_prenex_1736 Int) (v_prenex_1733 (Array Int Int)) (v_prenex_1735 Int)) (let ((.cse42 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_34) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1733) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1737))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 v_prenex_1734) v_prenex_1735)) (= v_prenex_1734 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1735)) (= (select (select .cse42 v_prenex_1736) v_prenex_1735) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1736 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1735 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1735))))) .cse9) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_1649 (Array Int Int)) (v_prenex_1652 Int) (v_prenex_1651 Int) (v_prenex_1650 (Array Int Int)) (v_prenex_1648 Int)) (let ((.cse43 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1649) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1650))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse43 v_prenex_1652) v_prenex_1648)) (= v_prenex_1648 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1648) (= (select (select .cse43 v_prenex_1651) v_prenex_1648) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1648 0)))) .cse9) (or (and (or (and (forall ((v_prenex_1604 (Array Int Int)) (v_prenex_1602 Int) (v_prenex_1603 (Array Int Int)) (v_prenex_1605 Int) (v_prenex_1601 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1601) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1603) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1604) v_prenex_1605) v_prenex_1602) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1602 0) (= v_prenex_1602 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_prenex_1637 (Array Int Int)) (v_prenex_1636 (Array Int Int)) (v_prenex_1640 Int) (v_prenex_1641 (Array Int Int)) (v_prenex_1639 Int)) (or (< v_prenex_1639 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 (select v_prenex_1636 .cse1))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1641) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1637) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1639) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1639 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1636) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1641) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1637) v_prenex_1640) v_prenex_1639) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse4) (forall ((v_prenex_1613 Int) (v_prenex_1610 Int) (v_arrayElimArr_27 (Array Int Int)) (v_prenex_1611 (Array Int Int)) (v_prenex_1612 (Array Int Int)) (v_prenex_1614 Int)) (let ((.cse44 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_27) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1611) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1612))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse44 v_prenex_1614) v_prenex_1610)) (= v_prenex_1610 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse44 v_prenex_1613) v_prenex_1610)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 (select v_arrayElimArr_27 .cse1))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1611) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1612) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1610) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1610 0)))) (or (forall ((v_prenex_1617 (Array Int Int)) (v_prenex_1616 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_prenex_1618 Int) (v_prenex_1615 Int)) (or (= v_prenex_1615 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1616) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1617) v_prenex_1618) v_prenex_1615) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1615 0))) .cse6) (forall ((v_prenex_1608 (Array Int Int)) (v_prenex_1607 (Array Int Int)) (v_prenex_1609 Int) (v_prenex_1606 Int) (v_prenex_1638 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse45 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1607) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1608))) (or (< v_prenex_1606 0) (= (select (select .cse45 v_prenex_1638) v_prenex_1606) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse45 v_prenex_1609) v_prenex_1606) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1606 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse9) (or (forall ((v_prenex_2006 Int) (v_prenex_2007 Int) (v_prenex_2005 Int) (v_prenex_2004 (Array Int Int)) (v_prenex_2008 (Array Int Int)) (v_prenex_2009 (Array Int Int))) (let ((.cse46 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2008) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2004) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2009))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2007) (< v_prenex_2007 0) (= v_prenex_2005 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse46 v_prenex_2006) v_prenex_2007)) (= (select (select .cse46 v_prenex_2005) v_prenex_2007) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2006 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse9) (or .cse4 (and (or (forall ((v_prenex_1974 Int) (v_prenex_1969 (Array Int Int)) (v_prenex_1972 Int) (v_prenex_1971 Int) (v_prenex_1970 Int) (v_prenex_1973 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1974)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1969) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1973))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1971) (= (select (select .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1971) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse47 v_prenex_1970) v_prenex_1971)) (= (select (select .cse47 v_prenex_1972) v_prenex_1971) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1972 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1971 0)))) .cse8) (forall ((v_prenex_1941 Int) (v_prenex_1936 (Array Int Int)) (v_prenex_1937 (Array Int Int)) (v_prenex_1939 Int) (v_prenex_1938 Int) (v_prenex_1940 (Array Int Int)) (v_prenex_2041 Int)) (let ((.cse48 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1937) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1941)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1936) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1940))) (or (= v_prenex_1939 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1938) (= (select (select .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1938) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse48 v_prenex_2041) v_prenex_1938) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse48 v_prenex_1939) v_prenex_1938) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1938 0)))) (or .cse9 (forall ((v_prenex_1954 Int) (v_prenex_1957 (Array Int Int)) (v_prenex_2045 (Array Int Int)) (v_prenex_1956 Int) (v_prenex_1953 (Array Int Int)) (v_prenex_1955 Int)) (let ((.cse49 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2045) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1953) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1957))) (or (< v_prenex_1956 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1956) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse49 v_prenex_1955) v_prenex_1956)) (= v_prenex_1955 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse49 v_prenex_1954) v_prenex_1956) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (forall ((v_prenex_1958 (Array Int Int)) (v_prenex_1960 Int) (v_prenex_2042 (Array Int Int)) (v_prenex_1961 (Array Int Int)) (v_prenex_1959 Int)) (or (= v_prenex_1959 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2042) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1958) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1961) v_prenex_1959) v_prenex_1960) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1960 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1960))) .cse9) (or .cse8 (and (forall ((v_prenex_1912 (Array Int Int)) (v_prenex_1910 Int) (v_prenex_1909 (Array Int Int)) (v_prenex_1913 Int) (v_prenex_1911 Int)) (let ((.cse50 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1913)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1909) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1912))) (or (= (select (select .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1911) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1911 0) (= (select (select .cse50 v_prenex_1910) v_prenex_1911) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1911)))) (forall ((v_prenex_1905 (Array Int Int)) (v_prenex_1907 (Array Int Int)) (v_prenex_1908 Int) (v_prenex_1906 Int)) (or (< v_prenex_1906 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1908)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1905) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1907) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1906)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1906))) (forall ((v_prenex_1914 (Array Int Int)) (v_prenex_1917 (Array Int Int)) (v_prenex_1918 Int) (v_prenex_1916 Int) (v_prenex_1915 Int)) (let ((.cse51 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1918)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1914) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1917))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1915) (< v_prenex_1915 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1915)) (= (select (select .cse51 v_prenex_1916) v_prenex_1915) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1943 Int) (v_prenex_1942 Int) (v_prenex_1947 (Array Int Int)) (v_prenex_1946 (Array Int Int)) (v_prenex_1945 Int) (v_prenex_1944 Int)) (let ((.cse52 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1945)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1946) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1947))) (or (< v_prenex_1943 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1943) (= (select (select .cse52 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1943) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse52 v_prenex_1944) v_prenex_1943) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse52 v_prenex_1942) v_prenex_1943))))))) (forall ((v_prenex_2046 Int) (v_prenex_2048 (Array Int Int)) (v_prenex_2049 (Array Int Int)) (v_prenex_2043 Int) (v_prenex_2044 Int) (v_prenex_2047 (Array Int Int))) (let ((.cse53 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2048) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_2046)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2047) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2049))) (or (= (select (select .cse53 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2043) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse53 v_prenex_2044) v_prenex_2043) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2043) (< v_prenex_2043 0) (= v_prenex_2044 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or (and (forall ((v_prenex_1920 Int) (v_prenex_1919 (Array Int Int)) (v_prenex_1949 Int) (v_prenex_1921 (Array Int Int)) (v_prenex_1922 Int)) (let ((.cse54 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1922)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1919) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1921))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1920) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse54 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1920)) (< v_prenex_1920 0) (= (select (select .cse54 v_prenex_1949) v_prenex_1920) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1952 Int) (v_prenex_1950 Int) (v_prenex_1948 (Array Int Int)) (v_prenex_1951 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1952)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1948) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1951) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1950)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1950) (< v_prenex_1950 0)))) .cse8) (or (and (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_1927 (Array Int Int)) (v_prenex_1929 Int) (v_prenex_1928 Int) (v_prenex_1930 (Array Int Int))) (let ((.cse55 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1927) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1930))) (or (= (select (select .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1928) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1929 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse55 v_prenex_1929) v_prenex_1928) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1928 0)))) (forall ((v_prenex_1932 Int) (v_prenex_1935 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_1934 Int) (v_prenex_1931 (Array Int Int)) (v_prenex_1933 Int)) (let ((.cse56 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1931) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1935))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse56 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1933)) (= v_prenex_1934 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse56 v_prenex_1934) v_prenex_1933) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse56 v_prenex_1932) v_prenex_1933) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1933 0)))) (forall ((v_prenex_1967 (Array Int Int)) (v_prenex_1965 Int) (v_prenex_1964 Int) (v_prenex_1968 (Array Int Int)) (v_prenex_1963 (Array Int Int))) (or (= v_prenex_1964 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1963) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1967) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1968) v_prenex_1964) v_prenex_1965) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1965 0))) (forall ((v_prenex_1923 (Array Int Int)) (v_prenex_1966 (Array Int Int)) (v_prenex_1962 Int) (v_prenex_1926 (Array Int Int)) (v_prenex_1925 Int) (v_prenex_1924 Int)) (let ((.cse57 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1966) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1923) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1926))) (or (= (select (select .cse57 v_prenex_1962) v_prenex_1925) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse57 v_prenex_1924) v_prenex_1925)) (< v_prenex_1925 0) (= v_prenex_1924 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse9))) (or (and (forall ((v_prenex_1623 Int) (v_prenex_1620 Int) (v_prenex_1619 Int) (v_prenex_1622 (Array Int Int)) (v_prenex_1643 (Array Int Int)) (v_prenex_1621 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1620) (< v_prenex_1620 0) (= v_prenex_1620 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1643) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1619)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1621) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1622) v_prenex_1623) v_prenex_1620) |c_ULTIMATE.start_main_~data_init~0#1|))) (or .cse8 (forall ((v_prenex_1644 Int) (v_prenex_1642 Int) (v_prenex_1646 (Array Int Int)) (v_prenex_1645 (Array Int Int)) (v_prenex_1647 Int)) (or (= v_prenex_1644 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1642)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1645) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1646) v_prenex_1647) v_prenex_1644)) (< v_prenex_1644 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1644))))) .cse6) (forall ((v_ArrVal_1837 Int) (v_ArrVal_1833 (Array Int Int)) (v_prenex_4 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_arrayElimCell_103 Int) (v_arrayElimCell_97 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_4)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_4) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_4) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_1833 .cse1 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) v_arrayElimCell_97) v_prenex_4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) v_arrayElimCell_103) v_prenex_4) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_4 0))) (or (and (or (and (forall ((v_prenex_1859 (Array Int Int)) (v_prenex_1861 Int) (v_prenex_1860 Int) (v_prenex_1862 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse58 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_20) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1859) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1862))) (or (= v_prenex_1861 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse58 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1860) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1860 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse58 v_prenex_1861) v_prenex_1860))))) (forall ((v_prenex_1875 Int) (v_prenex_1874 Int) (v_prenex_2022 (Array Int Int)) (v_prenex_1873 (Array Int Int)) (v_prenex_1876 (Array Int Int))) (or (= v_prenex_1874 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2022) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1873) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1876) v_prenex_1874) v_prenex_1875) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1875 0)))) .cse4) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_prenex_1880 (Array Int Int)) (v_prenex_1879 Int) (v_prenex_1877 (Array Int Int)) (v_prenex_1878 Int)) (or (< v_prenex_1879 0) (= v_prenex_1878 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1877) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1880) v_prenex_1878) v_prenex_1879) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse6) (or (and (forall ((v_prenex_2023 (Array Int Int)) (v_prenex_1870 Int) (v_prenex_1871 (Array Int Int)) (v_prenex_1872 (Array Int Int)) (v_prenex_1869 Int) (v_prenex_1868 Int)) (let ((.cse59 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2023) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1871) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1872))) (or (= v_prenex_1868 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1869 0) (= (select (select .cse59 v_prenex_1870) v_prenex_1869) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse59 v_prenex_1868) v_prenex_1869))))) (forall ((v_prenex_1852 Int) (v_prenex_1851 Int) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_1850 (Array Int Int)) (v_prenex_1853 (Array Int Int))) (or (= v_prenex_1851 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1852 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_19) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1850) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1853) v_prenex_1851) v_prenex_1852)))) (forall ((v_prenex_1855 Int) (v_prenex_1858 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_prenex_1857 Int) (v_prenex_1854 (Array Int Int)) (v_prenex_1856 Int)) (let ((.cse60 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1854) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1858))) (or (= (select (select .cse60 v_prenex_1857) v_prenex_1856) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse60 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1856) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1855 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1856 0) (= (select (select .cse60 v_prenex_1855) v_prenex_1856) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse6) (forall ((v_prenex_2024 Int) (v_prenex_2025 Int) (v_arrayElimArr_17 (Array Int Int)) (v_prenex_2027 (Array Int Int)) (v_prenex_2021 Int) (v_prenex_2028 (Array Int Int))) (let ((.cse61 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2027) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2028))) (or (= (select (select .cse61 v_prenex_2025) v_prenex_2024) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2021 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse61 v_prenex_2021) v_prenex_2024) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2024 0) (= (select (select .cse61 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2024) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2025 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_prenex_1866 Int) (v_prenex_1867 (Array Int Int)) (v_prenex_1865 Int) (v_prenex_1864 Int) (v_prenex_2026 (Array Int Int)) (v_prenex_1863 (Array Int Int))) (let ((.cse62 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2026) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1863) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1867))) (or (= (select (select .cse62 v_prenex_1864) v_prenex_1866) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1865 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse62 v_prenex_1865) v_prenex_1866) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1866 0) (= v_prenex_1864 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse9)))) is different from false [2025-02-06 10:42:47,617 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse6 (not .cse4)) (.cse9 (not .cse8))) (and (forall ((v_prenex_1976 Int) (v_prenex_60 (Array Int Int)) (v_prenex_1979 (Array Int Int)) (v_prenex_57 Int) (v_prenex_1978 Int) (v_prenex_1975 (Array Int Int)) (v_prenex_1977 Int)) (let ((.cse0 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_60) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_57)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1975) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1979))) (or (= (select (select .cse0 v_prenex_1976) v_prenex_1977) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1977 0) (= v_prenex_1978 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_prenex_1976 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse0 v_prenex_1978) v_prenex_1977)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1977) (= (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1977) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (and (forall ((v_prenex_1888 Int) (v_prenex_1889 (Array Int Int)) (v_prenex_1887 Int) (v_prenex_2036 Int) (v_prenex_1890 Int) (v_prenex_1886 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1890)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1886) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1889))) (or (= (select (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1888) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1888 0) (= (select (select .cse2 v_prenex_2036) v_prenex_1888) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse2 v_prenex_1887) v_prenex_1888)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1888) (= v_prenex_1887 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or .cse4 (forall ((v_prenex_1901 (Array Int Int)) (v_prenex_1903 (Array Int Int)) (v_prenex_1904 Int) (v_prenex_1902 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1902) (< v_prenex_1902 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1904)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1901) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1903) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1902))))) (or .cse4 (forall ((v_prenex_1898 Int) (v_prenex_1897 Int) (v_prenex_1896 (Array Int Int)) (v_prenex_1899 (Array Int Int)) (v_prenex_1900 Int)) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1900)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1896) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1899))) (or (= (select (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1897) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1897 0) (= (select (select .cse5 v_prenex_1898) v_prenex_1897) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1897))))) (or (forall ((v_prenex_2040 (Array Int Int)) (v_prenex_2035 Int) (v_prenex_2037 Int) (v_prenex_2038 Int) (v_prenex_2039 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_2038)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2039) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2040) v_prenex_2035) v_prenex_2037)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2037) (= v_prenex_2035 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_2037 0))) .cse6) (forall ((v_prenex_1895 Int) (v_prenex_1891 (Array Int Int)) (v_prenex_1893 Int) (v_prenex_1892 Int) (v_prenex_1894 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1895)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1891) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1894))) (or (= (select (select .cse7 v_prenex_1892) v_prenex_1893) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1893)) (= v_prenex_1892 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1893 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1893))))) .cse8) (or (and (forall ((v_prenex_1597 Int) (v_prenex_1593 (Array Int Int)) (v_prenex_1596 (Array Int Int)) (v_prenex_1594 Int) (v_prenex_1595 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 (select v_prenex_1593 .cse1))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1595) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1596) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1594) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1594 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1594 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1593) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1595) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1596) v_prenex_1597) v_prenex_1594)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1594))) (or .cse9 (forall ((v_prenex_1635 Int) (v_prenex_1634 Int) (v_arrayElimArr_8 (Array Int Int)) (v_prenex_1633 (Array Int Int)) (v_prenex_1632 (Array Int Int))) (or (< v_prenex_1634 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1632) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1633) v_prenex_1635) v_prenex_1634) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1634 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1634)))) (or .cse8 (forall ((v_prenex_1631 Int) (v_prenex_1598 Int) (v_prenex_1600 (Array Int Int)) (v_prenex_1599 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1631)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1599) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1600) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1598) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1598) (< v_prenex_1598 0) (= v_prenex_1598 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse4) (or (and (or (forall ((v_prenex_1586 Int) (v_prenex_1585 (Array Int Int)) (v_prenex_1583 Int) (v_prenex_1582 Int) (v_prenex_1584 (Array Int Int))) (or (= v_prenex_1583 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1582)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1584) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1585) v_prenex_1586) v_prenex_1583) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1583 0))) .cse8) (or .cse9 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_1575 Int) (v_prenex_1572 Int) (v_prenex_1574 (Array Int Int)) (v_prenex_1573 (Array Int Int)) (v_prenex_1629 Int)) (let ((.cse10 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1573) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1574))) (or (< v_prenex_1572 0) (= v_prenex_1572 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse10 v_prenex_1575) v_prenex_1572) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse10 v_prenex_1629) v_prenex_1572)))))) (forall ((v_prenex_1625 (Array Int Int)) (v_prenex_1577 Int) (v_prenex_1576 Int) (v_prenex_1581 Int) (v_prenex_1580 Int) (v_prenex_1578 (Array Int Int)) (v_prenex_1579 (Array Int Int))) (or (= v_prenex_1577 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_prenex_1625 .cse1 v_prenex_1576)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1578) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1579) v_prenex_1581) v_prenex_1577) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1576)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1578) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1577)) (< v_prenex_1577 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1625) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1576)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1578) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1579) v_prenex_1580) v_prenex_1577) |c_ULTIMATE.start_main_~data_init~0#1|))) (or (forall ((v_prenex_1624 Int) (v_prenex_1626 (Array Int Int)) (v_prenex_1630 (Array Int Int)) (v_prenex_1628 Int) (v_prenex_1627 Int)) (let ((.cse11 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1624)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1630) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1626))) (or (= (select (select .cse11 v_prenex_1627) v_prenex_1628) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1628) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1628 0) (= v_prenex_1628 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) .cse8) (forall ((v_prenex_1590 (Array Int Int)) (v_prenex_1589 Int) (v_prenex_1587 Int) (v_prenex_1591 (Array Int Int)) (v_prenex_1592 Int) (v_prenex_1588 (Array Int Int))) (or (< v_prenex_1589 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1588) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1587)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1590) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1591) v_prenex_1592) v_prenex_1589)) (= v_prenex_1589 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) .cse6) (or (forall ((v_prenex_1657 Int) (v_prenex_1654 Int) (v_prenex_1653 Int) (v_prenex_1655 (Array Int Int)) (v_prenex_1656 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1653)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1655) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1656))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1654) (= (select (select .cse12 v_prenex_1657) v_prenex_1654) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1654 0) (= v_prenex_1654 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1654))))) .cse8) (or (and (or .cse4 (forall ((v_prenex_1846 (Array Int Int)) (v_prenex_1848 (Array Int Int)) (v_prenex_1849 Int) (v_prenex_1847 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1849)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1848) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1847) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1847 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1847)))) (forall ((v_prenex_2017 Int) (v_prenex_2018 Int) (v_prenex_2020 Int) (v_prenex_2016 (Array Int Int)) (v_prenex_2019 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_2020)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2016) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2019))) (or (= v_prenex_2017 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse13 v_prenex_2017) v_prenex_2018) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2018) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2018) (< v_prenex_2018 0))))) .cse8) (or .cse8 (forall ((v_prenex_2013 Int) (v_prenex_2015 Int) (v_prenex_2010 (Array Int Int)) (v_prenex_2011 Int) (v_prenex_2014 (Array Int Int)) (v_prenex_2012 Int)) (let ((.cse14 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_2015)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2010) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2014))) (or (= v_prenex_2011 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse14 v_prenex_2011) v_prenex_2012) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2012 0) (= (select (select .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2012) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2013 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse14 v_prenex_2013) v_prenex_2012) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2012))))) (or (and (or .cse8 (forall ((v_prenex_1885 Int) (v_prenex_1883 Int) (v_prenex_1882 Int) (v_prenex_1881 (Array Int Int)) (v_prenex_1884 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1885)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1881) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1884) v_prenex_1882) v_prenex_1883) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1883 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1883) (= v_prenex_1882 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_prenex_2030 (Array Int Int)) (v_prenex_2033 (Array Int Int)) (v_prenex_2031 Int) (v_prenex_2032 Int) (v_prenex_2034 Int) (v_prenex_2029 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2030) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_2034)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2029) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2033) v_prenex_2031) v_prenex_2032) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2032) (= v_prenex_2031 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_2032 0)))) .cse6) (or .cse4 (and (forall ((v_prenex_2003 Int) (v_prenex_2002 (Array Int Int)) (v_prenex_2000 Int) (v_prenex_2001 Int) (v_prenex_1998 (Array Int Int)) (v_prenex_1997 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1998) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_2003)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1997) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2002))) (or (< v_prenex_2000 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2000) (= (select (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2000) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse15 v_prenex_2001) v_prenex_2000)) (= v_prenex_2001 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or (forall ((v_prenex_1844 Int) (v_prenex_1999 (Array Int Int)) (v_prenex_1845 (Array Int Int)) (v_prenex_1843 Int) (v_prenex_1842 (Array Int Int))) (or (= v_prenex_1843 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1844 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1844) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1999) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1845) v_prenex_1843) v_prenex_1844)))) .cse9))) (or (and (or (forall ((v_prenex_1822 Int) (v_prenex_1823 (Array Int Int)) (v_prenex_1821 Int) (v_prenex_1990 Int) (v_prenex_1820 (Array Int Int)) (v_prenex_1824 Int)) (let ((.cse16 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1824)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1820) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1823))) (or (= v_prenex_1821 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1822) (= (select (select .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1822) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse16 v_prenex_1821) v_prenex_1822) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse16 v_prenex_1990) v_prenex_1822) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1822 0)))) .cse8) (or .cse8 (forall ((v_prenex_1825 (Array Int Int)) (v_prenex_1828 (Array Int Int)) (v_prenex_1829 Int) (v_prenex_1827 Int) (v_prenex_1826 Int)) (or (< v_prenex_1827 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1827) (= v_prenex_1826 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1829)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1825) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1828) v_prenex_1826) v_prenex_1827) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1815 (Array Int Int)) (v_prenex_1818 (Array Int Int)) (v_prenex_1819 Int) (v_prenex_1817 Int) (v_prenex_1816 Int) (v_prenex_1995 (Array Int Int))) (or (= v_prenex_1816 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1817 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1995) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1819)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1815) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1818) v_prenex_1816) v_prenex_1817) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1817))) (or .cse8 (forall ((v_prenex_1993 Int) (v_prenex_1992 Int) (v_prenex_1994 (Array Int Int)) (v_prenex_1996 (Array Int Int)) (v_prenex_1989 Int)) (let ((.cse17 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1993)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1994) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1996))) (or (= (select (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1992) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1992 0) (= v_prenex_1989 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse17 v_prenex_1989) v_prenex_1992)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1992))))) (or .cse9 (forall ((v_prenex_1837 (Array Int Int)) (v_prenex_1840 Int) (v_prenex_1991 (Array Int Int)) (v_prenex_1839 Int) (v_prenex_1838 Int) (v_prenex_1841 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1991) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1841))) (or (= v_prenex_1838 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse18 v_prenex_1840) v_prenex_1839) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse18 v_prenex_1838) v_prenex_1839) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1839) (< v_prenex_1839 0))))) (forall ((v_prenex_1835 (Array Int Int)) (v_prenex_1833 Int) (v_prenex_1832 Int) (v_prenex_1831 (Array Int Int)) (v_prenex_1836 Int) (v_prenex_1830 (Array Int Int)) (v_prenex_1834 Int)) (let ((.cse19 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1836)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1830) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1835))) (or (< v_prenex_1833 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1833) (= (select (select .cse19 v_prenex_1832) v_prenex_1833) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse19 v_prenex_1834) v_prenex_1833) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1833) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1832 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse6) (or (and (or (and (forall ((v_prenex_1756 Int) (v_prenex_1757 (Array Int Int)) (v_prenex_1755 Int) (v_prenex_1780 Int) (v_prenex_1754 (Array Int Int)) (v_prenex_1758 Int)) (let ((.cse20 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1758)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1754) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1757))) (or (= (select (select .cse20 v_prenex_1780) v_prenex_1756) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse20 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1756)) (< v_prenex_1756 0) (= v_prenex_1755 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse20 v_prenex_1755) v_prenex_1756) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1782 Int) (v_prenex_1783 (Array Int Int)) (v_prenex_1781 Int) (v_prenex_1784 (Array Int Int)) (v_prenex_1779 Int)) (or (= v_prenex_1779 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1781 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1782)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1783) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1784) v_prenex_1779) v_prenex_1781) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_1759 (Array Int Int)) (v_prenex_1763 Int) (v_prenex_1761 Int) (v_prenex_1760 Int) (v_prenex_1762 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1763)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1759) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1762))) (or (< v_prenex_1761 0) (= (select (select .cse21 v_prenex_1760) v_prenex_1761) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1761) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1760 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse8) (forall ((v_prenex_1796 Int) (v_prenex_1792 (Array Int Int)) (v_prenex_1794 Int) (v_prenex_1791 (Array Int Int)) (v_prenex_1793 Int) (v_prenex_1795 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1792) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1796)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1791) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1795) v_prenex_1793) v_prenex_1794) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1794 0) (= v_prenex_1793 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (forall ((v_prenex_1799 Int) (v_prenex_1798 Int) (v_prenex_1797 (Array Int Int)) (v_prenex_1800 (Array Int Int)) (v_prenex_1801 Int)) (or (= v_prenex_1798 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1801)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1797) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1800) v_prenex_1798) v_prenex_1799) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1799 0))) .cse8) (or .cse8 (forall ((v_prenex_1778 Int) (v_prenex_1776 Int) (v_prenex_1775 Int) (v_prenex_1774 (Array Int Int)) (v_prenex_1777 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1778)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1774) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1777))) (or (< v_prenex_1776 0) (= v_prenex_1775 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse22 v_prenex_1775) v_prenex_1776) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse22 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1776) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (forall ((v_prenex_1769 (Array Int Int)) (v_prenex_1985 Int) (v_prenex_1772 Int) (v_prenex_1771 Int) (v_prenex_1770 Int) (v_prenex_1773 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1985)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1769) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1773))) (or (= (select (select .cse23 v_prenex_1772) v_prenex_1771) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1772 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1771 0) (= (select (select .cse23 v_prenex_1770) v_prenex_1771) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1770 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1771) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse8) (or (forall ((v_prenex_1988 (Array Int Int)) (v_prenex_1982 Int) (v_prenex_1981 Int) (v_prenex_1980 Int) (v_prenex_1984 (Array Int Int)) (v_prenex_1986 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1984) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1986) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1988))) (or (= (select (select .cse24 v_prenex_1981) v_prenex_1982) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1980 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse24 v_prenex_1980) v_prenex_1982)) (= v_prenex_1981 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1982 0)))) .cse9) (or .cse9 (forall ((v_prenex_1767 Int) (v_prenex_1766 Int) (v_prenex_1768 (Array Int Int)) (v_prenex_1765 Int) (v_prenex_1983 (Array Int Int)) (v_prenex_1764 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1983) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1764) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1768))) (or (< v_prenex_1766 0) (= (select (select .cse25 v_prenex_1767) v_prenex_1766) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1765 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse25 v_prenex_1765) v_prenex_1766) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse8 (forall ((v_prenex_1802 (Array Int Int)) (v_prenex_1806 (Array Int Int)) (v_prenex_1807 Int) (v_prenex_1805 Int) (v_prenex_1804 Int) (v_prenex_1803 Int)) (let ((.cse26 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1807)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1802) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1806))) (or (< v_prenex_1804 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse26 v_prenex_1803) v_prenex_1804)) (= v_prenex_1803 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1804) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse26 v_prenex_1805) v_prenex_1804) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((v_prenex_1813 (Array Int Int)) (v_prenex_1811 Int) (v_prenex_1810 Int) (v_prenex_1808 (Array Int Int)) (v_prenex_1809 (Array Int Int)) (v_prenex_1814 Int) (v_prenex_1812 Int)) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1809) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1814)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1808) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1813))) (or (= (select (select .cse27 v_prenex_1812) v_prenex_1811) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1810 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1811 0) (= (select (select .cse27 v_prenex_1810) v_prenex_1811) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1811) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1788 Int) (v_prenex_1787 Int) (v_prenex_1786 Int) (v_prenex_1785 (Array Int Int)) (v_prenex_1790 Int) (v_prenex_1987 (Array Int Int)) (v_prenex_1789 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1987) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1790)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1785) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1789))) (or (< v_prenex_1787 0) (= (select (select .cse28 v_prenex_1788) v_prenex_1787) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse28 v_prenex_1786) v_prenex_1787)) (= v_prenex_1786 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1787) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1788 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse6) (or (and (or (and (forall ((v_prenex_1704 (Array Int Int)) (v_prenex_1707 (Array Int Int)) (v_prenex_1708 (Array Int Int)) (v_prenex_1706 Int) (v_prenex_1705 Int) (v_prenex_1703 Int)) (let ((.cse29 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1704) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1707) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1708))) (or (< v_prenex_1705 0) (= v_prenex_1703 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse29 v_prenex_1703) v_prenex_1705) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse29 v_prenex_1706) v_prenex_1705) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_prenex_1684 Int) (v_prenex_1681 (Array Int Int)) (v_prenex_1683 Int) (v_prenex_1682 Int) (v_prenex_1685 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1681) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1685))) (or (= (select (select .cse30 v_prenex_1682) v_prenex_1683) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1683) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1682 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse30 v_prenex_1684) v_prenex_1683)) (< v_prenex_1683 0)))) (forall ((v_prenex_1679 Int) (v_prenex_1678 Int) (v_arrayElimArr_24 (Array Int Int)) (v_prenex_1680 (Array Int Int)) (v_prenex_1677 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1677) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1680) v_prenex_1678) v_prenex_1679) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1678 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1679 0)))) .cse6) (or (forall ((v_arrayElimArr_33 (Array Int Int)) (v_prenex_1711 Int) (v_prenex_1710 Int) (v_prenex_1709 (Array Int Int)) (v_prenex_1712 (Array Int Int))) (or (= v_prenex_1710 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1711) (< v_prenex_1711 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_33) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1709) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1712) v_prenex_1710) v_prenex_1711) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse6) (or (and (forall ((v_arrayElimArr_35 (Array Int Int)) (v_prenex_1741 Int) (v_prenex_1743 (Array Int Int)) (v_prenex_1738 Int) (v_prenex_1742 (Array Int Int))) (or (< v_prenex_1741 0) (= v_prenex_1738 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1741) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_35) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1742) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1743) v_prenex_1738) v_prenex_1741) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_1701 Int) (v_prenex_1702 (Array Int Int)) (v_prenex_1700 Int) (v_prenex_1699 Int) (v_prenex_1740 (Array Int Int)) (v_prenex_1698 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1740) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1698) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1702))) (or (< v_prenex_1700 0) (= v_prenex_1699 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1700) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse31 v_prenex_1701) v_prenex_1700)) (= (select (select .cse31 v_prenex_1699) v_prenex_1700) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_arrayElimArr_36 (Array Int Int)) (v_prenex_1696 Int) (v_prenex_1695 Int) (v_prenex_1694 (Array Int Int)) (v_prenex_1697 (Array Int Int)) (v_prenex_1739 Int)) (let ((.cse32 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1694) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1697))) (or (= (select (select .cse32 v_prenex_1695) v_prenex_1696) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1696) (< v_prenex_1696 0) (= v_prenex_1695 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse32 v_prenex_1739) v_prenex_1696) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse32 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1696) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse6) (forall ((v_prenex_1727 (Array Int Int)) (v_prenex_1730 Int) (v_prenex_1729 Int) (v_prenex_1728 Int) (v_prenex_1732 (Array Int Int)) (v_prenex_1731 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1731) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1727) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1732))) (or (< v_prenex_1730 0) (= v_prenex_1729 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse33 v_prenex_1728) v_prenex_1730) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1728 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse33 v_prenex_1729) v_prenex_1730) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_prenex_1713 (Array Int Int)) (v_prenex_1717 (Array Int Int)) (v_prenex_1716 Int) (v_prenex_1715 Int) (v_prenex_1714 Int)) (let ((.cse34 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_22) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1713) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1717))) (or (= v_prenex_1716 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse34 v_prenex_1714) v_prenex_1715)) (= v_prenex_1714 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1715) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse34 v_prenex_1716) v_prenex_1715) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1715 0)))) (forall ((v_prenex_1745 Int) (v_prenex_1749 (Array Int Int)) (v_prenex_1748 (Array Int Int)) (v_prenex_1747 Int) (v_prenex_1744 (Array Int Int)) (v_prenex_1746 Int)) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1748) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1744) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1749))) (or (= v_prenex_1745 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1747) (< v_prenex_1747 0) (= (select (select .cse35 v_prenex_1745) v_prenex_1747) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1746 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse35 v_prenex_1746) v_prenex_1747))))) (or (forall ((v_arrayElimArr_26 (Array Int Int)) (v_prenex_1752 Int) (v_prenex_1751 Int) (v_prenex_1750 (Array Int Int)) (v_prenex_1753 (Array Int Int))) (or (< v_prenex_1752 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_26) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1750) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1753) v_prenex_1751) v_prenex_1752)) (= v_prenex_1751 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse6) (or .cse4 (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_prenex_1720 Int) (v_prenex_1718 (Array Int Int)) (v_prenex_1719 Int) (v_prenex_1721 (Array Int Int))) (or (< v_prenex_1720 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1720) (= v_prenex_1719 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1718) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1721) v_prenex_1719) v_prenex_1720)))) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_prenex_1688 Int) (v_prenex_1687 Int) (v_prenex_1686 (Array Int Int)) (v_prenex_1689 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1686) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1689))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1687) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1687)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 v_prenex_1688) v_prenex_1687)) (< v_prenex_1687 0) (= v_prenex_1688 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (or .cse4 (and (forall ((v_prenex_1726 (Array Int Int)) (v_prenex_1723 (Array Int Int)) (v_prenex_1725 Int) (v_prenex_1722 (Array Int Int)) (v_prenex_1724 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1723) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1722) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1726) v_prenex_1724) v_prenex_1725) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1725 0) (= v_prenex_1724 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_arrayElimArr_25 (Array Int Int)) (v_prenex_1690 (Array Int Int)) (v_prenex_1693 (Array Int Int)) (v_prenex_1692 Int) (v_prenex_1691 Int)) (let ((.cse37 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1690) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1693))) (or (= (select (select .cse37 v_prenex_1692) v_prenex_1691) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1691 0) (= v_prenex_1692 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1691) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (and (forall ((v_prenex_1658 (Array Int Int)) (v_prenex_1660 Int) (v_prenex_1661 (Array Int Int)) (v_prenex_1659 Int) (v_arrayElimArr_31 (Array Int Int))) (or (< v_prenex_1660 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_31) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1658) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1661) v_prenex_1659) v_prenex_1660)) (= v_prenex_1659 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_prenex_1665 Int) (v_prenex_1664 Int) (v_prenex_1663 Int) (v_arrayElimArr_14 (Array Int Int)) (v_prenex_1662 (Array Int Int)) (v_prenex_1666 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1662) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1666))) (or (= v_prenex_1664 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse38 v_prenex_1664) v_prenex_1665) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1663 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1665 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse38 v_prenex_1663) v_prenex_1665))))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_prenex_1675 Int) (v_prenex_1674 Int) (v_prenex_1673 Int) (v_prenex_1672 (Array Int Int)) (v_prenex_1676 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1672) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1676))) (or (= v_prenex_1673 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse39 v_prenex_1673) v_prenex_1674) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1674 0) (= (select (select .cse39 v_prenex_1675) v_prenex_1674) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1668 Int) (v_prenex_1671 (Array Int Int)) (v_prenex_1670 Int) (v_arrayElimArr_30 (Array Int Int)) (v_prenex_1667 (Array Int Int)) (v_prenex_1669 Int)) (let ((.cse40 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1667) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1671))) (or (= (select (select .cse40 v_prenex_1670) v_prenex_1669) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1669 0) (= v_prenex_1668 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1669)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse40 v_prenex_1668) v_prenex_1669))))) (forall ((v_prenex_61 (Array Int Int)) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_36| Int) (v_prenex_63 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (let ((.cse41 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_61) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_63))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_95) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 v_arrayElimCell_96) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_36| 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 v_arrayElimCell_95) |v_ULTIMATE.start_main_~ptr~0#1.offset_36|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimCell_96))))) .cse6) (forall ((v_prenex_1734 Int) (v_arrayElimArr_34 (Array Int Int)) (v_prenex_1737 (Array Int Int)) (v_prenex_1736 Int) (v_prenex_1733 (Array Int Int)) (v_prenex_1735 Int)) (let ((.cse42 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_34) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1733) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1737))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 v_prenex_1734) v_prenex_1735)) (= v_prenex_1734 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1735)) (= (select (select .cse42 v_prenex_1736) v_prenex_1735) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1736 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1735 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1735))))) .cse9) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_1649 (Array Int Int)) (v_prenex_1652 Int) (v_prenex_1651 Int) (v_prenex_1650 (Array Int Int)) (v_prenex_1648 Int)) (let ((.cse43 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1649) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1650))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse43 v_prenex_1652) v_prenex_1648)) (= v_prenex_1648 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1648) (= (select (select .cse43 v_prenex_1651) v_prenex_1648) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1648 0)))) .cse9) (or (and (or (and (forall ((v_prenex_1604 (Array Int Int)) (v_prenex_1602 Int) (v_prenex_1603 (Array Int Int)) (v_prenex_1605 Int) (v_prenex_1601 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1601) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1603) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1604) v_prenex_1605) v_prenex_1602) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1602 0) (= v_prenex_1602 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_prenex_1637 (Array Int Int)) (v_prenex_1636 (Array Int Int)) (v_prenex_1640 Int) (v_prenex_1641 (Array Int Int)) (v_prenex_1639 Int)) (or (< v_prenex_1639 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 (select v_prenex_1636 .cse1))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1641) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1637) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1639) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1639 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1636) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1641) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1637) v_prenex_1640) v_prenex_1639) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse4) (forall ((v_prenex_1613 Int) (v_prenex_1610 Int) (v_arrayElimArr_27 (Array Int Int)) (v_prenex_1611 (Array Int Int)) (v_prenex_1612 (Array Int Int)) (v_prenex_1614 Int)) (let ((.cse44 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_27) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1611) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1612))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse44 v_prenex_1614) v_prenex_1610)) (= v_prenex_1610 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse44 v_prenex_1613) v_prenex_1610)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 (select v_arrayElimArr_27 .cse1))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1611) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1612) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1610) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1610 0)))) (or (forall ((v_prenex_1617 (Array Int Int)) (v_prenex_1616 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_prenex_1618 Int) (v_prenex_1615 Int)) (or (= v_prenex_1615 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1616) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1617) v_prenex_1618) v_prenex_1615) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1615 0))) .cse6) (forall ((v_prenex_1608 (Array Int Int)) (v_prenex_1607 (Array Int Int)) (v_prenex_1609 Int) (v_prenex_1606 Int) (v_prenex_1638 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse45 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1607) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1608))) (or (< v_prenex_1606 0) (= (select (select .cse45 v_prenex_1638) v_prenex_1606) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse45 v_prenex_1609) v_prenex_1606) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1606 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse9) (or (forall ((v_prenex_2006 Int) (v_prenex_2007 Int) (v_prenex_2005 Int) (v_prenex_2004 (Array Int Int)) (v_prenex_2008 (Array Int Int)) (v_prenex_2009 (Array Int Int))) (let ((.cse46 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2008) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2004) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2009))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2007) (< v_prenex_2007 0) (= v_prenex_2005 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse46 v_prenex_2006) v_prenex_2007)) (= (select (select .cse46 v_prenex_2005) v_prenex_2007) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2006 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse9) (or .cse4 (and (or (forall ((v_prenex_1974 Int) (v_prenex_1969 (Array Int Int)) (v_prenex_1972 Int) (v_prenex_1971 Int) (v_prenex_1970 Int) (v_prenex_1973 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1974)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1969) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1973))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1971) (= (select (select .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1971) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse47 v_prenex_1970) v_prenex_1971)) (= (select (select .cse47 v_prenex_1972) v_prenex_1971) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1972 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1971 0)))) .cse8) (forall ((v_prenex_1941 Int) (v_prenex_1936 (Array Int Int)) (v_prenex_1937 (Array Int Int)) (v_prenex_1939 Int) (v_prenex_1938 Int) (v_prenex_1940 (Array Int Int)) (v_prenex_2041 Int)) (let ((.cse48 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1937) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1941)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1936) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1940))) (or (= v_prenex_1939 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1938) (= (select (select .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1938) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse48 v_prenex_2041) v_prenex_1938) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse48 v_prenex_1939) v_prenex_1938) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1938 0)))) (or .cse9 (forall ((v_prenex_1954 Int) (v_prenex_1957 (Array Int Int)) (v_prenex_2045 (Array Int Int)) (v_prenex_1956 Int) (v_prenex_1953 (Array Int Int)) (v_prenex_1955 Int)) (let ((.cse49 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2045) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1953) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1957))) (or (< v_prenex_1956 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1956) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse49 v_prenex_1955) v_prenex_1956)) (= v_prenex_1955 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse49 v_prenex_1954) v_prenex_1956) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (forall ((v_prenex_1958 (Array Int Int)) (v_prenex_1960 Int) (v_prenex_2042 (Array Int Int)) (v_prenex_1961 (Array Int Int)) (v_prenex_1959 Int)) (or (= v_prenex_1959 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2042) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1958) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1961) v_prenex_1959) v_prenex_1960) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1960 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1960))) .cse9) (or .cse8 (and (forall ((v_prenex_1912 (Array Int Int)) (v_prenex_1910 Int) (v_prenex_1909 (Array Int Int)) (v_prenex_1913 Int) (v_prenex_1911 Int)) (let ((.cse50 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1913)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1909) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1912))) (or (= (select (select .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1911) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1911 0) (= (select (select .cse50 v_prenex_1910) v_prenex_1911) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1911)))) (forall ((v_prenex_1905 (Array Int Int)) (v_prenex_1907 (Array Int Int)) (v_prenex_1908 Int) (v_prenex_1906 Int)) (or (< v_prenex_1906 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1908)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1905) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1907) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1906)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1906))) (forall ((v_prenex_1914 (Array Int Int)) (v_prenex_1917 (Array Int Int)) (v_prenex_1918 Int) (v_prenex_1916 Int) (v_prenex_1915 Int)) (let ((.cse51 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1918)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1914) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1917))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1915) (< v_prenex_1915 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1915)) (= (select (select .cse51 v_prenex_1916) v_prenex_1915) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1943 Int) (v_prenex_1942 Int) (v_prenex_1947 (Array Int Int)) (v_prenex_1946 (Array Int Int)) (v_prenex_1945 Int) (v_prenex_1944 Int)) (let ((.cse52 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1945)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1946) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1947))) (or (< v_prenex_1943 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1943) (= (select (select .cse52 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1943) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse52 v_prenex_1944) v_prenex_1943) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse52 v_prenex_1942) v_prenex_1943))))))) (forall ((v_prenex_2046 Int) (v_prenex_2048 (Array Int Int)) (v_prenex_2049 (Array Int Int)) (v_prenex_2043 Int) (v_prenex_2044 Int) (v_prenex_2047 (Array Int Int))) (let ((.cse53 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2048) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_2046)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2047) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2049))) (or (= (select (select .cse53 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2043) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse53 v_prenex_2044) v_prenex_2043) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2043) (< v_prenex_2043 0) (= v_prenex_2044 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or (and (forall ((v_prenex_1920 Int) (v_prenex_1919 (Array Int Int)) (v_prenex_1949 Int) (v_prenex_1921 (Array Int Int)) (v_prenex_1922 Int)) (let ((.cse54 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1922)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1919) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1921))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1920) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse54 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1920)) (< v_prenex_1920 0) (= (select (select .cse54 v_prenex_1949) v_prenex_1920) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1952 Int) (v_prenex_1950 Int) (v_prenex_1948 (Array Int Int)) (v_prenex_1951 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1952)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1948) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1951) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1950)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1950) (< v_prenex_1950 0)))) .cse8) (or (and (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_1927 (Array Int Int)) (v_prenex_1929 Int) (v_prenex_1928 Int) (v_prenex_1930 (Array Int Int))) (let ((.cse55 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1927) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1930))) (or (= (select (select .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1928) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1929 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse55 v_prenex_1929) v_prenex_1928) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1928 0)))) (forall ((v_prenex_1932 Int) (v_prenex_1935 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_1934 Int) (v_prenex_1931 (Array Int Int)) (v_prenex_1933 Int)) (let ((.cse56 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1931) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1935))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse56 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1933)) (= v_prenex_1934 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse56 v_prenex_1934) v_prenex_1933) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse56 v_prenex_1932) v_prenex_1933) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1933 0)))) (forall ((v_prenex_1967 (Array Int Int)) (v_prenex_1965 Int) (v_prenex_1964 Int) (v_prenex_1968 (Array Int Int)) (v_prenex_1963 (Array Int Int))) (or (= v_prenex_1964 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1963) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1967) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1968) v_prenex_1964) v_prenex_1965) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1965 0))) (forall ((v_prenex_1923 (Array Int Int)) (v_prenex_1966 (Array Int Int)) (v_prenex_1962 Int) (v_prenex_1926 (Array Int Int)) (v_prenex_1925 Int) (v_prenex_1924 Int)) (let ((.cse57 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1966) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1923) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1926))) (or (= (select (select .cse57 v_prenex_1962) v_prenex_1925) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse57 v_prenex_1924) v_prenex_1925)) (< v_prenex_1925 0) (= v_prenex_1924 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse9))) (or (and (forall ((v_prenex_1623 Int) (v_prenex_1620 Int) (v_prenex_1619 Int) (v_prenex_1622 (Array Int Int)) (v_prenex_1643 (Array Int Int)) (v_prenex_1621 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1620) (< v_prenex_1620 0) (= v_prenex_1620 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1643) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_prenex_1619)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1621) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1622) v_prenex_1623) v_prenex_1620) |c_ULTIMATE.start_main_~data_init~0#1|))) (or .cse8 (forall ((v_prenex_1644 Int) (v_prenex_1642 Int) (v_prenex_1646 (Array Int Int)) (v_prenex_1645 (Array Int Int)) (v_prenex_1647 Int)) (or (= v_prenex_1644 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_prenex_1642)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1645) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1646) v_prenex_1647) v_prenex_1644)) (< v_prenex_1644 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1644))))) .cse6) (forall ((v_ArrVal_1837 Int) (v_ArrVal_1833 (Array Int Int)) (v_prenex_4 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_arrayElimCell_103 Int) (v_arrayElimCell_97 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_4)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_4) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_4) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_1833 .cse1 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) v_arrayElimCell_97) v_prenex_4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) v_arrayElimCell_103) v_prenex_4) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_4 0))) (or (and (or (and (forall ((v_prenex_1859 (Array Int Int)) (v_prenex_1861 Int) (v_prenex_1860 Int) (v_prenex_1862 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse58 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_20) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1859) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1862))) (or (= v_prenex_1861 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse58 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1860) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1860 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse58 v_prenex_1861) v_prenex_1860))))) (forall ((v_prenex_1875 Int) (v_prenex_1874 Int) (v_prenex_2022 (Array Int Int)) (v_prenex_1873 (Array Int Int)) (v_prenex_1876 (Array Int Int))) (or (= v_prenex_1874 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2022) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1873) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1876) v_prenex_1874) v_prenex_1875) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1875 0)))) .cse4) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_prenex_1880 (Array Int Int)) (v_prenex_1879 Int) (v_prenex_1877 (Array Int Int)) (v_prenex_1878 Int)) (or (< v_prenex_1879 0) (= v_prenex_1878 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1877) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1880) v_prenex_1878) v_prenex_1879) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse6) (or (and (forall ((v_prenex_2023 (Array Int Int)) (v_prenex_1870 Int) (v_prenex_1871 (Array Int Int)) (v_prenex_1872 (Array Int Int)) (v_prenex_1869 Int) (v_prenex_1868 Int)) (let ((.cse59 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2023) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1871) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1872))) (or (= v_prenex_1868 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1869 0) (= (select (select .cse59 v_prenex_1870) v_prenex_1869) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse59 v_prenex_1868) v_prenex_1869))))) (forall ((v_prenex_1852 Int) (v_prenex_1851 Int) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_1850 (Array Int Int)) (v_prenex_1853 (Array Int Int))) (or (= v_prenex_1851 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1852 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_19) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1850) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1853) v_prenex_1851) v_prenex_1852)))) (forall ((v_prenex_1855 Int) (v_prenex_1858 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_prenex_1857 Int) (v_prenex_1854 (Array Int Int)) (v_prenex_1856 Int)) (let ((.cse60 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1854) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1858))) (or (= (select (select .cse60 v_prenex_1857) v_prenex_1856) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse60 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1856) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1855 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1856 0) (= (select (select .cse60 v_prenex_1855) v_prenex_1856) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse6) (forall ((v_prenex_2024 Int) (v_prenex_2025 Int) (v_arrayElimArr_17 (Array Int Int)) (v_prenex_2027 (Array Int Int)) (v_prenex_2021 Int) (v_prenex_2028 (Array Int Int))) (let ((.cse61 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2027) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2028))) (or (= (select (select .cse61 v_prenex_2025) v_prenex_2024) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2021 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse61 v_prenex_2021) v_prenex_2024) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2024 0) (= (select (select .cse61 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2024) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2025 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_prenex_1866 Int) (v_prenex_1867 (Array Int Int)) (v_prenex_1865 Int) (v_prenex_1864 Int) (v_prenex_2026 (Array Int Int)) (v_prenex_1863 (Array Int Int))) (let ((.cse62 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2026) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1863) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1867))) (or (= (select (select .cse62 v_prenex_1864) v_prenex_1866) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1865 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse62 v_prenex_1865) v_prenex_1866) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1866 0) (= v_prenex_1864 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse9)))) is different from true