./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:59:47,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:59:47,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 14:59:47,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:59:47,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:59:47,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:59:47,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:59:47,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:59:47,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:59:47,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:59:47,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:59:47,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:59:47,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:59:47,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:59:47,978 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:59:47,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:59:47,980 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:59:47,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:59:47,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:59:47,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:59:47,981 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:59:47,981 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:59:47,981 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:59:47,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:59:47,982 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:59:47,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:59:47,982 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:59:47,982 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:59:47,982 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:59:47,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:59:47,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:59:47,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:59:47,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:59:47,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:59:47,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:59:47,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:59:47,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:59:47,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:59:47,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:59:47,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:59:47,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:59:47,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:59:47,986 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2024-11-20 14:59:48,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:59:48,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:59:48,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:59:48,211 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:59:48,211 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:59:48,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-11-20 14:59:49,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:59:49,585 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:59:49,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-11-20 14:59:49,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571787cbc/73edf600b554424c9e9ed302b6fddd93/FLAG02918d353 [2024-11-20 14:59:49,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571787cbc/73edf600b554424c9e9ed302b6fddd93 [2024-11-20 14:59:49,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:59:49,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:59:49,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:59:49,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:59:49,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:59:49,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:59:49" (1/1) ... [2024-11-20 14:59:49,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3024c808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49, skipping insertion in model container [2024-11-20 14:59:49,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:59:49" (1/1) ... [2024-11-20 14:59:49,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:59:49,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:59:49,882 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:59:49,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:59:49,936 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:59:49,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49 WrapperNode [2024-11-20 14:59:49,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:59:49,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:59:49,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:59:49,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:59:49,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49" (1/1) ... [2024-11-20 14:59:49,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49" (1/1) ... [2024-11-20 14:59:49,969 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 133 [2024-11-20 14:59:49,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:59:49,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:59:49,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:59:49,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:59:49,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49" (1/1) ... [2024-11-20 14:59:49,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49" (1/1) ... [2024-11-20 14:59:49,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49" (1/1) ... [2024-11-20 14:59:49,994 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 6 writes are split as follows [6]. [2024-11-20 14:59:49,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49" (1/1) ... [2024-11-20 14:59:49,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49" (1/1) ... [2024-11-20 14:59:50,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49" (1/1) ... [2024-11-20 14:59:50,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49" (1/1) ... [2024-11-20 14:59:50,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49" (1/1) ... [2024-11-20 14:59:50,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49" (1/1) ... [2024-11-20 14:59:50,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:59:50,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:59:50,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:59:50,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:59:50,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49" (1/1) ... [2024-11-20 14:59:50,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:59:50,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:59:50,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 14:59:50,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 14:59:50,067 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-20 14:59:50,067 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-20 14:59:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:59:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 14:59:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:59:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:59:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:59:50,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:59:50,140 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:59:50,142 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:59:50,173 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-20 14:59:50,421 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-20 14:59:50,421 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:59:50,438 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:59:50,439 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 14:59:50,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:59:50 BoogieIcfgContainer [2024-11-20 14:59:50,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:59:50,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:59:50,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:59:50,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:59:50,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:59:49" (1/3) ... [2024-11-20 14:59:50,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a25837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:59:50, skipping insertion in model container [2024-11-20 14:59:50,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:59:49" (2/3) ... [2024-11-20 14:59:50,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a25837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:59:50, skipping insertion in model container [2024-11-20 14:59:50,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:59:50" (3/3) ... [2024-11-20 14:59:50,445 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2024-11-20 14:59:50,458 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:59:50,458 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2024-11-20 14:59:50,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:59:50,507 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;@519f6dee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:59:50,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-20 14:59:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 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) [2024-11-20 14:59:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 14:59:50,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:50,517 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 14:59:50,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:50,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:50,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-20 14:59:50,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:50,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697456763] [2024-11-20 14:59:50,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:50,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:50,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:50,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697456763] [2024-11-20 14:59:50,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697456763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:59:50,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:59:50,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:59:50,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419001094] [2024-11-20 14:59:50,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:59:50,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:59:50,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:50,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:59:50,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:59:50,718 INFO L87 Difference]: Start difference. First operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 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) [2024-11-20 14:59:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:50,814 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2024-11-20 14:59:50,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:59:50,816 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 [2024-11-20 14:59:50,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:50,821 INFO L225 Difference]: With dead ends: 136 [2024-11-20 14:59:50,821 INFO L226 Difference]: Without dead ends: 130 [2024-11-20 14:59:50,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:59:50,825 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 17 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:50,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 206 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:59:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-20 14:59:50,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-20 14:59:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 129 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2024-11-20 14:59:50,851 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 4 [2024-11-20 14:59:50,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:50,851 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2024-11-20 14:59:50,851 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) [2024-11-20 14:59:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2024-11-20 14:59:50,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 14:59:50,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:50,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 14:59:50,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:59:50,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:50,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:50,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-20 14:59:50,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:50,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297700484] [2024-11-20 14:59:50,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:50,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:50,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:50,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297700484] [2024-11-20 14:59:50,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297700484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:59:50,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:59:50,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:59:50,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495689790] [2024-11-20 14:59:50,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:59:50,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:59:50,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:50,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:59:50,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:59:50,935 INFO L87 Difference]: Start difference. First operand 130 states and 135 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) [2024-11-20 14:59:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:50,970 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2024-11-20 14:59:50,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:59:50,970 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 [2024-11-20 14:59:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:50,971 INFO L225 Difference]: With dead ends: 127 [2024-11-20 14:59:50,971 INFO L226 Difference]: Without dead ends: 127 [2024-11-20 14:59:50,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:59:50,972 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 15 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:50,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 228 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:59:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-20 14:59:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-20 14:59:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2024-11-20 14:59:50,979 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 4 [2024-11-20 14:59:50,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:50,979 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2024-11-20 14:59:50,979 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) [2024-11-20 14:59:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2024-11-20 14:59:50,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:59:50,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:50,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:50,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:59:50,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:50,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:50,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2024-11-20 14:59:50,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:50,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338187745] [2024-11-20 14:59:50,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:50,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:51,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:51,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338187745] [2024-11-20 14:59:51,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338187745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:59:51,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:59:51,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:59:51,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687383899] [2024-11-20 14:59:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:59:51,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:59:51,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:51,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:59:51,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:59:51,057 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:51,070 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2024-11-20 14:59:51,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:59:51,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 14:59:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:51,072 INFO L225 Difference]: With dead ends: 136 [2024-11-20 14:59:51,072 INFO L226 Difference]: Without dead ends: 136 [2024-11-20 14:59:51,072 INFO L431 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 [2024-11-20 14:59:51,073 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 8 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 253 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 [2024-11-20 14:59:51,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 253 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:59:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-20 14:59:51,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2024-11-20 14:59:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 127 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2024-11-20 14:59:51,079 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 9 [2024-11-20 14:59:51,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:51,080 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2024-11-20 14:59:51,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2024-11-20 14:59:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:59:51,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:51,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:51,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:59:51,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:51,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2024-11-20 14:59:51,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:51,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394656405] [2024-11-20 14:59:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:51,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:51,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:51,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394656405] [2024-11-20 14:59:51,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394656405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:59:51,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:59:51,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:59:51,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381818049] [2024-11-20 14:59:51,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:59:51,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:59:51,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:51,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:59:51,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:59:51,120 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:51,174 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2024-11-20 14:59:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:59:51,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 14:59:51,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:51,175 INFO L225 Difference]: With dead ends: 127 [2024-11-20 14:59:51,177 INFO L226 Difference]: Without dead ends: 127 [2024-11-20 14:59:51,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:59:51,178 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:51,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 205 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:59:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-20 14:59:51,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-20 14:59:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2024-11-20 14:59:51,185 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 9 [2024-11-20 14:59:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:51,186 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2024-11-20 14:59:51,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2024-11-20 14:59:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:59:51,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:51,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:51,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:59:51,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:51,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2024-11-20 14:59:51,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:51,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506116591] [2024-11-20 14:59:51,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:51,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:51,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:51,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506116591] [2024-11-20 14:59:51,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506116591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:59:51,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:59:51,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:59:51,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150768571] [2024-11-20 14:59:51,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:59:51,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:59:51,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:51,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:59:51,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:59:51,279 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:51,302 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2024-11-20 14:59:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:59:51,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 14:59:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:51,303 INFO L225 Difference]: With dead ends: 126 [2024-11-20 14:59:51,303 INFO L226 Difference]: Without dead ends: 126 [2024-11-20 14:59:51,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:59:51,304 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:51,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 237 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:59:51,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-20 14:59:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-20 14:59:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 125 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2024-11-20 14:59:51,314 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 9 [2024-11-20 14:59:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:51,315 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2024-11-20 14:59:51,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2024-11-20 14:59:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-20 14:59:51,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:51,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:51,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:59:51,316 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:51,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:51,316 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2024-11-20 14:59:51,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:51,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638310894] [2024-11-20 14:59:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:51,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:51,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638310894] [2024-11-20 14:59:51,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638310894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:59:51,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:59:51,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:59:51,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674927002] [2024-11-20 14:59:51,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:59:51,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:59:51,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:51,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:59:51,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:59:51,468 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:51,571 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2024-11-20 14:59:51,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:59:51,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-20 14:59:51,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:51,574 INFO L225 Difference]: With dead ends: 129 [2024-11-20 14:59:51,575 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 14:59:51,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:59:51,576 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 16 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:51,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 268 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:59:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 14:59:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-20 14:59:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.8) internal successors, (135), 128 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2024-11-20 14:59:51,588 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 10 [2024-11-20 14:59:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:51,588 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2024-11-20 14:59:51,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2024-11-20 14:59:51,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-20 14:59:51,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:51,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:51,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:59:51,589 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:51,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:51,589 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2024-11-20 14:59:51,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:51,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694733199] [2024-11-20 14:59:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:51,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:51,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:51,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694733199] [2024-11-20 14:59:51,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694733199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:59:51,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:59:51,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:59:51,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946210293] [2024-11-20 14:59:51,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:59:51,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:59:51,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:51,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:59:51,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:59:51,735 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:51,781 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2024-11-20 14:59:51,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:59:51,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-20 14:59:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:51,783 INFO L225 Difference]: With dead ends: 129 [2024-11-20 14:59:51,783 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 14:59:51,783 INFO L431 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 [2024-11-20 14:59:51,786 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 31 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:51,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 334 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:59:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 14:59:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-20 14:59:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2024-11-20 14:59:51,794 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 10 [2024-11-20 14:59:51,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:51,794 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2024-11-20 14:59:51,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2024-11-20 14:59:51,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:59:51,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:51,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:51,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 14:59:51,797 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:51,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:51,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2024-11-20 14:59:51,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:51,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931995207] [2024-11-20 14:59:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:51,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:51,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931995207] [2024-11-20 14:59:51,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931995207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:59:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87684894] [2024-11-20 14:59:51,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:51,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:59:51,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:59:51,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:59:51,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 14:59:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:51,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:59:51,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:59:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:51,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:59:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87684894] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:59:51,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:59:51,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-20 14:59:51,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788613702] [2024-11-20 14:59:51,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:59:51,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:59:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:51,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:59:51,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:59:51,988 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:51,998 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2024-11-20 14:59:51,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:59:51,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-20 14:59:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:51,999 INFO L225 Difference]: With dead ends: 131 [2024-11-20 14:59:51,999 INFO L226 Difference]: Without dead ends: 131 [2024-11-20 14:59:51,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:59:52,000 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:52,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 254 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:59:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-20 14:59:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-20 14:59:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 130 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2024-11-20 14:59:52,006 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 14 [2024-11-20 14:59:52,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:52,006 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2024-11-20 14:59:52,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2024-11-20 14:59:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-20 14:59:52,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:52,009 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:52,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 14:59:52,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:59:52,210 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:52,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:52,211 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2024-11-20 14:59:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:52,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635542067] [2024-11-20 14:59:52,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:52,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:52,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:52,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635542067] [2024-11-20 14:59:52,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635542067] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:59:52,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797009726] [2024-11-20 14:59:52,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:52,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:59:52,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:59:52,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:59:52,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 14:59:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:52,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 14:59:52,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:59:52,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:59:52,392 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-20 14:59:52,393 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 [2024-11-20 14:59:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:52,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:59:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:52,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797009726] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:59:52,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:59:52,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-20 14:59:52,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042252333] [2024-11-20 14:59:52,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:59:52,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:59:52,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:52,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:59:52,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:59:52,427 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:52,543 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2024-11-20 14:59:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:59:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-20 14:59:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:52,544 INFO L225 Difference]: With dead ends: 129 [2024-11-20 14:59:52,544 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 14:59:52,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:59:52,544 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 7 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:52,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 273 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:59:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 14:59:52,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-20 14:59:52,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2024-11-20 14:59:52,547 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 15 [2024-11-20 14:59:52,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:52,547 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2024-11-20 14:59:52,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:52,550 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2024-11-20 14:59:52,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-20 14:59:52,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:52,551 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:52,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 14:59:52,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-20 14:59:52,751 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:52,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:52,752 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2024-11-20 14:59:52,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:52,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936349157] [2024-11-20 14:59:52,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:52,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:52,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936349157] [2024-11-20 14:59:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936349157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:59:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213215009] [2024-11-20 14:59:52,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:52,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:59:52,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:59:52,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:59:52,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 14:59:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:52,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 14:59:52,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:59:52,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:59:52,989 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-20 14:59:52,989 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 [2024-11-20 14:59:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:53,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:59:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:53,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213215009] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:59:53,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:59:53,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 9 [2024-11-20 14:59:53,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558030818] [2024-11-20 14:59:53,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:59:53,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:59:53,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:53,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:59:53,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:59:53,106 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:53,258 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2024-11-20 14:59:53,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:59:53,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 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 15 [2024-11-20 14:59:53,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:53,259 INFO L225 Difference]: With dead ends: 127 [2024-11-20 14:59:53,259 INFO L226 Difference]: Without dead ends: 127 [2024-11-20 14:59:53,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:59:53,259 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 15 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:53,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 766 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:59:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-20 14:59:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-20 14:59:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7142857142857142) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2024-11-20 14:59:53,261 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 15 [2024-11-20 14:59:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:53,261 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2024-11-20 14:59:53,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2024-11-20 14:59:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 14:59:53,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:53,262 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:53,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 14:59:53,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:59:53,463 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:53,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2024-11-20 14:59:53,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:53,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198115791] [2024-11-20 14:59:53,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:53,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:59:53,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:53,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198115791] [2024-11-20 14:59:53,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198115791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:59:53,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:59:53,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:59:53,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514320748] [2024-11-20 14:59:53,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:59:53,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:59:53,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:53,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:59:53,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:59:53,536 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:53,645 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2024-11-20 14:59:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:59:53,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-20 14:59:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:53,649 INFO L225 Difference]: With dead ends: 124 [2024-11-20 14:59:53,649 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 14:59:53,649 INFO L431 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 [2024-11-20 14:59:53,650 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 24 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:53,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 373 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:59:53,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 14:59:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-20 14:59:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 123 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) [2024-11-20 14:59:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2024-11-20 14:59:53,652 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 22 [2024-11-20 14:59:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:53,652 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2024-11-20 14:59:53,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2024-11-20 14:59:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 14:59:53,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:53,653 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:53,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 14:59:53,653 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:53,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:53,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2024-11-20 14:59:53,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:53,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56855931] [2024-11-20 14:59:53,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:53,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:59:53,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:53,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56855931] [2024-11-20 14:59:53,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56855931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:59:53,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:59:53,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:59:53,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202235270] [2024-11-20 14:59:53,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:59:53,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:59:53,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:53,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:59:53,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:59:53,826 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:53,916 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2024-11-20 14:59:53,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:59:53,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-20 14:59:53,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:53,917 INFO L225 Difference]: With dead ends: 117 [2024-11-20 14:59:53,917 INFO L226 Difference]: Without dead ends: 117 [2024-11-20 14:59:53,917 INFO L431 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 [2024-11-20 14:59:53,918 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 38 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:53,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 433 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:59:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-20 14:59:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-20 14:59:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.5844155844155845) internal successors, (122), 116 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2024-11-20 14:59:53,920 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 22 [2024-11-20 14:59:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:53,920 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2024-11-20 14:59:53,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2024-11-20 14:59:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:59:53,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:53,921 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:53,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 14:59:53,921 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:53,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:53,922 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2024-11-20 14:59:53,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:53,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412438132] [2024-11-20 14:59:53,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:53,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:59:54,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:54,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412438132] [2024-11-20 14:59:54,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412438132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:59:54,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:59:54,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:59:54,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666149344] [2024-11-20 14:59:54,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:59:54,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:59:54,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:54,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:59:54,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:59:54,015 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:54,117 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2024-11-20 14:59:54,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:59:54,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-20 14:59:54,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:54,118 INFO L225 Difference]: With dead ends: 112 [2024-11-20 14:59:54,118 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 14:59:54,118 INFO L431 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 [2024-11-20 14:59:54,119 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:54,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 301 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:59:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 14:59:54,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-20 14:59:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 111 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2024-11-20 14:59:54,122 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 28 [2024-11-20 14:59:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:54,122 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2024-11-20 14:59:54,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2024-11-20 14:59:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:59:54,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:54,124 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:54,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 14:59:54,124 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:54,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:54,124 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2024-11-20 14:59:54,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:54,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557992014] [2024-11-20 14:59:54,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:54,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:59:54,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:54,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557992014] [2024-11-20 14:59:54,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557992014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:59:54,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:59:54,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 14:59:54,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66329804] [2024-11-20 14:59:54,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:59:54,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:59:54,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:54,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:59:54,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:59:54,401 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:54,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:54,508 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2024-11-20 14:59:54,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 14:59:54,509 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-20 14:59:54,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:54,509 INFO L225 Difference]: With dead ends: 107 [2024-11-20 14:59:54,509 INFO L226 Difference]: Without dead ends: 107 [2024-11-20 14:59:54,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:59:54,510 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 76 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:54,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 504 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:59:54,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-20 14:59:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-20 14:59:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 106 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) [2024-11-20 14:59:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2024-11-20 14:59:54,512 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 28 [2024-11-20 14:59:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:54,512 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2024-11-20 14:59:54,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2024-11-20 14:59:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:59:54,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:54,513 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:54,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 14:59:54,513 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:54,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:54,513 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2024-11-20 14:59:54,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:54,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799085361] [2024-11-20 14:59:54,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:54,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:54,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:54,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799085361] [2024-11-20 14:59:54,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799085361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:59:54,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439006092] [2024-11-20 14:59:54,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:54,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:59:54,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:59:54,892 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:59:54,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 14:59:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:54,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-20 14:59:54,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:59:54,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:59:55,076 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-20 14:59:55,077 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 [2024-11-20 14:59:55,112 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 [2024-11-20 14:59:55,145 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 [2024-11-20 14:59:55,175 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 [2024-11-20 14:59:55,183 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 27 treesize of output 11 [2024-11-20 14:59:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:55,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:59:55,225 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) is different from false [2024-11-20 14:59:55,280 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_462) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2024-11-20 14:59:55,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:59:55,288 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 21 treesize of output 22 [2024-11-20 14:59:55,292 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 122 treesize of output 110 [2024-11-20 14:59:55,297 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 23 treesize of output 21 [2024-11-20 14:59:55,306 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 20 treesize of output 16 [2024-11-20 14:59:55,446 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 14:59:55,447 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 25 treesize of output 24 [2024-11-20 14:59:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-20 14:59:55,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439006092] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:59:55,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:59:55,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 28 [2024-11-20 14:59:55,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806875106] [2024-11-20 14:59:55,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:59:55,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-20 14:59:55,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:55,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-20 14:59:55,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=8, NotChecked=102, Total=812 [2024-11-20 14:59:55,452 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:55,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:55,940 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2024-11-20 14:59:55,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 14:59:55,940 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-20 14:59:55,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:55,941 INFO L225 Difference]: With dead ends: 105 [2024-11-20 14:59:55,941 INFO L226 Difference]: Without dead ends: 105 [2024-11-20 14:59:55,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=1130, Unknown=9, NotChecked=142, Total=1482 [2024-11-20 14:59:55,942 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 73 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:55,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1103 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 705 Invalid, 0 Unknown, 148 Unchecked, 0.3s Time] [2024-11-20 14:59:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-20 14:59:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2024-11-20 14:59:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2024-11-20 14:59:55,943 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 28 [2024-11-20 14:59:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:55,944 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2024-11-20 14:59:55,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2024-11-20 14:59:55,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:59:55,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:55,944 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:55,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 14:59:56,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-20 14:59:56,145 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:56,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2024-11-20 14:59:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:56,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112225864] [2024-11-20 14:59:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:59:56,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:56,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112225864] [2024-11-20 14:59:56,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112225864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:59:56,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:59:56,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 14:59:56,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755665923] [2024-11-20 14:59:56,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:59:56,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:59:56,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:56,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:59:56,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:59:56,402 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 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) [2024-11-20 14:59:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:56,608 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2024-11-20 14:59:56,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 14:59:56,608 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 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 29 [2024-11-20 14:59:56,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:56,609 INFO L225 Difference]: With dead ends: 97 [2024-11-20 14:59:56,609 INFO L226 Difference]: Without dead ends: 97 [2024-11-20 14:59:56,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:59:56,609 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 82 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:56,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 311 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:59:56,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-20 14:59:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-20 14:59:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-11-20 14:59:56,612 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 29 [2024-11-20 14:59:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:56,612 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-11-20 14:59:56,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 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) [2024-11-20 14:59:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-11-20 14:59:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:59:56,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:56,613 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:56,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 14:59:56,613 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:56,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:56,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2024-11-20 14:59:56,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:56,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097752504] [2024-11-20 14:59:56,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:56,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:56,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:56,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097752504] [2024-11-20 14:59:56,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097752504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:59:56,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917367147] [2024-11-20 14:59:56,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:56,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:59:56,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:59:56,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:59:56,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 14:59:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:57,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-20 14:59:57,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:59:57,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:59:57,060 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-20 14:59:57,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 [2024-11-20 14:59:57,120 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-20 14:59:57,121 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 [2024-11-20 14:59:57,152 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 [2024-11-20 14:59:57,182 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 [2024-11-20 14:59:57,268 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 35 [2024-11-20 14:59:57,285 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 55 treesize of output 31 [2024-11-20 14:59:57,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:59:57,446 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 53 treesize of output 31 [2024-11-20 14:59:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:57,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:59:57,538 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_585) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-20 14:59:57,545 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_585) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-20 14:59:57,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:59:57,594 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 21 treesize of output 22 [2024-11-20 14:59:57,598 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 121 treesize of output 109 [2024-11-20 14:59:57,617 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 27 treesize of output 25 [2024-11-20 14:59:57,634 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 24 treesize of output 20 [2024-11-20 14:59:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-20 14:59:57,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917367147] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:59:57,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:59:57,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 33 [2024-11-20 14:59:57,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181443163] [2024-11-20 14:59:57,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:59:57,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-20 14:59:57,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:57,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-20 14:59:57,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=882, Unknown=9, NotChecked=122, Total=1122 [2024-11-20 14:59:57,820 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:58,568 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2024-11-20 14:59:58,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 14:59:58,569 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 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 29 [2024-11-20 14:59:58,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:58,569 INFO L225 Difference]: With dead ends: 95 [2024-11-20 14:59:58,569 INFO L226 Difference]: Without dead ends: 95 [2024-11-20 14:59:58,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=1353, Unknown=9, NotChecked=154, Total=1722 [2024-11-20 14:59:58,570 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 70 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:58,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 698 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1123 Invalid, 0 Unknown, 168 Unchecked, 0.5s Time] [2024-11-20 14:59:58,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-20 14:59:58,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-11-20 14:59:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 91 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-20 14:59:58,572 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 29 [2024-11-20 14:59:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:58,572 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-20 14:59:58,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-20 14:59:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:59:58,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:58,573 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:58,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 14:59:58,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-20 14:59:58,778 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:58,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2024-11-20 14:59:58,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:58,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153038911] [2024-11-20 14:59:58,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:58,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:59:59,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:59,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153038911] [2024-11-20 14:59:59,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153038911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:59:59,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:59:59,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 14:59:59,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133541561] [2024-11-20 14:59:59,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:59:59,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:59:59,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:59:59,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:59:59,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:59:59,002 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 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) [2024-11-20 14:59:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:59:59,149 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-11-20 14:59:59,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:59:59,149 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 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 30 [2024-11-20 14:59:59,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:59:59,150 INFO L225 Difference]: With dead ends: 91 [2024-11-20 14:59:59,150 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 14:59:59,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:59:59,150 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:59:59,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 415 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:59:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 14:59:59,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 14:59:59,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 90 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:59:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2024-11-20 14:59:59,152 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 30 [2024-11-20 14:59:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:59:59,152 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2024-11-20 14:59:59,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 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) [2024-11-20 14:59:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2024-11-20 14:59:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:59:59,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:59:59,153 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:59:59,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 14:59:59,153 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 14:59:59,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:59:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2024-11-20 14:59:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:59:59,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757319981] [2024-11-20 14:59:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:59,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:59:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:59,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:59:59,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757319981] [2024-11-20 14:59:59,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757319981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:59:59,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389626098] [2024-11-20 14:59:59,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:59:59,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:59:59,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:59:59,423 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:59:59,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 14:59:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:59:59,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-20 14:59:59,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:59:59,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:59:59,590 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-20 14:59:59,590 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 [2024-11-20 14:59:59,610 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 [2024-11-20 14:59:59,640 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:59:59,640 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 34 treesize of output 33 [2024-11-20 14:59:59,691 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 26 treesize of output 19 [2024-11-20 14:59:59,705 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 37 treesize of output 17 [2024-11-20 14:59:59,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:59:59,776 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 35 treesize of output 17 [2024-11-20 14:59:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:59:59,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:59:59,801 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_705 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_705) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) is different from false [2024-11-20 14:59:59,840 INFO L349 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2024-11-20 14:59:59,840 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 22 treesize of output 21 [2024-11-20 15:00:03,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:03,885 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 21 treesize of output 22 [2024-11-20 15:00:03,887 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 122 treesize of output 110 [2024-11-20 15:00:03,891 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 15 treesize of output 13 [2024-11-20 15:00:03,896 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 20 treesize of output 16 [2024-11-20 15:00:03,945 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 15:00:03,946 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 25 treesize of output 24 [2024-11-20 15:00:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-20 15:00:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389626098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:03,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:03,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 29 [2024-11-20 15:00:03,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189128260] [2024-11-20 15:00:03,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:03,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-20 15:00:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:03,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-20 15:00:03,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=709, Unknown=22, NotChecked=54, Total=870 [2024-11-20 15:00:03,952 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:04,419 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-20 15:00:04,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 15:00:04,420 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 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 30 [2024-11-20 15:00:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:04,420 INFO L225 Difference]: With dead ends: 90 [2024-11-20 15:00:04,420 INFO L226 Difference]: Without dead ends: 90 [2024-11-20 15:00:04,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=181, Invalid=1207, Unknown=22, NotChecked=72, Total=1482 [2024-11-20 15:00:04,421 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:04,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 846 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 759 Invalid, 0 Unknown, 60 Unchecked, 0.3s Time] [2024-11-20 15:00:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-20 15:00:04,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-20 15:00:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-11-20 15:00:04,423 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 30 [2024-11-20 15:00:04,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:04,423 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-11-20 15:00:04,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-11-20 15:00:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-20 15:00:04,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:04,424 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:04,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-20 15:00:04,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:04,626 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 15:00:04,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:04,626 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2024-11-20 15:00:04,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:04,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336820187] [2024-11-20 15:00:04,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:04,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:04,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336820187] [2024-11-20 15:00:04,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336820187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693867543] [2024-11-20 15:00:04,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:04,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:04,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:04,939 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:00:04,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 15:00:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:05,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-20 15:00:05,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:05,060 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 15:00:05,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 15:00:05,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 15:00:05,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:05,175 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 27 treesize of output 21 [2024-11-20 15:00:05,321 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-20 15:00:05,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2024-11-20 15:00:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:05,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:05,438 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 13 treesize of output 11 [2024-11-20 15:00:05,439 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 20 treesize of output 18 [2024-11-20 15:00:05,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-20 15:00:05,482 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 15:00:05,482 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 13 treesize of output 12 [2024-11-20 15:00:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:05,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693867543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:05,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:05,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 28 [2024-11-20 15:00:05,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259922777] [2024-11-20 15:00:05,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:05,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-20 15:00:05,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:05,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-20 15:00:05,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2024-11-20 15:00:05,489 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 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) [2024-11-20 15:00:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:05,924 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-20 15:00:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 15:00:05,924 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 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) Word has length 33 [2024-11-20 15:00:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:05,925 INFO L225 Difference]: With dead ends: 89 [2024-11-20 15:00:05,925 INFO L226 Difference]: Without dead ends: 89 [2024-11-20 15:00:05,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2024-11-20 15:00:05,926 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 73 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:05,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 809 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 15:00:05,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-20 15:00:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-20 15:00:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 88 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-20 15:00:05,927 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 33 [2024-11-20 15:00:05,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:05,927 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-20 15:00:05,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 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) [2024-11-20 15:00:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-20 15:00:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-20 15:00:05,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:05,928 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:05,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-20 15:00:06,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:06,135 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 15:00:06,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:06,135 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2024-11-20 15:00:06,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:06,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087415072] [2024-11-20 15:00:06,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:06,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:06,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:06,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087415072] [2024-11-20 15:00:06,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087415072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:06,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217295568] [2024-11-20 15:00:06,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:06,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:06,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:06,460 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:00:06,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 15:00:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:06,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-20 15:00:06,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:06,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 15:00:06,583 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-20 15:00:06,584 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 [2024-11-20 15:00:06,596 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 [2024-11-20 15:00:06,609 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 15:00:06,610 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 34 treesize of output 33 [2024-11-20 15:00:06,653 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 26 treesize of output 19 [2024-11-20 15:00:06,667 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 33 treesize of output 17 [2024-11-20 15:00:06,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:06,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2024-11-20 15:00:06,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 15:00:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:06,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:07,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:07,187 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 47 treesize of output 51 [2024-11-20 15:00:07,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:07,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-20 15:00:07,263 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 85 treesize of output 81 [2024-11-20 15:00:07,267 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 100 treesize of output 96 [2024-11-20 15:00:07,275 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 87 treesize of output 85 [2024-11-20 15:00:07,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:07,282 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 92 treesize of output 96 [2024-11-20 15:00:07,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:07,315 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 26 treesize of output 27 [2024-11-20 15:00:07,318 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:00:07,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 40 treesize of output 36 [2024-11-20 15:00:07,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 15:00:07,332 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 15:00:07,332 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 34 treesize of output 33 [2024-11-20 15:00:07,497 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 15:00:07,498 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 25 treesize of output 24 [2024-11-20 15:00:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:07,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217295568] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:07,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:07,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 34 [2024-11-20 15:00:07,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556255480] [2024-11-20 15:00:07,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:07,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-20 15:00:07,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:07,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-20 15:00:07,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1073, Unknown=25, NotChecked=0, Total=1190 [2024-11-20 15:00:07,502 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 35 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) [2024-11-20 15:00:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:08,274 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-11-20 15:00:08,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 15:00:08,274 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 35 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) Word has length 33 [2024-11-20 15:00:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:08,274 INFO L225 Difference]: With dead ends: 91 [2024-11-20 15:00:08,274 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 15:00:08,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=217, Invalid=1920, Unknown=25, NotChecked=0, Total=2162 [2024-11-20 15:00:08,275 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 50 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:08,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 958 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 15:00:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 15:00:08,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2024-11-20 15:00:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 87 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-20 15:00:08,277 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 33 [2024-11-20 15:00:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:08,277 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-20 15:00:08,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 35 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) [2024-11-20 15:00:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-20 15:00:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 15:00:08,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:08,278 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:08,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-20 15:00:08,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-20 15:00:08,483 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 15:00:08,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:08,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2024-11-20 15:00:08,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:08,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456066764] [2024-11-20 15:00:08,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:08,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:09,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:09,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456066764] [2024-11-20 15:00:09,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456066764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:09,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352347967] [2024-11-20 15:00:09,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:09,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:09,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:09,091 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:00:09,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-20 15:00:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:09,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-20 15:00:09,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:09,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 15:00:09,250 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 15:00:09,250 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 [2024-11-20 15:00:09,367 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-20 15:00:09,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-20 15:00:09,397 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 [2024-11-20 15:00:09,431 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 15:00:09,431 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 39 [2024-11-20 15:00:09,483 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 34 treesize of output 25 [2024-11-20 15:00:09,492 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 51 treesize of output 27 [2024-11-20 15:00:09,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:09,642 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 58 treesize of output 24 [2024-11-20 15:00:09,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 15:00:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:09,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:09,839 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_958 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_958 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2024-11-20 15:00:09,850 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_958 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1)) (forall ((v_ArrVal_958 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2024-11-20 15:00:09,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:09,858 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 37 treesize of output 41 [2024-11-20 15:00:09,871 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_957) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_3) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |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_dll_circular_create_~head~0#1.base|))) is different from false [2024-11-20 15:00:09,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:09,875 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 21 treesize of output 22 [2024-11-20 15:00:09,877 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 122 treesize of output 110 [2024-11-20 15:00:09,880 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 15 treesize of output 13 [2024-11-20 15:00:09,885 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 20 treesize of output 16 [2024-11-20 15:00:09,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:09,889 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-20 15:00:09,891 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:00:09,892 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:00:09,896 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 17 treesize of output 9 [2024-11-20 15:00:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-20 15:00:10,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352347967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:10,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:10,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 48 [2024-11-20 15:00:10,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150088182] [2024-11-20 15:00:10,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:10,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-20 15:00:10,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:10,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-20 15:00:10,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1917, Unknown=3, NotChecked=270, Total=2352 [2024-11-20 15:00:10,155 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 49 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 49 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:11,246 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-20 15:00:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-20 15:00:11,248 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 49 states have internal predecessors, (79), 0 states have call successors, (0), 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 34 [2024-11-20 15:00:11,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:11,249 INFO L225 Difference]: With dead ends: 90 [2024-11-20 15:00:11,249 INFO L226 Difference]: Without dead ends: 90 [2024-11-20 15:00:11,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=406, Invalid=3763, Unknown=3, NotChecked=384, Total=4556 [2024-11-20 15:00:11,250 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 80 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:11,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1004 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1402 Invalid, 0 Unknown, 184 Unchecked, 0.5s Time] [2024-11-20 15:00:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-20 15:00:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-20 15:00:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 86 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) [2024-11-20 15:00:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-20 15:00:11,251 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 34 [2024-11-20 15:00:11,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:11,252 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-20 15:00:11,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 49 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-20 15:00:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 15:00:11,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:11,252 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:11,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-20 15:00:11,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:11,453 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 15:00:11,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1554055919, now seen corresponding path program 1 times [2024-11-20 15:00:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:11,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950869403] [2024-11-20 15:00:11,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:11,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:11,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:11,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950869403] [2024-11-20 15:00:11,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950869403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:11,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890819065] [2024-11-20 15:00:11,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:11,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:11,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:11,792 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:00:11,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-20 15:00:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:11,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-20 15:00:11,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:11,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 15:00:11,909 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-20 15:00:11,909 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 [2024-11-20 15:00:11,932 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-20 15:00:11,932 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 [2024-11-20 15:00:11,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 15:00:12,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:12,055 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 27 treesize of output 21 [2024-11-20 15:00:12,279 INFO L349 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2024-11-20 15:00:12,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 64 [2024-11-20 15:00:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 15:00:12,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 15:00:12,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890819065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:00:12,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 15:00:12,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14] total 25 [2024-11-20 15:00:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417585794] [2024-11-20 15:00:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:00:12,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 15:00:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:12,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 15:00:12,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2024-11-20 15:00:12,399 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 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) [2024-11-20 15:00:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:12,720 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-11-20 15:00:12,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 15:00:12,721 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 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 34 [2024-11-20 15:00:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:12,721 INFO L225 Difference]: With dead ends: 86 [2024-11-20 15:00:12,721 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 15:00:12,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2024-11-20 15:00:12,722 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:12,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 347 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 15:00:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 15:00:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-20 15:00:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-11-20 15:00:12,723 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 34 [2024-11-20 15:00:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:12,723 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-11-20 15:00:12,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 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) [2024-11-20 15:00:12,723 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-11-20 15:00:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 15:00:12,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:12,724 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:12,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-20 15:00:12,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-20 15:00:12,924 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 15:00:12,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:12,925 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2024-11-20 15:00:12,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:12,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679444389] [2024-11-20 15:00:12,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679444389] [2024-11-20 15:00:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679444389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683445396] [2024-11-20 15:00:13,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:13,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:13,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:13,430 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:00:13,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-20 15:00:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:13,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-20 15:00:13,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:13,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 15:00:13,587 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 15:00:13,588 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 [2024-11-20 15:00:13,667 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-20 15:00:13,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-20 15:00:13,691 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 [2024-11-20 15:00:13,720 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 15:00:13,721 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 33 treesize of output 32 [2024-11-20 15:00:13,773 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 25 treesize of output 18 [2024-11-20 15:00:13,801 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 42 treesize of output 22 [2024-11-20 15:00:13,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:13,965 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 60 treesize of output 24 [2024-11-20 15:00:13,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 15:00:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:13,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:14,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-20 15:00:14,164 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1129) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-20 15:00:14,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:14,271 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 22 treesize of output 23 [2024-11-20 15:00:14,272 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 65 treesize of output 57 [2024-11-20 15:00:14,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-20 15:00:14,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-20 15:00:14,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-20 15:00:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-20 15:00:14,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683445396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:14,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:14,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 49 [2024-11-20 15:00:14,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439637239] [2024-11-20 15:00:14,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:14,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-20 15:00:14,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:14,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-20 15:00:14,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2152, Unknown=22, NotChecked=94, Total=2450 [2024-11-20 15:00:14,526 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 50 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:15,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:15,527 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-20 15:00:15,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 15:00:15,527 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 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 34 [2024-11-20 15:00:15,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:15,527 INFO L225 Difference]: With dead ends: 88 [2024-11-20 15:00:15,527 INFO L226 Difference]: Without dead ends: 88 [2024-11-20 15:00:15,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=429, Invalid=3975, Unknown=22, NotChecked=130, Total=4556 [2024-11-20 15:00:15,529 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 114 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:15,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1301 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1515 Invalid, 0 Unknown, 48 Unchecked, 0.5s Time] [2024-11-20 15:00:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-20 15:00:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-11-20 15:00:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-20 15:00:15,530 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 34 [2024-11-20 15:00:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:15,531 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-20 15:00:15,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-20 15:00:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 15:00:15,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:15,531 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:15,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-20 15:00:15,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-20 15:00:15,736 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 15:00:15,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:15,736 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2024-11-20 15:00:15,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:15,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631466765] [2024-11-20 15:00:15,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:15,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:16,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:16,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631466765] [2024-11-20 15:00:16,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631466765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:16,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640886384] [2024-11-20 15:00:16,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:16,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:16,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:16,030 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:00:16,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-20 15:00:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:16,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-20 15:00:16,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:16,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 15:00:16,216 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-20 15:00:16,216 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 [2024-11-20 15:00:16,234 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 [2024-11-20 15:00:16,262 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 15:00:16,262 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 25 treesize of output 26 [2024-11-20 15:00:16,297 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 17 treesize of output 12 [2024-11-20 15:00:16,304 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 24 treesize of output 12 [2024-11-20 15:00:16,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:16,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 28 [2024-11-20 15:00:16,514 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 15:00:16,514 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 [2024-11-20 15:00:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:16,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:16,657 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 [2024-11-20 15:00:16,721 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2024-11-20 15:00:16,729 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-20 15:00:16,732 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-20 15:00:16,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:16,736 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 27 treesize of output 28 [2024-11-20 15:00:16,739 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 85 treesize of output 81 [2024-11-20 15:00:16,752 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 87 treesize of output 85 [2024-11-20 15:00:16,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:16,757 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 92 treesize of output 96 [2024-11-20 15:00:16,759 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 96 treesize of output 92 [2024-11-20 15:00:16,909 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 15:00:16,909 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 25 treesize of output 24 [2024-11-20 15:00:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-20 15:00:16,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640886384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:16,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:16,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 18] total 41 [2024-11-20 15:00:16,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225057918] [2024-11-20 15:00:16,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:16,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-20 15:00:16,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:16,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-20 15:00:16,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1358, Unknown=3, NotChecked=228, Total=1722 [2024-11-20 15:00:16,913 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 42 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:17,430 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-11-20 15:00:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-20 15:00:17,430 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 42 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) Word has length 34 [2024-11-20 15:00:17,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:17,431 INFO L225 Difference]: With dead ends: 87 [2024-11-20 15:00:17,431 INFO L226 Difference]: Without dead ends: 87 [2024-11-20 15:00:17,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=288, Invalid=2373, Unknown=3, NotChecked=306, Total=2970 [2024-11-20 15:00:17,432 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 123 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:17,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 816 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 189 Unchecked, 0.2s Time] [2024-11-20 15:00:17,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-20 15:00:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-20 15:00:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.155844155844156) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-20 15:00:17,433 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 34 [2024-11-20 15:00:17,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:17,433 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-20 15:00:17,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 42 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-20 15:00:17,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-20 15:00:17,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:17,434 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:17,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-20 15:00:17,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-20 15:00:17,638 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 15:00:17,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1654547908, now seen corresponding path program 1 times [2024-11-20 15:00:17,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:17,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668902306] [2024-11-20 15:00:17,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:17,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:18,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:18,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668902306] [2024-11-20 15:00:18,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668902306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:18,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198516313] [2024-11-20 15:00:18,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:18,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:18,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:18,173 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:00:18,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-20 15:00:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:18,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-20 15:00:18,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:18,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 15:00:18,312 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 15:00:18,312 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 [2024-11-20 15:00:18,387 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-20 15:00:18,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-20 15:00:18,413 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 [2024-11-20 15:00:18,446 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 15:00:18,446 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 39 [2024-11-20 15:00:18,505 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 34 treesize of output 25 [2024-11-20 15:00:18,513 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 45 treesize of output 25 [2024-11-20 15:00:18,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 15:00:18,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:18,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 54 treesize of output 48 [2024-11-20 15:00:18,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-20 15:00:18,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 15:00:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:18,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:19,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1303 (Array Int Int))) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 4) (select .cse0 0))))) (forall ((v_ArrVal_1303 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) 1)) (forall ((v_ArrVal_1303 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2024-11-20 15:00:19,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:19,343 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 81 treesize of output 85 [2024-11-20 15:00:19,365 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (not (let ((.cse1 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 0) (select .cse1 4))))))) is different from false [2024-11-20 15:00:19,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:19,374 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 27 treesize of output 28 [2024-11-20 15:00:19,378 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 171 treesize of output 165 [2024-11-20 15:00:19,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:19,384 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 94 treesize of output 98 [2024-11-20 15:00:19,387 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 85 treesize of output 83 [2024-11-20 15:00:19,390 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 96 treesize of output 92 [2024-11-20 15:00:19,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:19,412 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2024-11-20 15:00:19,414 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:00:19,415 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 59 treesize of output 53 [2024-11-20 15:00:19,419 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:00:19,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:19,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 90 [2024-11-20 15:00:19,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2024-11-20 15:00:19,446 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-20 15:00:19,446 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2024-11-20 15:00:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-20 15:00:19,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198516313] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:19,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:19,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 21] total 55 [2024-11-20 15:00:19,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083275464] [2024-11-20 15:00:19,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:19,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-20 15:00:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:19,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-20 15:00:19,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2670, Unknown=6, NotChecked=210, Total=3080 [2024-11-20 15:00:19,694 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 56 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 56 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:20,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:20,943 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-11-20 15:00:20,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-20 15:00:20,944 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 56 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-20 15:00:20,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:20,944 INFO L225 Difference]: With dead ends: 86 [2024-11-20 15:00:20,944 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 15:00:20,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=467, Invalid=5085, Unknown=6, NotChecked=294, Total=5852 [2024-11-20 15:00:20,946 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 131 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:20,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 774 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1520 Invalid, 0 Unknown, 130 Unchecked, 0.6s Time] [2024-11-20 15:00:20,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 15:00:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-11-20 15:00:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 77 states have (on average 1.1428571428571428) 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) [2024-11-20 15:00:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-11-20 15:00:20,948 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 36 [2024-11-20 15:00:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:20,949 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-11-20 15:00:20,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 56 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-11-20 15:00:20,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-20 15:00:20,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:20,949 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:20,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-20 15:00:21,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-20 15:00:21,150 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 15:00:21,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:21,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1608865938, now seen corresponding path program 1 times [2024-11-20 15:00:21,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:21,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039257799] [2024-11-20 15:00:21,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:21,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:21,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:21,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039257799] [2024-11-20 15:00:21,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039257799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:21,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874420460] [2024-11-20 15:00:21,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:21,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:21,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:21,797 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:00:21,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-20 15:00:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:21,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-20 15:00:21,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:21,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 15:00:21,930 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 15:00:21,930 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 [2024-11-20 15:00:22,000 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-20 15:00:22,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-20 15:00:22,028 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 [2024-11-20 15:00:22,063 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 15:00:22,064 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 33 treesize of output 32 [2024-11-20 15:00:22,112 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 25 treesize of output 18 [2024-11-20 15:00:22,147 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 36 treesize of output 20 [2024-11-20 15:00:22,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 15:00:22,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:22,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 54 treesize of output 48 [2024-11-20 15:00:22,510 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-20 15:00:22,510 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 1 case distinctions, treesize of input 22 treesize of output 17 [2024-11-20 15:00:22,532 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-20 15:00:22,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2024-11-20 15:00:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:22,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:22,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:22,826 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 116 treesize of output 120 [2024-11-20 15:00:23,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:23,061 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 26 treesize of output 27 [2024-11-20 15:00:23,063 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 162 treesize of output 156 [2024-11-20 15:00:23,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:23,068 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 46 treesize of output 50 [2024-11-20 15:00:23,075 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 36 treesize of output 34 [2024-11-20 15:00:23,097 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 38 treesize of output 34 [2024-11-20 15:00:23,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:23,105 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 27 treesize of output 28 [2024-11-20 15:00:23,108 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 85 treesize of output 81 [2024-11-20 15:00:23,111 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 83 treesize of output 81 [2024-11-20 15:00:23,114 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 88 treesize of output 84 [2024-11-20 15:00:23,120 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 15:00:23,120 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 82 treesize of output 81 [2024-11-20 15:00:23,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:23,134 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 50 treesize of output 43 [2024-11-20 15:00:23,137 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:00:23,138 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 59 treesize of output 53 [2024-11-20 15:00:23,140 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:00:23,146 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-20 15:00:23,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 55 [2024-11-20 15:00:23,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 15:00:23,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:00:23,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-20 15:00:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:23,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874420460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:23,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:23,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 56 [2024-11-20 15:00:23,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526017603] [2024-11-20 15:00:23,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:23,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-20 15:00:23,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:23,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-20 15:00:23,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2916, Unknown=13, NotChecked=0, Total=3192 [2024-11-20 15:00:23,397 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 57 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 57 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:24,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:24,430 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-20 15:00:24,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-20 15:00:24,430 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 57 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-20 15:00:24,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:24,430 INFO L225 Difference]: With dead ends: 85 [2024-11-20 15:00:24,430 INFO L226 Difference]: Without dead ends: 85 [2024-11-20 15:00:24,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1626 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=454, Invalid=4225, Unknown=13, NotChecked=0, Total=4692 [2024-11-20 15:00:24,432 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 117 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:24,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 911 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 15:00:24,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-20 15:00:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-20 15:00:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.12987012987013) 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) [2024-11-20 15:00:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-11-20 15:00:24,433 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 36 [2024-11-20 15:00:24,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:24,433 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-11-20 15:00:24,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 57 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-11-20 15:00:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-20 15:00:24,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:24,434 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:24,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-20 15:00:24,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:24,634 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 15:00:24,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:24,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1472889600, now seen corresponding path program 1 times [2024-11-20 15:00:24,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:24,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074464431] [2024-11-20 15:00:24,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:25,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074464431] [2024-11-20 15:00:25,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074464431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:25,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367167578] [2024-11-20 15:00:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:25,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:25,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:25,076 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:00:25,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-20 15:00:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:25,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-20 15:00:25,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:25,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 15:00:25,261 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-20 15:00:25,261 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 [2024-11-20 15:00:25,282 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 [2024-11-20 15:00:25,312 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 15:00:25,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-20 15:00:25,361 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 17 treesize of output 12 [2024-11-20 15:00:25,367 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 24 treesize of output 12 [2024-11-20 15:00:25,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 15:00:25,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:25,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 39 [2024-11-20 15:00:25,659 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 15:00:25,659 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 [2024-11-20 15:00:25,736 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 15:00:25,736 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 34 treesize of output 33 [2024-11-20 15:00:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:25,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:25,926 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 74 treesize of output 70 [2024-11-20 15:00:26,079 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_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1480) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1481) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1480) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1481) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2024-11-20 15:00:26,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:26,083 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 27 treesize of output 28 [2024-11-20 15:00:26,088 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 85 treesize of output 81 [2024-11-20 15:00:26,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:26,094 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 94 treesize of output 98 [2024-11-20 15:00:26,097 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 98 treesize of output 94 [2024-11-20 15:00:26,100 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 85 treesize of output 83 [2024-11-20 15:00:26,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:26,122 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-20 15:00:26,124 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:00:26,125 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 43 treesize of output 39 [2024-11-20 15:00:26,128 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:00:26,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-11-20 15:00:26,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:00:26,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-20 15:00:26,214 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 15:00:26,214 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 25 treesize of output 24 [2024-11-20 15:00:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-20 15:00:26,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367167578] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:26,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:26,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 50 [2024-11-20 15:00:26,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326767112] [2024-11-20 15:00:26,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:26,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-20 15:00:26,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:26,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-20 15:00:26,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2234, Unknown=12, NotChecked=96, Total=2550 [2024-11-20 15:00:26,218 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 51 states, 50 states have (on average 1.94) internal successors, (97), 51 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:27,027 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-11-20 15:00:27,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-20 15:00:27,027 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.94) internal successors, (97), 51 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-20 15:00:27,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:27,028 INFO L225 Difference]: With dead ends: 83 [2024-11-20 15:00:27,028 INFO L226 Difference]: Without dead ends: 83 [2024-11-20 15:00:27,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=415, Invalid=3737, Unknown=12, NotChecked=126, Total=4290 [2024-11-20 15:00:27,029 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 117 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:27,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 760 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1253 Invalid, 0 Unknown, 61 Unchecked, 0.4s Time] [2024-11-20 15:00:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-20 15:00:27,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-11-20 15:00:27,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.103896103896104) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-11-20 15:00:27,030 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 37 [2024-11-20 15:00:27,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:27,030 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-11-20 15:00:27,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.94) internal successors, (97), 51 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-11-20 15:00:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-20 15:00:27,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:27,031 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:27,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-20 15:00:27,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-20 15:00:27,232 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 15:00:27,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:27,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1427207630, now seen corresponding path program 1 times [2024-11-20 15:00:27,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:27,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077909192] [2024-11-20 15:00:27,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:27,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:27,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:27,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077909192] [2024-11-20 15:00:27,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077909192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:27,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524120969] [2024-11-20 15:00:27,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:27,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:27,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:27,818 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:00:27,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-20 15:00:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:27,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-20 15:00:27,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:27,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 15:00:27,975 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 15:00:27,976 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 [2024-11-20 15:00:28,050 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-20 15:00:28,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-20 15:00:28,077 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 [2024-11-20 15:00:28,109 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 15:00:28,109 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 39 [2024-11-20 15:00:28,177 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 34 treesize of output 25 [2024-11-20 15:00:28,186 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 45 treesize of output 25 [2024-11-20 15:00:28,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 15:00:28,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:28,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 54 treesize of output 48 [2024-11-20 15:00:28,696 INFO L349 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2024-11-20 15:00:28,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 113 [2024-11-20 15:00:28,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 15:00:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:28,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:29,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:29,501 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 120 treesize of output 124 [2024-11-20 15:00:29,522 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_1569 (Array Int Int)) (v_ArrVal_1570 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1569) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1570) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1570 (Array Int Int))) (not (let ((.cse1 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1569) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1570) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 0) (select .cse1 4))))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2024-11-20 15:00:29,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:29,528 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 26 treesize of output 27 [2024-11-20 15:00:29,530 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 80 treesize of output 76 [2024-11-20 15:00:29,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:29,538 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 54 treesize of output 58 [2024-11-20 15:00:29,542 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 104 treesize of output 100 [2024-11-20 15:00:29,547 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 56 treesize of output 54 [2024-11-20 15:00:29,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:29,617 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 50 treesize of output 43 [2024-11-20 15:00:29,621 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 115 treesize of output 109 [2024-11-20 15:00:29,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 164 [2024-11-20 15:00:29,632 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:00:29,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:29,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 178 [2024-11-20 15:00:29,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 183 [2024-11-20 15:00:29,689 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-20 15:00:29,690 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2024-11-20 15:00:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-20 15:00:29,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524120969] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:29,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:29,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 21] total 56 [2024-11-20 15:00:29,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986763606] [2024-11-20 15:00:29,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:29,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-20 15:00:29,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:29,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-20 15:00:29,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2851, Unknown=31, NotChecked=108, Total=3192 [2024-11-20 15:00:29,994 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 57 states, 56 states have (on average 1.75) internal successors, (98), 57 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:31,177 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-11-20 15:00:31,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-20 15:00:31,178 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.75) internal successors, (98), 57 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-20 15:00:31,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:31,178 INFO L225 Difference]: With dead ends: 82 [2024-11-20 15:00:31,178 INFO L226 Difference]: Without dead ends: 82 [2024-11-20 15:00:31,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=484, Invalid=5340, Unknown=32, NotChecked=150, Total=6006 [2024-11-20 15:00:31,179 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 135 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:31,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 784 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1279 Invalid, 0 Unknown, 58 Unchecked, 0.5s Time] [2024-11-20 15:00:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-20 15:00:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-11-20 15:00:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-11-20 15:00:31,180 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 37 [2024-11-20 15:00:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:31,180 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-11-20 15:00:31,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.75) internal successors, (98), 57 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-11-20 15:00:31,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-20 15:00:31,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:31,181 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:31,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-20 15:00:31,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-20 15:00:31,381 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 15:00:31,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1018050100, now seen corresponding path program 1 times [2024-11-20 15:00:31,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:31,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070486715] [2024-11-20 15:00:31,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:31,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:31,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:31,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070486715] [2024-11-20 15:00:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070486715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:31,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701512567] [2024-11-20 15:00:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:31,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:31,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:31,867 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:00:31,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-20 15:00:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:31,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-20 15:00:31,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:31,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 15:00:32,014 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 15:00:32,015 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 [2024-11-20 15:00:32,083 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-20 15:00:32,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-20 15:00:32,108 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 [2024-11-20 15:00:32,137 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 15:00:32,137 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 33 treesize of output 32 [2024-11-20 15:00:32,186 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 25 treesize of output 18 [2024-11-20 15:00:32,213 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 36 treesize of output 20 [2024-11-20 15:00:32,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 15:00:32,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:32,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 54 treesize of output 48 [2024-11-20 15:00:32,654 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-11-20 15:00:32,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 88 [2024-11-20 15:00:32,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 15:00:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:32,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:33,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:33,148 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 102 treesize of output 106 [2024-11-20 15:00:33,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:33,457 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 50 treesize of output 43 [2024-11-20 15:00:33,459 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 231 treesize of output 221 [2024-11-20 15:00:33,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:33,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 150 [2024-11-20 15:00:33,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 151 [2024-11-20 15:00:33,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 192 [2024-11-20 15:00:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:33,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701512567] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:33,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:33,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 58 [2024-11-20 15:00:33,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469808143] [2024-11-20 15:00:33,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:33,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-20 15:00:33,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:33,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-20 15:00:33,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=3172, Unknown=3, NotChecked=0, Total=3422 [2024-11-20 15:00:33,796 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 59 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 59 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:34,911 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2024-11-20 15:00:34,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-20 15:00:34,912 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 59 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-20 15:00:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:34,912 INFO L225 Difference]: With dead ends: 81 [2024-11-20 15:00:34,912 INFO L226 Difference]: Without dead ends: 81 [2024-11-20 15:00:34,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1597 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=486, Invalid=5061, Unknown=3, NotChecked=0, Total=5550 [2024-11-20 15:00:34,913 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 135 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:34,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1073 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 15:00:34,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-20 15:00:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2024-11-20 15:00:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.077922077922078) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-20 15:00:34,915 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 37 [2024-11-20 15:00:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:34,915 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-20 15:00:34,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.6896551724137931) internal successors, (98), 59 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-20 15:00:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-20 15:00:34,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:34,915 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:34,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-20 15:00:35,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:35,116 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-20 15:00:35,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:35,116 INFO L85 PathProgramCache]: Analyzing trace with hash -882633249, now seen corresponding path program 1 times [2024-11-20 15:00:35,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:35,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815571208] [2024-11-20 15:00:35,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:35,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:35,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:35,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815571208] [2024-11-20 15:00:35,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815571208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:35,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649022188] [2024-11-20 15:00:35,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:35,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:35,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:35,785 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:00:35,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-20 15:00:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:35,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-20 15:00:35,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:36,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 15:00:36,142 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 15:00:36,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-11-20 15:00:36,243 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-20 15:00:36,243 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 1 case distinctions, treesize of input 54 treesize of output 45 [2024-11-20 15:00:36,252 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 73 treesize of output 53 [2024-11-20 15:00:36,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 15:00:36,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:36,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 83 treesize of output 69 [2024-11-20 15:00:37,415 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_55| Int) (|v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_55| Int) (|v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_49| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_55| 1))) (and (= (select .cse0 |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_55|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_49| 0) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_55| 0) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_55| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_55|) 0) (= (select (store .cse0 |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_55| 1) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_49|) 0)))) is different from true [2024-11-20 15:00:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:37,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:37,903 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1752 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1752) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 4) 0) (select .cse0 0) 0)))) is different from false [2024-11-20 15:00:37,909 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1752 (Array Int Int))) (= (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1752) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 4) 0) (select .cse0 0) 0)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-20 15:00:37,914 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1751 (Array Int Int))) (= (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1751) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1752) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 4) 0) (select .cse0 0) 0)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-20 15:00:37,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:37,919 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 62 treesize of output 55 [2024-11-20 15:00:37,920 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 326 treesize of output 316 [2024-11-20 15:00:37,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:37,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 161 [2024-11-20 15:00:37,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 182 [2024-11-20 15:00:37,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2024-11-20 15:00:45,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse15 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse8 (= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) 0)) (.cse2 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (let ((.cse12 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse464 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse475 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse475 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse475 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse475 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse475 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (.cse465 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse474 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse474 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse474 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse474 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (.cse94 (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse473 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse473 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse473 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse473 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (.cse19 (not .cse8)) (.cse4 (not .cse15)) (.cse93 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse7 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) (let ((.cse21 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (.cse97 (not .cse93)) (.cse165 (or (and (or .cse464 .cse8) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse469 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse469 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse469 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse470 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse469 (select (store .cse470 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse469 (select (store .cse470 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse469 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or .cse465 .cse8) (or .cse94 .cse19) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse471 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse471 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse472 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse471 (select (store .cse472 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse471 (select (store .cse472 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse471 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) .cse4)) (.cse188 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse468 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse468 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse468 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse468 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (.cse236 (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse467 (store .cse3 v_arrayElimCell_284 0)) (.cse466 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse466 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse466 (select (store .cse467 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse466 (select (store .cse467 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse466 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse4)) (.cse240 (or .cse465 .cse4)) (.cse44 (not .cse12)) (.cse42 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse420 (or .cse464 .cse4)) (.cse83 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or (let ((.cse18 (forall ((v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse86 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)))) (.cse87 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse92 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse92 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse92 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) (let ((.cse16 (or .cse4 .cse87)) (.cse11 (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse90 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse91 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse90 (select (store .cse91 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse90 (select (store .cse91 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse4)) (.cse9 (or .cse86 .cse4)) (.cse37 (or (and (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse84 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse84 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse85 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse84 (select (store .cse85 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse84 (select (store .cse85 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or .cse86 .cse8) (or .cse87 .cse8) (or .cse18 .cse19) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse88 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse89 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse88 (select (store .cse89 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse88 (select (store .cse89 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse4)) (.cse51 (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))) (and (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse0 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse1 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse0 (select (store .cse1 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse0 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse0 (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse4) (or (and (or (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse5 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse6 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse5 (select (store .cse6 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse5 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse5 (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse8) (or (and .cse9 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse10 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse10 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse10 (select .cse7 v_antiDerIndex_entry0_1)))))) .cse8) .cse11) .cse12) (or .cse12 (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse13 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse14 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse13 (select (store .cse14 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse13 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse13 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse8) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse7 v_antiDerIndex_entry0_1))) .cse12 .cse15 .cse8) (or (and .cse16 (or .cse12 (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse17 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse17 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse17 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse17 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) .cse8) (or .cse18 .cse19 .cse4) (or (and (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse20 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse20 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse20 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse20 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse19) (or .cse15 (forall ((v_arrayElimCell_281 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse22 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse22 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse22 (select .cse21 v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse23 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse23 (select .cse21 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (= .cse23 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse24 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse24 (select .cse21 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse25 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse24 (select (store .cse25 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or .cse15 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse21 v_antiDerIndex_entry0_1)))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse26 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse26 (select .cse21 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse26 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse27 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse26 (select (store .cse27 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse26 (select (store .cse27 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))))) .cse19) (or .cse8 (and (forall ((v_arrayElimCell_281 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse28 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse28 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse29 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse28 (select (store .cse29 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse29 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_281 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse30 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse30 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse30 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse30 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_281 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))) .cse15) (forall ((v_arrayElimCell_281 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse31 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse31 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse31 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_281 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse32 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse32 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse32 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse33 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse32 (select (store .cse33 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse32 (select (store .cse33 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))))))) (forall ((v_arrayElimCell_281 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse34 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse34 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse34 (select .cse21 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse35 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse34 (select (store .cse35 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse34 (select (store .cse35 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse36 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse36 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse36 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse36 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))) .cse8) .cse37 (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse38 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse38 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse38 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse38 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse38 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))) .cse8) (forall ((v_arrayElimCell_281 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse39 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse39 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse39 (select .cse21 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse39 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse40 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse39 (select (store .cse40 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse39 (select (store .cse40 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))))) .cse12) (or (and (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse41 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse41 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse41 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse41 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse41 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse16 (or (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse43 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse43 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse43 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse43 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))) .cse44) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse45 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse45 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse45 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse45 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))) .cse12)) .cse8) (or .cse12 (and .cse11 (or (and .cse9 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse46 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse46 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse46 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse8) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse47 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse48 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse47 (select (store .cse48 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store .cse48 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse8))) (or .cse15 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse49 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse49 (select .cse42 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse49 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse12) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse42 v_antiDerIndex_entry0_1))) .cse44)) .cse8) (or .cse44 (and (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse50 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse50 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse50 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))) (or .cse51 .cse4))) (or (and (or .cse12 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse52 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse53 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse52 (select (store .cse53 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse52 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse52 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse52 (select (store .cse53 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse55 (store .cse3 v_arrayElimCell_284 0)) (.cse54 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse54 (select (store .cse55 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse54 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse54 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse54 (select (store .cse55 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse54 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse56 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse57 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse56 (select (store .cse57 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse56 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse56 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse56 (select (store .cse57 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse44)) .cse8) (or (and (or .cse19 (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse58 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse59 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse58 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse58 (select (store .cse59 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse58 (select (store .cse59 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse60 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse62 (store .cse3 v_arrayElimCell_282 0))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse61 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse60 (select (store .cse61 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse60 (select (store .cse61 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse60 (select (store .cse62 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse60 (select (store .cse62 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (or .cse8 (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse63 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse64 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse63 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse63 (select (store .cse64 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse63 (select (store .cse64 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)))))) (or .cse8 (and (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse65 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse66 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse65 (select (store .cse66 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse65 (select (store .cse66 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse65 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse67 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse67 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse67 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse68 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse68 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse68 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse68 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse69 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int)) (or (= .cse69 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse70 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse69 (select (store .cse70 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse69 (select (store .cse70 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse69 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (or .cse15 (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)))))) (or (and (or .cse15 (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse71 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse72 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse71 (select (store .cse72 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse71 (select (store .cse72 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse71 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse73 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse73 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (= .cse73 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse74 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int)) (or (= .cse74 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse75 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse74 (select (store .cse75 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse74 (select (store .cse75 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse74 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse19) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse76 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse77 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse76 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse76 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse76 (select (store .cse77 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse76 (select (store .cse77 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) .cse8) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse78 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse80 (store .cse3 v_arrayElimCell_282 0))) (or (forall ((v_arrayElimCell_283 Int)) (or (= .cse78 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse79 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse78 (select (store .cse79 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse78 (select (store .cse79 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse78 (select (store .cse80 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse78 (select (store .cse80 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse81 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse82 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse81 (select (store .cse82 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse81 (select (store .cse82 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) .cse15) .cse37) .cse12)) .cse83) (or .cse51 .cse44 .cse4)))) .cse93) (or .cse94 .cse19 .cse4) (or (let ((.cse120 (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse162 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse162 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse162 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse162 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (.cse121 (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse160 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse161 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse160 (select (store .cse161 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse160 (select (store .cse161 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse160 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse160 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))))) (let ((.cse98 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse159 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse159 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (.cse146 (or (and .cse120 .cse121) .cse4))) (and (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse95 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse95 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse95 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse95 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse95 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse95 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse12) (or (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse96 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse96 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse96 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse97) (or .cse44 .cse98 .cse4) (or .cse12 (and (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse99 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse99 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse99 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse99 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse15) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse101 (store .cse3 v_arrayElimCell_284 0)) (.cse100 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse100 (select (store .cse101 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse100 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse100 (select (store .cse101 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse100 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_281 Int)) (= .cse100 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))) (= .cse100 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse103 (store .cse3 v_arrayElimCell_284 0)) (.cse102 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse102 (select (store .cse103 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse102 (select (store .cse103 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse102 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse102 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse4) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse104 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse104 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse104 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse104 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_281 Int)) (= .cse104 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))) (= .cse104 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse106 (store .cse3 v_arrayElimCell_284 0)) (.cse105 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse105 (select (store .cse106 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse105 (select (store .cse106 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse105 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_281 Int)) (= .cse105 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))) (= .cse105 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse107 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse107 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse107 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_281 Int)) (= .cse107 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))) (= .cse107 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse108 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse108 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse108 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse108 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse4))) (or .cse83 (and (or .cse44 (and (or .cse98 .cse4) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse109 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse109 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse109 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse109 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse109 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))))) (or (and (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse110 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int)) (or (= .cse110 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse111 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse110 (select (store .cse111 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse110 (select (store .cse111 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse110 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse110 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse110 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse112 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse113 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse112 (select (store .cse113 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse112 (select (store .cse113 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse112 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse112 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse112 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse114 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse116 (store .cse3 v_arrayElimCell_282 0))) (or (forall ((v_arrayElimCell_283 Int)) (or (= .cse114 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse115 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse114 (select (store .cse115 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse114 (select (store .cse115 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse114 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse114 (select (store .cse116 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse114 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse114 (select (store .cse116 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse117 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse117 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse117 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse117 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse117 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse118 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int)) (or (= .cse118 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse119 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse118 (select (store .cse119 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse119 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse118 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse120 .cse121) .cse4) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse122 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse122 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse122 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse122 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse122 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse122 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse124 (store .cse3 v_arrayElimCell_282 0)) (.cse123 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse123 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse123 (select (store .cse124 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse123 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse123 (select (store .cse124 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse123 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse123 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) (or .cse15 (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse125 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse126 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse125 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse125 (select (store .cse126 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse125 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse125 (select (store .cse126 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse127 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse129 (store .cse3 v_arrayElimCell_282 0))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse128 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse127 (select (store .cse128 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse127 (select (store .cse128 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse127 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse127 (select (store .cse129 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse127 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse127 (select (store .cse129 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse130 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse131 (store .cse3 v_arrayElimCell_282 0))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse130 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse130 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse130 (select (store .cse131 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse130 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse130 (select (store .cse131 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (or .cse15 (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse132 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse132 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse132 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse132 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse133 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse133 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse133 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)))))) .cse12) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse135 (store .cse3 v_arrayElimCell_284 0)) (.cse134 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse134 (select (store .cse135 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse134 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse134 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse134 (select (store .cse135 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse134 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse134 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse134 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse136 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse136 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse136 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse136 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse136 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse136 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse136 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or .cse12 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse138 (store .cse3 v_arrayElimCell_284 0)) (.cse137 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse137 (select (store .cse138 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse137 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse137 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse137 (select (store .cse138 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse137 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse137 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (or .cse44 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse140 (store .cse3 v_arrayElimCell_284 0)) (.cse139 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse139 (select (store .cse140 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse139 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse139 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse139 (select (store .cse140 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse139 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse139 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (or .cse44 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse141 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse141 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse141 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse141 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse141 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse141 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse142 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse142 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse142 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse142 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse142 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse142 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse12) (or .cse12 (and (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse143 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse143 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse143 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse143 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse143 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse144 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse144 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse145 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse144 (select (store .cse145 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse144 (select (store .cse145 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse144 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse144 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse146)) (or (and (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse147 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse147 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse147 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse147 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse147 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or .cse12 (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse148 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse148 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (or .cse44 (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse149 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse149 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse149 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse149 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))))) .cse15))) (or .cse4 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse151 (store .cse3 v_arrayElimCell_284 0)) (.cse150 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse150 (select (store .cse151 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store .cse151 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (or .cse12 (and (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse152 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse152 (select .cse7 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse152 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse152 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse152 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse146 (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse153 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse153 (select .cse7 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse154 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse153 (select (store .cse154 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse153 (select (store .cse154 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse153 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse153 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))))) (or .cse12 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse156 (store .cse3 v_arrayElimCell_284 0)) (.cse155 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse155 (select (store .cse156 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse155 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse155 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse155 (select (store .cse156 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse155 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse155 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (or .cse4 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse157 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse157 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse157 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse157 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse157 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (or .cse12 .cse15 (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse158 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse158 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse158 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse158 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))))))) .cse8) (or (and (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse163 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse163 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse163 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse163 (select .cse21 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse164 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse163 (select (store .cse164 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse163 (select (store .cse164 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse163 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse165 (or .cse19 (and (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse166 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse166 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse166 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse166 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (= .cse166 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse167 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse167 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse167 (select .cse21 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse168 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse167 (select (store .cse168 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse167 (select (store .cse168 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse167 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse169 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse169 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse169 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse169 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse15) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse170 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse170 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse170 (select .cse21 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse170 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse171 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse170 (select (store .cse171 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse170 (select (store .cse171 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse170 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse172 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse172 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse172 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse172 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse172 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse172 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse172 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse8) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse173 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse173 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse173 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse173 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse173 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse173 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse8) (or (and (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse174 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse174 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse174 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse174 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse175 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse174 (select (store .cse175 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse174 (select (store .cse175 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse174 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse176 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse176 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse176 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse176 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse176 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse177 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse177 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse177 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse177 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse15) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse178 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse178 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse178 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse178 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse178 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse178 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse179 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse179 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse180 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse179 (select (store .cse180 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store .cse180 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse179 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) .cse8) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse181 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse181 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse181 (select .cse21 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse181 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse182 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse181 (select (store .cse182 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store .cse182 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse181 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse183 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse183 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse183 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse183 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse183 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse15) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse184 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse184 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse184 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse184 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse184 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse184 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse19)) .cse12) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse186 (store .cse3 v_arrayElimCell_284 0)) (.cse185 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse185 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store .cse186 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store .cse186 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse4) (or (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse187 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse187 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse187 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse187 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse12 .cse15 .cse8) (or .cse44 .cse188 .cse4) (or (and (or .cse15 (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse189 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse189 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse189 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse190 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse190 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse190 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or .cse4 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse191 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse191 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse191 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse192 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse192 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse192 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse192 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse4) (or (and (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse193 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse193 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (= .cse193 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse194 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int)) (or (= .cse194 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse195 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse194 (select (store .cse195 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse194 (select (store .cse195 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse194 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse196 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse196 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse196 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse196 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)))))))) .cse4) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int)) (let ((.cse198 (store .cse3 v_arrayElimCell_284 0)) (.cse197 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse197 (select (store .cse198 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse197 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse197 (select (store .cse198 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse197 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse4) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse199 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse199 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse199 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse199 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse201 (store .cse3 v_arrayElimCell_284 0)) (.cse200 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse200 (select (store .cse201 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse200 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse200 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse200 (select (store .cse201 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse200 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))) .cse97)) .cse44) (or .cse12 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse203 (store .cse3 v_arrayElimCell_284 0)) (.cse202 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse202 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse202 (select (store .cse203 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse202 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse202 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse202 (select (store .cse203 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse202 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse8) (or (and (or .cse15 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse204 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse204 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse204 (select .cse21 v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse205 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse206 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse205 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse205 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse205 (select (store .cse206 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse205 (select (store .cse206 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse207 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse207 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse4) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse208 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse209 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse208 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse208 (select (store .cse209 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int)) (let ((.cse210 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse208 (select (store .cse210 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse208 (select (store .cse210 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (= .cse208 (select (store .cse209 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse211 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse211 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse211 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse211 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse212 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse213 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse212 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse212 (select (store .cse213 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse212 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse212 (select (store .cse213 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse214 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse215 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse214 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse214 (select (store .cse215 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int)) (let ((.cse216 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse214 (select (store .cse216 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse214 (select (store .cse216 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (= .cse214 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse214 (select (store .cse215 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse4 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse217 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse218 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse217 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse217 (select (store .cse218 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse217 (select (store .cse218 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse219 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse219 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse220 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse219 (select (store .cse220 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse219 (select (store .cse220 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse221 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse221 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (= .cse221 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse222 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse222 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse222 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse223 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse222 (select (store .cse223 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse222 (select (store .cse223 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))))) .cse4) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse224 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse225 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse224 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse224 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse224 (select (store .cse225 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse224 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse224 (select (store .cse225 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse226 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse227 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse226 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse226 (select (store .cse227 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse226 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse226 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse226 (select (store .cse227 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse97) (or .cse4 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse228 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse229 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse228 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse228 (select (store .cse229 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse228 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse228 (select (store .cse229 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse230 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse230 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse230 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse231 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse231 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int)) (let ((.cse232 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse231 (select (store .cse232 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse231 (select (store .cse232 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))))))) .cse15) (forall ((v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse233 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse233 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int)) (let ((.cse234 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse233 (select (store .cse234 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse233 (select (store .cse234 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (= .cse233 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse235 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse235 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse235 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse235 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse19) (or .cse12 (and .cse236 (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse238 (store .cse3 v_arrayElimCell_284 0)) (.cse237 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse237 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse237 (select (store .cse238 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse237 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse237 (select (store .cse238 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse237 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse8) (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse239 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse239 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse239 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse239 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse239 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse240) .cse8))) (or (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse241 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse241 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse241 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse97) (or (let ((.cse247 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse417 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse418 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse417 (select (store .cse418 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse417 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse417 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse417 (select (store .cse418 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (.cse385 (forall ((v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse415 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse416 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse415 (select (store .cse416 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse415 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse415 (select (store .cse416 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (.cse392 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse413 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse414 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse413 (select (store .cse414 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse413 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse413 (select (store .cse414 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))))) (and (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse244 (store .cse3 v_arrayElimCell_284 0)) (.cse242 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse243 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse242 (select (store .cse243 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse242 (select (store .cse244 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse242 (select (store .cse244 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse242 (select (store .cse243 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse4) (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse245 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse246 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse245 (select (store .cse246 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse245 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse245 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse245 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse245 (select (store .cse246 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or .cse247 .cse4)) .cse8) (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse249 (store .cse3 v_arrayElimCell_284 0)) (.cse248 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse248 (select (store .cse249 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse248 (select (store .cse249 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_281 Int)) (= .cse248 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))) (= .cse248 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse251 (store .cse3 v_arrayElimCell_284 0)) (.cse250 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse250 (select (store .cse251 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse250 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse250 (select (store .cse251 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse250 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse4) (or .cse4 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse253 (store .cse3 v_arrayElimCell_284 0)) (.cse252 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse252 (select (store .cse253 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse252 (select (store .cse253 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse252 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (or .cse4 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse254 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse254 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse254 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse255 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse255 (select .cse7 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse255 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse255 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse256 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse256 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse256 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse256 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse256 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse257 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse257 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse4) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse258 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse258 (select .cse7 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse258 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse259 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse258 (select (store .cse259 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse258 (select (store .cse259 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse258 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse260 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse260 (select .cse7 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse261 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse260 (select (store .cse261 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse260 (select (store .cse261 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse260 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse262 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse262 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_281 Int)) (= .cse262 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))) (= .cse262 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse263 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse263 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_281 Int)) (= .cse263 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))) (= .cse263 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse264 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse264 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse264 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse15) (or (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))) .cse97) (or (and (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse265 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse265 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse265 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse266 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int)) (or (= .cse266 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse267 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse266 (select (store .cse267 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse267 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse266 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse268 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse269 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse268 (select (store .cse269 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse268 (select (store .cse269 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse268 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse270 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse270 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse270 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse270 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)))))))) .cse4) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse272 (store .cse3 v_arrayElimCell_284 0)) (.cse271 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse271 (select (store .cse272 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse271 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse271 (select (store .cse272 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_281 Int)) (= .cse271 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))) (= .cse271 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse273 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse274 (store .cse3 v_arrayElimCell_282 0))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse273 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse273 (select (store .cse274 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse273 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse273 (select (store .cse274 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse275 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse275 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse275 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse275 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse277 (store .cse3 v_arrayElimCell_282 0)) (.cse276 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse276 (select (store .cse277 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse277 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse276 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse278 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse278 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse278 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse279 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse278 (select (store .cse279 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse278 (select (store .cse279 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse278 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or .cse15 (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse280 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse280 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse280 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse281 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int)) (or (= .cse281 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse282 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse281 (select (store .cse282 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse281 (select (store .cse282 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse281 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse281 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse283 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse283 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse15) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse284 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse285 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse284 (select (store .cse285 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse284 (select (store .cse285 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse284 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse284 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse286 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse286 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse286 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse286 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse286 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse287 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse288 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse287 (select (store .cse288 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse287 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse287 (select (store .cse288 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) .cse15) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse289 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse291 (store .cse3 v_arrayElimCell_282 0))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse290 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse289 (select (store .cse290 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse289 (select (store .cse290 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse289 (select (store .cse291 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse289 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse289 (select (store .cse291 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse292 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse292 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse293 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse292 (select (store .cse293 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse292 (select (store .cse293 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse292 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse294 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse294 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse294 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse294 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse295 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse297 (store .cse3 v_arrayElimCell_282 0))) (or (forall ((v_arrayElimCell_283 Int)) (or (= .cse295 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse296 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse295 (select (store .cse296 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse295 (select (store .cse296 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse295 (select (store .cse297 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse295 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse295 (select (store .cse297 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse298 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse298 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse298 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse298 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse298 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)))))))) .cse83) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse299 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse299 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse299 (select (store (store .cse3 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse15)) .cse8) (or (and (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse300 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse301 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse300 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse300 (select (store .cse301 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse300 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse302 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse300 (select (store .cse302 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse300 (select (store .cse302 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse300 (select (store .cse301 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse303 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse304 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse303 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse303 (select (store .cse304 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse303 (select (store .cse304 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse15) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse305 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse306 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse305 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse305 (select (store .cse306 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse305 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse305 (select (store .cse306 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse308 (store .cse3 v_arrayElimCell_286 0)) (.cse307 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse307 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse307 (select (store .cse308 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse307 (select (store .cse308 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse307 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse307 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse309 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse310 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse309 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse309 (select (store .cse310 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse311 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse309 (select (store .cse311 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse309 (select (store .cse311 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse309 (select (store .cse310 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) .cse8) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse312 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse313 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse312 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse312 (select (store .cse313 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse312 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse312 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse312 (select (store .cse313 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse8) (or (and (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse315 (store .cse3 v_arrayElimCell_286 0)) (.cse314 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse316 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse314 (select (store .cse315 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store .cse316 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store .cse315 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store .cse316 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) .cse8) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse318 (store .cse3 v_arrayElimCell_286 0)) (.cse317 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse319 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse317 (select (store .cse318 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse317 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse317 (select (store .cse319 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse317 (select (store .cse318 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse317 (select (store .cse319 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) .cse19) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse321 (store .cse3 v_arrayElimCell_286 0)) (.cse320 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse323 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse320 (select (store .cse321 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse320 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse322 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse320 (select (store .cse322 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse320 (select (store .cse322 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse320 (select (store .cse323 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse320 (select (store .cse321 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse320 (select (store .cse323 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse324 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse325 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse324 (select (store .cse325 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse324 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse324 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse326 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse324 (select (store .cse326 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse324 (select (store .cse326 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse324 (select (store .cse325 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse328 (store .cse3 v_arrayElimCell_286 0)) (.cse327 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse327 (select (store .cse328 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse327 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse327 (select (store .cse328 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse327 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse327 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse329 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse330 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse329 (select (store .cse330 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse329 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse329 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse329 (select (store .cse330 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse331 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse332 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse331 (select (store .cse332 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse331 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse333 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse331 (select (store .cse333 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse331 (select (store .cse333 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse331 (select (store .cse332 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse334 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse335 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse334 (select (store .cse335 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse334 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse334 (select (store .cse335 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse15)) .cse8) (or .cse19 (and (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse336 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse337 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse336 (select (store .cse337 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse338 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse336 (select (store .cse338 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse336 (select (store .cse338 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse336 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse336 (select (store .cse337 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse339 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse340 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse339 (select (store .cse340 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse339 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse339 (select (store .cse340 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse15) (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse341 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse342 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse341 (select (store .cse342 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse341 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse343 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse341 (select (store .cse343 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse341 (select (store .cse343 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse341 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse341 (select (store .cse342 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse344 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse345 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse344 (select (store .cse345 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse344 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (= .cse344 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse344 (select (store .cse345 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse347 (store .cse3 v_arrayElimCell_286 0)) (.cse346 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse348 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse346 (select (store .cse347 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse346 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse346 (select (store .cse348 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse346 (select (store .cse347 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse346 (select (store .cse348 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) .cse8) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse350 (store .cse3 v_arrayElimCell_286 0)) (.cse349 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse352 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse349 (select (store .cse350 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse351 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse349 (select (store .cse351 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse349 (select (store .cse351 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse349 (select (store .cse352 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse349 (select (store .cse350 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse349 (select (store .cse352 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse354 (store .cse3 v_arrayElimCell_286 0)) (.cse353 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse353 (select (store .cse354 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse355 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse353 (select (store .cse355 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse353 (select (store .cse355 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse353 (select (store .cse354 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse353 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse357 (store .cse3 v_arrayElimCell_286 0)) (.cse356 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse356 (select (store .cse357 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse356 (select (store .cse357 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse356 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse356 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse356 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse359 (store .cse3 v_arrayElimCell_286 0)) (.cse358 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse358 (select (store .cse359 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse358 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse358 (select (store .cse359 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse358 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse361 (store .cse3 v_arrayElimCell_286 0)) (.cse360 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse360 (select (store .cse361 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse360 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse362 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse360 (select (store .cse362 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse360 (select (store .cse362 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse360 (select (store .cse361 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse360 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse364 (store .cse3 v_arrayElimCell_286 0)) (.cse363 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse363 (select (store .cse364 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse363 (select (store .cse364 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse363 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) .cse15)) .cse8) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse366 (store .cse3 v_arrayElimCell_286 0)) (.cse365 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse367 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse365 (select (store .cse366 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse365 (select (store .cse367 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse365 (select (store .cse366 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse365 (select (store .cse367 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) .cse15)) .cse83) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse368 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse369 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse368 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse368 (select (store .cse369 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse368 (select .cse21 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse368 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse370 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse368 (select (store .cse370 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse368 (select (store .cse370 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse368 (select (store .cse369 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or (and (or .cse15 (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse371 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse372 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse371 (select (store .cse372 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse371 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse371 (select (store .cse372 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse373 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse374 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse373 (select (store .cse374 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse373 (select .cse21 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (= .cse373 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse373 (select (store .cse374 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse375 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse376 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse375 (select (store .cse376 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse375 (select .cse21 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse375 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse377 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse375 (select (store .cse377 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store .cse377 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse375 (select (store .cse376 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse378 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse379 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse378 (select (store .cse379 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse378 (select .cse21 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse380 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse378 (select (store .cse380 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse378 (select (store .cse380 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse378 (select (store .cse379 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) .cse19) (or .cse15 (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse381 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse382 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse381 (select (store .cse382 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse381 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse381 (select (store .cse382 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse8) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse383 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse384 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse383 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse383 (select (store .cse384 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse383 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse383 (select (store .cse384 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse15) (or (and (or .cse247 .cse8) (or .cse385 .cse19) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse386 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse387 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse386 (select (store .cse387 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse386 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse388 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse386 (select (store .cse388 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse386 (select (store .cse388 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse386 (select (store .cse387 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse389 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse390 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse389 (select (store .cse390 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse391 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse389 (select (store .cse391 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse389 (select (store .cse391 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse389 (select (store .cse390 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or .cse392 .cse8)) .cse4) (or .cse19 (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse393 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse394 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse393 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse393 (select (store .cse394 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse393 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse393 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse393 (select (store .cse394 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (or .cse385 .cse19 .cse4) (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse395 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse396 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse395 (select (store .cse396 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse395 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse395 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse395 (select (store .cse396 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or .cse4 .cse392)) .cse8) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse399 (store .cse3 v_arrayElimCell_284 0)) (.cse397 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse398 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse397 (select (store .cse398 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse397 (select (store .cse399 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse397 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse397 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse397 (select (store .cse399 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse397 (select (store .cse398 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse8) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse400 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse401 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse400 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse400 (select (store .cse401 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse400 (select .cse21 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse402 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse400 (select (store .cse402 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse400 (select (store .cse402 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse400 (select (store .cse401 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse403 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse404 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse403 (select (store .cse7 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (= .cse403 (select (store .cse404 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse403 (select .cse21 v_antiDerIndex_entry0_1)) (= .cse403 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse403 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse403 (select (store .cse404 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse8) (or .cse4 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse407 (store .cse3 v_arrayElimCell_284 0)) (.cse405 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse406 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse405 (select (store .cse406 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse405 (select (store .cse407 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse405 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse405 (select (store .cse407 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse405 (select (store .cse406 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse410 (store .cse3 v_arrayElimCell_284 0)) (.cse408 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse409 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse408 (select (store .cse409 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse408 (select (store .cse410 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse408 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse408 (select (store .cse410 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse408 (select (store .cse409 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse8) (or (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse411 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse412 (store .cse3 v_arrayElimCell_286 0))) (or (= .cse411 (select (store .cse412 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse411 (select (store .cse412 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse97))) .cse12) (or (and (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse419 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse419 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse419 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse419 (select .cse7 v_antiDerIndex_entry0_1)) (= .cse419 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse419 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse12) .cse420) .cse8) (or (and (or (and (or (and (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse421 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse421 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse421 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse421 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) .cse15) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse422 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse422 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (= .cse422 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))) (= .cse422 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse422 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse423 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse423 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse424 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse423 (select (store .cse424 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse423 (select (store .cse424 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse423 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse423 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse425 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse425 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse425 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse425 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (or (= .cse425 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse425 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse426 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse426 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse426 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse427 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse426 (select (store .cse427 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse426 (select (store .cse427 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse426 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse426 (select (store (store .cse3 v_arrayElimCell_282 0) v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)))))) .cse8) (or .cse19 (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse428 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse429 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse428 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse428 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse428 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse428 (select (store .cse429 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse428 (select (store .cse429 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1)))))) .cse165 (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse430 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse432 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse430 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse430 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse431 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse430 (select (store .cse431 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse430 (select (store .cse431 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse430 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse430 (select (store .cse432 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse430 (select (store .cse432 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse433 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse434 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse433 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse433 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse433 (select (store .cse434 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse433 (select (store .cse434 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) .cse15) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse435 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse436 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse435 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse435 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse435 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse435 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse435 (select (store .cse436 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse435 (select (store .cse436 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) .cse8) (or (and (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse437 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse437 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse438 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse437 (select (store .cse438 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse437 (select (store .cse438 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse437 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse437 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse15 (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse439 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse439 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse439 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse439 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse440 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse440 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse440 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse440 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (= .cse440 (select (store (store .cse3 v_arrayElimCell_284 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse441 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse441 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (or (= .cse441 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_284 Int)) (let ((.cse442 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse441 (select (store .cse442 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse441 (select (store .cse442 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse441 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse441 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse19) (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse443 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse445 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse443 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_284 Int)) (let ((.cse444 (store .cse3 v_arrayElimCell_284 0))) (or (= .cse443 (select (store .cse444 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse443 (select (store .cse444 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse443 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse443 (select (store .cse445 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse443 (select (store .cse445 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_281 Int) (v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse446 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse447 (store .cse3 v_arrayElimCell_282 0))) (or (= .cse446 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store .cse447 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store .cse447 v_arrayElimCell_281 0) v_antiDerIndex_entry0_1))))) .cse8)) .cse12) (or .cse44 (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse448 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse448 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse448 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse448 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse448 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or .cse188 .cse4))) (or (and (or .cse44 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse450 (store .cse3 v_arrayElimCell_284 0)) (.cse449 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse449 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse449 (select (store .cse450 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse449 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse449 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse449 (select (store .cse450 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse449 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse452 (store .cse3 v_arrayElimCell_284 0)) (.cse451 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse451 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse451 (select (store .cse452 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse451 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse451 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse451 (select (store .cse452 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse451 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse451 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse454 (store .cse3 v_arrayElimCell_284 0)) (.cse453 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse453 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse453 (select (store .cse454 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse453 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse453 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse453 (select (store .cse454 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse453 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse12)) .cse8) (or .cse12 (and .cse236 (or (and .cse240 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse455 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse455 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse455 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse455 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse455 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse8) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse457 (store .cse3 v_arrayElimCell_284 0)) (.cse456 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse456 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse456 (select (store .cse457 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse456 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse456 (select (store .cse457 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse456 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse8))) (or (and (or .cse44 (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse458 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse458 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse458 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse458 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (or .cse12 (forall ((v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse459 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse459 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse459 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse459 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse460 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse460 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse460 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse460 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse460 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse15 .cse8) (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_arrayElimCell_284 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse461 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse461 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse461 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse461 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse461 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse461 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse461 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse44 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse462 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse462 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse462 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse462 (select .cse42 v_antiDerIndex_entry0_1)) (= .cse462 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse462 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) .cse420 (or .cse12 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_284 Int) (v_arrayElimCell_286 Int)) (let ((.cse463 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse463 (select (store (store .cse3 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse463 (select (store (store .cse3 v_arrayElimCell_284 0) v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse463 (select (store (store .cse3 v_arrayElimCell_282 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse463 (select (store .cse2 v_arrayElimCell_283 0) v_antiDerIndex_entry0_1)) (= .cse463 (select (store .cse2 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))))) .cse8)) .cse83)))))) is different from false