/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/dll2n_append_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 17:01:16,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 17:01:16,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 17:01:16,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 17:01:16,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 17:01:16,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 17:01:16,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 17:01:16,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 17:01:16,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 17:01:16,331 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 17:01:16,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 17:01:16,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 17:01:16,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 17:01:16,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 17:01:16,333 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 17:01:16,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 17:01:16,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 17:01:16,333 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 17:01:16,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 17:01:16,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 17:01:16,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 17:01:16,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 17:01:16,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 17:01:16,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 17:01:16,335 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 17:01:16,335 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 17:01:16,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 17:01:16,335 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 17:01:16,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 17:01:16,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 17:01:16,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 17:01:16,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 17:01:16,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 17:01:16,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 17:01:16,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 17:01:16,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 17:01:16,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 17:01:16,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 17:01:16,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 17:01:16,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 17:01:16,337 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 17:01:16,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 17:01:16,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 17:01:16,338 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: Use bitabs translation -> true [2023-12-19 17:01:16,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 17:01:16,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 17:01:16,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 17:01:16,545 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 17:01:16,545 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 17:01:16,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_append_equal.i [2023-12-19 17:01:17,576 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 17:01:17,777 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 17:01:17,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_append_equal.i [2023-12-19 17:01:17,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd40b3a1a/f4479ccf8a9148faa73a8378381cb4c9/FLAG5b528a07d [2023-12-19 17:01:17,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd40b3a1a/f4479ccf8a9148faa73a8378381cb4c9 [2023-12-19 17:01:17,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 17:01:17,808 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 17:01:17,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 17:01:17,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 17:01:17,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 17:01:17,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:01:17" (1/1) ... [2023-12-19 17:01:17,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dfd84f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:17, skipping insertion in model container [2023-12-19 17:01:17,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:01:17" (1/1) ... [2023-12-19 17:01:17,850 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 17:01:18,068 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_append_equal.i[24333,24346] [2023-12-19 17:01:18,074 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 17:01:18,090 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 17:01:18,121 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_append_equal.i[24333,24346] [2023-12-19 17:01:18,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 17:01:18,141 INFO L206 MainTranslator]: Completed translation [2023-12-19 17:01:18,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:18 WrapperNode [2023-12-19 17:01:18,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 17:01:18,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 17:01:18,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 17:01:18,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 17:01:18,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:18" (1/1) ... [2023-12-19 17:01:18,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:18" (1/1) ... [2023-12-19 17:01:18,181 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 124 [2023-12-19 17:01:18,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 17:01:18,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 17:01:18,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 17:01:18,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 17:01:18,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:18" (1/1) ... [2023-12-19 17:01:18,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:18" (1/1) ... [2023-12-19 17:01:18,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:18" (1/1) ... [2023-12-19 17:01:18,225 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 6, 13]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 1, 8]. [2023-12-19 17:01:18,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:18" (1/1) ... [2023-12-19 17:01:18,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:18" (1/1) ... [2023-12-19 17:01:18,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:18" (1/1) ... [2023-12-19 17:01:18,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:18" (1/1) ... [2023-12-19 17:01:18,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:18" (1/1) ... [2023-12-19 17:01:18,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:18" (1/1) ... [2023-12-19 17:01:18,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 17:01:18,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 17:01:18,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 17:01:18,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 17:01:18,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:18" (1/1) ... [2023-12-19 17:01:18,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 17:01:18,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:01:18,280 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) [2023-12-19 17:01:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 17:01:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 17:01:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 17:01:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 17:01:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 17:01:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 17:01:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-19 17:01:18,305 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-19 17:01:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-19 17:01:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 17:01:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-19 17:01:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-19 17:01:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-19 17:01:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-19 17:01:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-19 17:01:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-19 17:01:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-19 17:01:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-19 17:01:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-19 17:01:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-19 17:01:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-19 17:01:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 17:01:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 17:01:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 17:01:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 17:01:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 17:01:18,298 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 [2023-12-19 17:01:18,398 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 17:01:18,400 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 17:01:18,577 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 17:01:18,606 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 17:01:18,607 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-19 17:01:18,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:01:18 BoogieIcfgContainer [2023-12-19 17:01:18,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 17:01:18,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 17:01:18,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 17:01:18,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 17:01:18,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:01:17" (1/3) ... [2023-12-19 17:01:18,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ce0a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:01:18, skipping insertion in model container [2023-12-19 17:01:18,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:01:18" (2/3) ... [2023-12-19 17:01:18,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ce0a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:01:18, skipping insertion in model container [2023-12-19 17:01:18,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:01:18" (3/3) ... [2023-12-19 17:01:18,614 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2023-12-19 17:01:18,630 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 17:01:18,630 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 17:01:18,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 17:01:18,674 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5fa495f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 17:01:18,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 17:01:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:01:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-19 17:01:18,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:01:18,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:01:18,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:01:18,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:01:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1765087503, now seen corresponding path program 1 times [2023-12-19 17:01:18,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:01:18,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725520497] [2023-12-19 17:01:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:01:18,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:01:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:18,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 17:01:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:01:18,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:01:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725520497] [2023-12-19 17:01:18,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725520497] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:01:18,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:01:18,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 17:01:18,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699463982] [2023-12-19 17:01:18,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:01:18,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 17:01:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:01:18,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 17:01:18,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 17:01:18,894 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 17:01:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:01:18,956 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2023-12-19 17:01:18,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 17:01:18,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-12-19 17:01:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:01:18,963 INFO L225 Difference]: With dead ends: 48 [2023-12-19 17:01:18,963 INFO L226 Difference]: Without dead ends: 22 [2023-12-19 17:01:18,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 17:01:18,967 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:01:18,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:01:18,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-19 17:01:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-19 17:01:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:01:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-19 17:01:18,990 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2023-12-19 17:01:18,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:01:18,990 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-19 17:01:18,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 17:01:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-19 17:01:18,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-19 17:01:18,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:01:18,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:01:18,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 17:01:18,992 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:01:18,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:01:18,993 INFO L85 PathProgramCache]: Analyzing trace with hash 851795797, now seen corresponding path program 1 times [2023-12-19 17:01:18,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:01:18,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288090321] [2023-12-19 17:01:18,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:01:18,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:01:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:19,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 17:01:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:01:19,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:01:19,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288090321] [2023-12-19 17:01:19,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288090321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:01:19,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:01:19,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 17:01:19,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207891427] [2023-12-19 17:01:19,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:01:19,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 17:01:19,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:01:19,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 17:01:19,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 17:01:19,202 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 17:01:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:01:19,247 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2023-12-19 17:01:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 17:01:19,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-12-19 17:01:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:01:19,249 INFO L225 Difference]: With dead ends: 43 [2023-12-19 17:01:19,249 INFO L226 Difference]: Without dead ends: 27 [2023-12-19 17:01:19,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 17:01:19,250 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:01:19,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:01:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-19 17:01:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-12-19 17:01:19,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:01:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-19 17:01:19,256 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 13 [2023-12-19 17:01:19,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:01:19,257 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-19 17:01:19,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 17:01:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-19 17:01:19,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-19 17:01:19,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:01:19,257 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:01:19,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 17:01:19,258 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:01:19,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:01:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash -853542195, now seen corresponding path program 1 times [2023-12-19 17:01:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:01:19,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614457873] [2023-12-19 17:01:19,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:01:19,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:01:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:19,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:01:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:19,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-19 17:01:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:01:19,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:01:19,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614457873] [2023-12-19 17:01:19,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614457873] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:01:19,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:01:19,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 17:01:19,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597314847] [2023-12-19 17:01:19,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:01:19,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 17:01:19,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:01:19,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 17:01:19,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 17:01:19,354 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:01:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:01:19,393 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2023-12-19 17:01:19,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 17:01:19,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-12-19 17:01:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:01:19,395 INFO L225 Difference]: With dead ends: 48 [2023-12-19 17:01:19,395 INFO L226 Difference]: Without dead ends: 27 [2023-12-19 17:01:19,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 17:01:19,399 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:01:19,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:01:19,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-19 17:01:19,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-12-19 17:01:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:01:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-12-19 17:01:19,408 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 21 [2023-12-19 17:01:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:01:19,408 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-12-19 17:01:19,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:01:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-12-19 17:01:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-19 17:01:19,410 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:01:19,410 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:01:19,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 17:01:19,410 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:01:19,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:01:19,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1864659445, now seen corresponding path program 1 times [2023-12-19 17:01:19,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:01:19,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983461156] [2023-12-19 17:01:19,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:01:19,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:01:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:19,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:01:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:19,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-19 17:01:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:01:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:01:19,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983461156] [2023-12-19 17:01:19,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983461156] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:01:19,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77002773] [2023-12-19 17:01:19,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:01:19,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:01:19,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:01:19,602 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) [2023-12-19 17:01:19,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 17:01:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:19,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-19 17:01:19,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:01:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:01:19,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:01:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:01:19,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77002773] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:01:19,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:01:19,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-12-19 17:01:19,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222971298] [2023-12-19 17:01:19,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:01:19,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 17:01:19,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:01:19,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 17:01:19,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-19 17:01:19,821 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-19 17:01:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:01:19,872 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2023-12-19 17:01:19,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 17:01:19,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2023-12-19 17:01:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:01:19,874 INFO L225 Difference]: With dead ends: 44 [2023-12-19 17:01:19,874 INFO L226 Difference]: Without dead ends: 28 [2023-12-19 17:01:19,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-19 17:01:19,879 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:01:19,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 72 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:01:19,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-19 17:01:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-19 17:01:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:01:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-12-19 17:01:19,889 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 21 [2023-12-19 17:01:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:01:19,890 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-12-19 17:01:19,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-19 17:01:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-12-19 17:01:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-19 17:01:19,891 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:01:19,891 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:01:19,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 17:01:20,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:01:20,100 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:01:20,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:01:20,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1775178627, now seen corresponding path program 1 times [2023-12-19 17:01:20,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:01:20,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571015909] [2023-12-19 17:01:20,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:01:20,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:01:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:20,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:01:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:20,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 17:01:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 17:01:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-19 17:01:20,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:01:20,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571015909] [2023-12-19 17:01:20,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571015909] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:01:20,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613700439] [2023-12-19 17:01:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:01:20,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:01:20,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:01:20,474 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) [2023-12-19 17:01:20,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 17:01:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:20,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-19 17:01:20,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:01:20,869 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 16 treesize of output 8 [2023-12-19 17:01:20,881 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:01:20,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:01:20,912 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 8 treesize of output 4 [2023-12-19 17:01:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-19 17:01:20,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613700439] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:01:20,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:01:20,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 18 [2023-12-19 17:01:20,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575166093] [2023-12-19 17:01:20,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:01:20,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-19 17:01:20,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:01:20,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-19 17:01:20,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-12-19 17:01:20,944 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-19 17:01:24,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:01:28,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:01:32,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:01:37,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:01:41,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:01:45,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:01:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:01:45,276 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2023-12-19 17:01:45,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 17:01:45,277 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 29 [2023-12-19 17:01:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:01:45,277 INFO L225 Difference]: With dead ends: 52 [2023-12-19 17:01:45,277 INFO L226 Difference]: Without dead ends: 31 [2023-12-19 17:01:45,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2023-12-19 17:01:45,278 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2023-12-19 17:01:45,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 207 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2023-12-19 17:01:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-19 17:01:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-19 17:01:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:01:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-12-19 17:01:45,282 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 29 [2023-12-19 17:01:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:01:45,282 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-12-19 17:01:45,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-19 17:01:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-12-19 17:01:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-19 17:01:45,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:01:45,283 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:01:45,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-19 17:01:45,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:01:45,484 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:01:45,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:01:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2018592169, now seen corresponding path program 1 times [2023-12-19 17:01:45,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:01:45,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483921053] [2023-12-19 17:01:45,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:01:45,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:01:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:01:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:45,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 17:01:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:45,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 17:01:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-19 17:01:45,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:01:45,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483921053] [2023-12-19 17:01:45,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483921053] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:01:45,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681207565] [2023-12-19 17:01:45,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:01:45,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:01:45,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:01:45,681 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) [2023-12-19 17:01:45,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 17:01:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:45,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-19 17:01:45,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:01:45,884 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 16 treesize of output 8 [2023-12-19 17:01:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:01:45,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:01:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-19 17:01:45,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681207565] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:01:45,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:01:45,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 11 [2023-12-19 17:01:45,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223663965] [2023-12-19 17:01:45,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:01:45,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 17:01:45,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:01:45,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 17:01:45,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-19 17:01:45,917 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-19 17:01:49,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:01:53,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:01:57,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:02:01,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:02:05,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:02:10,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:02:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:02:10,110 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-12-19 17:02:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 17:02:10,110 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2023-12-19 17:02:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:02:10,111 INFO L225 Difference]: With dead ends: 38 [2023-12-19 17:02:10,111 INFO L226 Difference]: Without dead ends: 35 [2023-12-19 17:02:10,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-12-19 17:02:10,112 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2023-12-19 17:02:10,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 130 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 24.1s Time] [2023-12-19 17:02:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-19 17:02:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-12-19 17:02:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:02:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-12-19 17:02:10,118 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 32 [2023-12-19 17:02:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:02:10,118 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-12-19 17:02:10,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-19 17:02:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-12-19 17:02:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-19 17:02:10,119 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:02:10,119 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:02:10,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-19 17:02:10,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:02:10,328 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:02:10,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:02:10,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2018590495, now seen corresponding path program 1 times [2023-12-19 17:02:10,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:02:10,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637299337] [2023-12-19 17:02:10,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:02:10,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:02:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:11,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:02:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:11,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 17:02:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:11,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 17:02:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:02:11,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:02:11,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637299337] [2023-12-19 17:02:11,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637299337] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:02:11,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075317157] [2023-12-19 17:02:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:02:11,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:02:11,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:02:11,550 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) [2023-12-19 17:02:11,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 17:02:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:11,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 91 conjunts are in the unsatisfiable core [2023-12-19 17:02:11,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:02:11,963 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 [2023-12-19 17:02:12,178 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:02:12,178 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 [2023-12-19 17:02:12,240 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 18 treesize of output 7 [2023-12-19 17:02:12,283 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 [2023-12-19 17:02:12,531 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 11 treesize of output 3 [2023-12-19 17:02:12,535 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 15 treesize of output 7 [2023-12-19 17:02:12,712 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-19 17:02:12,712 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 20 treesize of output 22 [2023-12-19 17:02:12,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-19 17:02:12,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:02:12,953 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-12-19 17:02:12,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-19 17:02:13,005 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 19 treesize of output 11 [2023-12-19 17:02:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:02:13,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:02:21,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075317157] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:02:21,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:02:21,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2023-12-19 17:02:21,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981078121] [2023-12-19 17:02:21,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:02:21,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-19 17:02:21,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:02:21,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-19 17:02:21,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2167, Unknown=25, NotChecked=0, Total=2352 [2023-12-19 17:02:21,980 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:02:23,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:02:23,018 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2023-12-19 17:02:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-19 17:02:23,019 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2023-12-19 17:02:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:02:23,019 INFO L225 Difference]: With dead ends: 49 [2023-12-19 17:02:23,019 INFO L226 Difference]: Without dead ends: 47 [2023-12-19 17:02:23,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=297, Invalid=3584, Unknown=25, NotChecked=0, Total=3906 [2023-12-19 17:02:23,021 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 54 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 17:02:23,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 251 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 17:02:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-19 17:02:23,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2023-12-19 17:02:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:02:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-12-19 17:02:23,025 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2023-12-19 17:02:23,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:02:23,025 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-12-19 17:02:23,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:02:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-12-19 17:02:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-19 17:02:23,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:02:23,026 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:02:23,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-19 17:02:23,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:02:23,236 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:02:23,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:02:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1459785074, now seen corresponding path program 1 times [2023-12-19 17:02:23,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:02:23,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318039725] [2023-12-19 17:02:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:02:23,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:02:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:23,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:02:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:23,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 17:02:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:23,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 17:02:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 17:02:23,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:02:23,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318039725] [2023-12-19 17:02:23,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318039725] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:02:23,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43128821] [2023-12-19 17:02:23,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:02:23,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:02:23,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:02:23,969 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) [2023-12-19 17:02:23,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-19 17:02:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:24,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-19 17:02:24,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:02:24,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:02:24,253 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:02:24,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2023-12-19 17:02:24,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-19 17:02:24,335 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-19 17:02:24,335 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 52 treesize of output 49 [2023-12-19 17:02:24,451 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 60 treesize of output 18 [2023-12-19 17:02:24,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:02:24,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:02:24,524 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 68 treesize of output 51 [2023-12-19 17:02:24,545 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-12-19 17:02:24,546 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 2 case distinctions, treesize of input 34 treesize of output 36 [2023-12-19 17:02:24,772 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2023-12-19 17:02:24,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 54 [2023-12-19 17:02:24,794 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-12-19 17:02:24,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 93 [2023-12-19 17:02:24,805 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 35 treesize of output 27 [2023-12-19 17:02:24,841 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 48 treesize of output 32 [2023-12-19 17:02:24,843 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 36 treesize of output 24 [2023-12-19 17:02:24,882 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 30 treesize of output 12 [2023-12-19 17:02:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:02:24,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:02:25,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43128821] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:02:25,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:02:25,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 37 [2023-12-19 17:02:25,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347966435] [2023-12-19 17:02:25,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:02:25,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-19 17:02:25,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:02:25,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-19 17:02:25,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1767, Unknown=1, NotChecked=0, Total=1892 [2023-12-19 17:02:25,321 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 37 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-19 17:02:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:02:26,399 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2023-12-19 17:02:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-19 17:02:26,400 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 34 [2023-12-19 17:02:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:02:26,400 INFO L225 Difference]: With dead ends: 54 [2023-12-19 17:02:26,400 INFO L226 Difference]: Without dead ends: 45 [2023-12-19 17:02:26,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=287, Invalid=3252, Unknown=1, NotChecked=0, Total=3540 [2023-12-19 17:02:26,402 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 66 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 17:02:26,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 320 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 17:02:26,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-19 17:02:26,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2023-12-19 17:02:26,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:02:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-12-19 17:02:26,416 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 34 [2023-12-19 17:02:26,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:02:26,416 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-12-19 17:02:26,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-19 17:02:26,416 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-12-19 17:02:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-19 17:02:26,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:02:26,417 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:02:26,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-19 17:02:26,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:02:26,623 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:02:26,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:02:26,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1013232572, now seen corresponding path program 1 times [2023-12-19 17:02:26,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:02:26,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500151401] [2023-12-19 17:02:26,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:02:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:02:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:27,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:02:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:27,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 17:02:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:27,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 17:02:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:02:27,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:02:27,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500151401] [2023-12-19 17:02:27,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500151401] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:02:27,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026931335] [2023-12-19 17:02:27,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:02:27,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:02:27,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:02:27,977 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) [2023-12-19 17:02:27,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-19 17:02:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:28,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 97 conjunts are in the unsatisfiable core [2023-12-19 17:02:28,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:02:28,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:02:28,606 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:02:28,607 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 [2023-12-19 17:02:28,660 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 13 treesize of output 9 [2023-12-19 17:02:28,666 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 22 treesize of output 7 [2023-12-19 17:02:28,721 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-19 17:02:28,722 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 57 [2023-12-19 17:02:28,728 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 28 treesize of output 11 [2023-12-19 17:02:28,906 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 42 treesize of output 14 [2023-12-19 17:02:28,909 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 15 treesize of output 3 [2023-12-19 17:02:28,912 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 15 treesize of output 7 [2023-12-19 17:02:28,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:02:28,994 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 50 treesize of output 39 [2023-12-19 17:02:29,007 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-12-19 17:02:29,007 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 34 treesize of output 36 [2023-12-19 17:02:29,022 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 19 [2023-12-19 17:02:29,244 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 58 treesize of output 16 [2023-12-19 17:02:29,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-12-19 17:02:29,367 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 23 treesize of output 15 [2023-12-19 17:02:29,369 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 19 treesize of output 11 [2023-12-19 17:02:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:02:29,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:02:29,446 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1468) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1469) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-19 17:02:29,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026931335] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:02:29,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:02:29,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 46 [2023-12-19 17:02:29,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092941720] [2023-12-19 17:02:29,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:02:29,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-19 17:02:29,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:02:29,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-19 17:02:29,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2252, Unknown=42, NotChecked=96, Total=2550 [2023-12-19 17:02:29,831 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 46 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 36 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:02:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:02:30,862 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2023-12-19 17:02:30,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-19 17:02:30,863 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 36 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-12-19 17:02:30,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:02:30,863 INFO L225 Difference]: With dead ends: 54 [2023-12-19 17:02:30,863 INFO L226 Difference]: Without dead ends: 52 [2023-12-19 17:02:30,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=309, Invalid=3681, Unknown=46, NotChecked=124, Total=4160 [2023-12-19 17:02:30,865 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 17:02:30,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 272 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 17:02:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-19 17:02:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2023-12-19 17:02:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:02:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2023-12-19 17:02:30,870 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2023-12-19 17:02:30,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:02:30,871 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2023-12-19 17:02:30,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 36 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:02:30,871 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2023-12-19 17:02:30,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-19 17:02:30,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:02:30,871 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:02:30,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 17:02:31,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:02:31,074 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:02:31,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:02:31,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1241039849, now seen corresponding path program 1 times [2023-12-19 17:02:31,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:02:31,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067524030] [2023-12-19 17:02:31,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:02:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:02:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:32,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:02:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:32,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 17:02:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:32,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 17:02:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:02:33,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:02:33,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067524030] [2023-12-19 17:02:33,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067524030] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:02:33,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806858715] [2023-12-19 17:02:33,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:02:33,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:02:33,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:02:33,025 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) [2023-12-19 17:02:33,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-19 17:02:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:02:33,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 135 conjunts are in the unsatisfiable core [2023-12-19 17:02:33,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:02:33,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:02:33,577 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 18 treesize of output 7 [2023-12-19 17:02:33,818 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:02:33,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2023-12-19 17:02:33,828 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 [2023-12-19 17:02:33,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-19 17:02:33,896 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 13 treesize of output 9 [2023-12-19 17:02:33,906 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 [2023-12-19 17:02:33,982 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-19 17:02:33,982 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 118 treesize of output 103 [2023-12-19 17:02:33,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 17 [2023-12-19 17:02:33,996 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 30 treesize of output 13 [2023-12-19 17:02:34,229 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 81 treesize of output 25 [2023-12-19 17:02:34,233 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 17 treesize of output 3 [2023-12-19 17:02:34,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:02:34,240 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 7 treesize of output 3 [2023-12-19 17:02:34,371 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-12-19 17:02:34,372 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 2 case distinctions, treesize of input 34 treesize of output 36 [2023-12-19 17:02:38,507 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4))) (let ((.cse5 (not (= .cse3 .cse6))) (.cse7 (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse6))) (.cse8 (not (= 0 .cse6)))) (or (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse0 (select |c_#memory_int#2| .cse0))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse3) .cse4)) (.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse1 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse1) 0) 1) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (not (= .cse1 .cse3)) (not (= .cse1 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|)))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)))) (and .cse5 (= (select (select |c_#memory_int#2| .cse6) 0) 1) .cse7 .cse8) (and .cse5 .cse7 (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse9 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse6) 0) 1) (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse9 (select |c_#memory_int#2| .cse9))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse9)))) .cse8)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4) 0) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse10 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse3) .cse4) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse10 (select |c_#memory_$Pointer$#2.offset| .cse10))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse10))))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))) is different from false [2023-12-19 17:02:38,513 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4))) (let ((.cse5 (not (= .cse3 .cse6))) (.cse7 (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse6))) (.cse8 (not (= 0 .cse6)))) (or (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse0 (select |c_#memory_int#2| .cse0))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse3) .cse4)) (.cse2 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse1 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse1) 0) 1) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (not (= .cse1 .cse3)) (not (= .cse1 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|)))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)))) (and .cse5 (= (select (select |c_#memory_int#2| .cse6) 0) 1) .cse7 .cse8) (and .cse5 .cse7 (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse9 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse6) 0) 1) (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse9 (select |c_#memory_int#2| .cse9))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse9)))) .cse8)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4) 0) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse10 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse3) .cse4) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse10 (select |c_#memory_$Pointer$#2.offset| .cse10))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse10))))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))) is different from true [2023-12-19 17:02:39,091 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2023-12-19 17:02:39,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 241 treesize of output 100 [2023-12-19 17:02:39,113 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2023-12-19 17:02:39,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 348 treesize of output 199 [2023-12-19 17:02:39,121 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 92 [2023-12-19 17:02:39,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:02:39,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 96 [2023-12-19 17:02:39,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 25 [2023-12-19 17:02:39,138 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 66 treesize of output 21 [2023-12-19 17:02:39,238 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 152 treesize of output 112 [2023-12-19 17:02:39,241 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 116 treesize of output 84 [2023-12-19 17:02:39,355 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-19 17:02:39,355 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 30 [2023-12-19 17:02:39,360 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 9 treesize of output 3 [2023-12-19 17:02:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:02:39,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:02:39,574 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1725 (Array Int Int)) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| Int) (v_ArrVal_1730 Int) (v_ArrVal_1729 (Array Int Int)) (v_ArrVal_1728 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1730)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1725) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1729) .cse1) .cse2)) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1728) .cse1) .cse2))))) is different from false [2023-12-19 17:02:40,308 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1725 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_30| Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| Int) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1730 Int) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| Int) (v_ArrVal_1729 (Array Int Int)) (v_ArrVal_1728 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1742)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (select (select .cse8 .cse3) .cse4))) (let ((.cse0 (select .cse8 .cse5)) (.cse2 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1741)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_30| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36|) 0)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_30| (select (select .cse2 .cse3) .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#2| .cse5 (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1740) .cse5) .cse1 v_ArrVal_1730)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1725) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse5 (store .cse0 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1729) .cse6) .cse7)) (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse5 (store (select .cse2 .cse5) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_36| v_ArrVal_1728) .cse6) .cse7))))))))) is different from false [2023-12-19 17:02:40,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806858715] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:02:40,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:02:40,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 52 [2023-12-19 17:02:40,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351146241] [2023-12-19 17:02:40,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:02:40,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-19 17:02:40,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:02:40,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-19 17:02:40,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3134, Unknown=4, NotChecked=342, Total=3660 [2023-12-19 17:02:40,312 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 52 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:02:45,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:02:45,492 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ (select .cse15 0) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse8))) (let ((.cse1 (= (select (select |c_#memory_int#2| .cse11) 0) 1)) (.cse0 (not (= .cse3 .cse11))) (.cse10 (not (= 0 .cse11))) (.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse8) 0))) (and .cse0 (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 .cse2 (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse9 (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse11)))) (or (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse5 (select |c_#memory_int#2| .cse5))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse6 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse3) .cse8)) (.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse6 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse6) 0) 1) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse7) (not (= .cse6 .cse3)) (not (= .cse6 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse7 (select |c_#memory_$Pointer$#2.base| .cse7)) |c_#memory_$Pointer$#2.base|)))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse5)))) (and .cse0 .cse1 .cse9 .cse10) (and .cse0 .cse9 (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse11) 0) 1) (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse12 (select |c_#memory_int#2| .cse12))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse12)))) .cse10))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse13)) (= (select |c_#valid| .cse13) 1) (not (= .cse4 .cse13)) .cse10 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse13) 0)) (= (select |c_#valid| .cse11) 1) (or .cse2 (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse14 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse3) .cse8) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse14 (select |c_#memory_$Pointer$#2.offset| .cse14))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse14))))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (= (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2023-12-19 17:02:45,498 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse8 (+ (select .cse15 0) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse8))) (let ((.cse1 (= (select (select |c_#memory_int#2| .cse11) 0) 1)) (.cse0 (not (= .cse3 .cse11))) (.cse10 (not (= 0 .cse11))) (.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse8) 0))) (and .cse0 (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 .cse2 (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse9 (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse11)))) (or (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse5 (select |c_#memory_int#2| .cse5))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse6 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse3) .cse8)) (.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse6 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse6) 0) 1) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse7) (not (= .cse6 .cse3)) (not (= .cse6 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse7 (select |c_#memory_$Pointer$#2.base| .cse7)) |c_#memory_$Pointer$#2.base|)))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse5)))) (and .cse0 .cse1 .cse9 .cse10) (and .cse0 .cse9 (exists ((|v_old(#memory_int#2)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_int#2)_AFTER_CALL_20| |c_#memory_int#2|))) (and (= (select (select |v_old(#memory_int#2)_AFTER_CALL_20| .cse11) 0) 1) (= |c_#memory_int#2| (store |v_old(#memory_int#2)_AFTER_CALL_20| .cse12 (select |c_#memory_int#2| .cse12))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse12)))) .cse10))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse13)) (= (select |c_#valid| .cse13) 1) (not (= .cse4 .cse13)) .cse10 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse13) 0)) (= (select |c_#valid| .cse11) 1) (or .cse2 (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse14 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse3) .cse8) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse14 (select |c_#memory_$Pointer$#2.offset| .cse14))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse14))))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (= (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2023-12-19 17:02:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:02:59,098 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2023-12-19 17:02:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-19 17:02:59,099 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2023-12-19 17:02:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:02:59,099 INFO L225 Difference]: With dead ends: 55 [2023-12-19 17:02:59,099 INFO L226 Difference]: Without dead ends: 53 [2023-12-19 17:02:59,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=408, Invalid=5919, Unknown=9, NotChecked=636, Total=6972 [2023-12-19 17:02:59,101 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-19 17:02:59,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 381 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1165 Invalid, 1 Unknown, 102 Unchecked, 4.9s Time] [2023-12-19 17:02:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-19 17:02:59,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2023-12-19 17:02:59,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:02:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2023-12-19 17:02:59,108 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 36 [2023-12-19 17:02:59,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:02:59,108 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2023-12-19 17:02:59,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:02:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2023-12-19 17:02:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-19 17:02:59,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:02:59,109 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:02:59,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-19 17:02:59,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:02:59,310 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:02:59,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:02:59,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1687594025, now seen corresponding path program 2 times [2023-12-19 17:02:59,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:02:59,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212371906] [2023-12-19 17:02:59,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:02:59,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:02:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:00,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:03:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:01,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 17:03:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:01,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 17:03:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:03:01,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:03:01,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212371906] [2023-12-19 17:03:01,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212371906] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:03:01,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866123419] [2023-12-19 17:03:01,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:03:01,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:03:01,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:03:01,334 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) [2023-12-19 17:03:01,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-19 17:03:01,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 17:03:01,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:03:01,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 130 conjunts are in the unsatisfiable core [2023-12-19 17:03:01,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:03:01,644 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 [2023-12-19 17:03:01,741 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 13 treesize of output 9 [2023-12-19 17:03:01,937 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-19 17:03:01,937 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 18 treesize of output 17 [2023-12-19 17:03:01,940 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 7 treesize of output 3 [2023-12-19 17:03:01,958 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:03:01,958 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 [2023-12-19 17:03:02,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:03:02,032 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 18 treesize of output 7 [2023-12-19 17:03:02,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-19 17:03:02,042 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 18 treesize of output 13 [2023-12-19 17:03:02,117 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-19 17:03:02,117 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 92 treesize of output 81 [2023-12-19 17:03:02,128 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-12-19 17:03:02,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2023-12-19 17:03:02,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-19 17:03:02,397 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 48 [2023-12-19 17:03:02,403 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:03:02,403 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 17 [2023-12-19 17:03:02,407 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 15 treesize of output 7 [2023-12-19 17:03:02,422 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 11 treesize of output 3 [2023-12-19 17:03:02,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:03:02,668 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 88 treesize of output 65 [2023-12-19 17:03:02,682 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-19 17:03:02,682 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 28 treesize of output 30 [2023-12-19 17:03:02,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2023-12-19 17:03:02,702 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 20 treesize of output 15 [2023-12-19 17:03:03,005 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 90 treesize of output 50 [2023-12-19 17:03:03,125 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:03:03,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 17 [2023-12-19 17:03:03,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:03:03,245 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-12-19 17:03:03,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-19 17:03:03,304 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 19 treesize of output 11 [2023-12-19 17:03:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:03:03,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:03:05,032 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int)) (v_subst_1 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_36| Int) (v_ArrVal_1989 Int)) (or (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_36| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0) 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| v_subst_1 (store (select |c_#memory_int#2| v_subst_1) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_36| 4) v_ArrVal_1989)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1990) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-19 17:03:10,325 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int)) (v_subst_1 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_36| Int) (v_ArrVal_1989 Int)) (or (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_36| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1)) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) 4)))) (= (select (select (store (store |c_#memory_int#2| v_subst_1 (store (select |c_#memory_int#2| v_subst_1) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_36| 4) v_ArrVal_1989)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1990) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2023-12-19 17:03:10,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866123419] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:03:10,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:03:10,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2023-12-19 17:03:10,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499287750] [2023-12-19 17:03:10,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:03:10,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-19 17:03:10,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:03:10,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-19 17:03:10,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2934, Unknown=75, NotChecked=222, Total=3422 [2023-12-19 17:03:10,509 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 52 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 42 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:03:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:03:12,926 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2023-12-19 17:03:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-19 17:03:12,927 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 42 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2023-12-19 17:03:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:03:12,928 INFO L225 Difference]: With dead ends: 62 [2023-12-19 17:03:12,928 INFO L226 Difference]: Without dead ends: 60 [2023-12-19 17:03:12,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=462, Invalid=5791, Unknown=75, NotChecked=314, Total=6642 [2023-12-19 17:03:12,929 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 83 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-19 17:03:12,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 251 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-19 17:03:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-19 17:03:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2023-12-19 17:03:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:03:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2023-12-19 17:03:12,937 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 36 [2023-12-19 17:03:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:03:12,937 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2023-12-19 17:03:12,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 42 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:03:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2023-12-19 17:03:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-19 17:03:12,938 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:03:12,938 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:03:12,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-19 17:03:13,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-19 17:03:13,138 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:03:13,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:03:13,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1361646376, now seen corresponding path program 1 times [2023-12-19 17:03:13,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:03:13,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382506236] [2023-12-19 17:03:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:03:13,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:03:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:14,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:03:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:14,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 17:03:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:14,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 17:03:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:03:14,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:03:14,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382506236] [2023-12-19 17:03:14,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382506236] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:03:14,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476762857] [2023-12-19 17:03:14,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:03:14,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:03:14,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:03:14,775 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) [2023-12-19 17:03:14,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-19 17:03:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:15,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 122 conjunts are in the unsatisfiable core [2023-12-19 17:03:15,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:03:15,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:03:15,655 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2023-12-19 17:03:15,658 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from true [2023-12-19 17:03:15,670 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 [2023-12-19 17:03:15,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:03:15,678 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) is different from false [2023-12-19 17:03:15,680 WARN L876 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) is different from true [2023-12-19 17:03:15,700 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-19 17:03:15,700 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 50 treesize of output 45 [2023-12-19 17:03:15,709 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-12-19 17:03:15,710 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 1 case distinctions, treesize of input 24 treesize of output 19 [2023-12-19 17:03:15,721 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from false [2023-12-19 17:03:15,723 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from true [2023-12-19 17:03:15,763 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2023-12-19 17:03:15,765 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from true [2023-12-19 17:03:15,807 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))))) is different from false [2023-12-19 17:03:15,809 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))))) is different from true [2023-12-19 17:03:15,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-19 17:03:15,825 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 45 treesize of output 21 [2023-12-19 17:03:15,860 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-19 17:03:15,862 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-19 17:03:15,893 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-19 17:03:15,895 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-19 17:03:15,918 WARN L854 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (not (= |c_node_create_#res#1.base| 0)) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-19 17:03:15,920 WARN L876 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (not (= |c_node_create_#res#1.base| 0)) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-19 17:03:15,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:03:15,952 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 61 treesize of output 44 [2023-12-19 17:03:15,977 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-19 17:03:15,977 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 1 case distinctions, treesize of input 36 treesize of output 39 [2023-12-19 17:03:16,021 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= .cse0 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2023-12-19 17:03:16,036 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= .cse0 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2023-12-19 17:03:16,110 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2023-12-19 17:03:16,114 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2023-12-19 17:03:16,166 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-12-19 17:03:16,170 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-12-19 17:03:16,278 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse5 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-12-19 17:03:16,281 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse5 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-12-19 17:03:16,338 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse5 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-12-19 17:03:16,342 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse5 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-12-19 17:03:16,399 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse5 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-12-19 17:03:16,403 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse5 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-12-19 17:03:16,470 INFO L349 Elim1Store]: treesize reduction 77, result has 12.5 percent of original size [2023-12-19 17:03:16,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 104 [2023-12-19 17:03:16,493 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-12-19 17:03:16,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 273 treesize of output 194 [2023-12-19 17:03:16,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:03:16,500 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 145 [2023-12-19 17:03:16,513 INFO L349 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2023-12-19 17:03:16,513 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 162 treesize of output 137 [2023-12-19 17:03:16,549 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ .cse4 4)))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 .cse3) (= .cse2 .cse3) (= .cse4 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2023-12-19 17:03:16,553 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ .cse4 4)))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 .cse3) (= .cse2 .cse3) (= .cse4 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2023-12-19 17:03:16,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:03:16,597 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 178 treesize of output 118 [2023-12-19 17:03:16,605 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:03:16,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:03:16,653 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ .cse2 4)))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= .cse0 0)) (not (= .cse1 0)) (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= .cse2 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1)))))) is different from false [2023-12-19 17:03:16,668 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) (+ .cse2 4)))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= .cse0 0)) (not (= .cse1 0)) (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= .cse2 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_26| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1)))))) is different from true [2023-12-19 17:03:16,702 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 77 treesize of output 57 [2023-12-19 17:03:16,754 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (not (= .cse1 0)) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) is different from false [2023-12-19 17:03:16,756 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (not (= .cse1 0)) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) is different from true [2023-12-19 17:03:16,781 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:03:16,782 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 25 [2023-12-19 17:03:16,808 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int) (v_arrayElimIndex_22 Int)) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (not (= v_arrayElimIndex_22 0)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_22) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0))) is different from false [2023-12-19 17:03:16,811 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int) (v_arrayElimIndex_22 Int)) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (not (= v_arrayElimIndex_22 0)) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimIndex_22) 1) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0))) is different from true [2023-12-19 17:03:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2023-12-19 17:03:16,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:03:17,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476762857] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:03:17,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:03:17,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 51 [2023-12-19 17:03:17,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99352955] [2023-12-19 17:03:17,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:03:17,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-19 17:03:17,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:03:17,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-19 17:03:17,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1692, Unknown=36, NotChecked=1782, Total=3660 [2023-12-19 17:03:17,546 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 51 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 42 states have internal predecessors, (61), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:03:17,796 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2023-12-19 17:03:17,798 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2023-12-19 17:03:17,802 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from false [2023-12-19 17:03:17,804 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from true [2023-12-19 17:03:17,807 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse2 (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or .cse0 .cse2) (not .cse2) (= (select |c_#valid| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))))) is different from false [2023-12-19 17:03:17,809 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse2 (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or .cse0 .cse2) (not .cse2) (= (select |c_#valid| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))))) is different from true [2023-12-19 17:03:17,812 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (.cse1 (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse2 0)) (= (select |c_#valid| .cse2) 1) .cse0 (not .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2023-12-19 17:03:17,814 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (.cse1 (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse2 0)) (= (select |c_#valid| .cse2) 1) .cse0 (not .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2023-12-19 17:03:17,819 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse3) 1) (not (= .cse2 .cse3)) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0))) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-12-19 17:03:17,822 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse3) 1) (not (= .cse2 .cse3)) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select .cse4 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0))) (= (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-12-19 17:03:17,826 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-19 17:03:17,829 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-19 17:03:17,833 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-19 17:03:17,835 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_#valid_BEFORE_CALL_23| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-19 17:03:17,844 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse0 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (not (= |c_node_create_#res#1.base| 0)) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))) is different from false [2023-12-19 17:03:17,849 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse0 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1)))) (not (= |c_node_create_#res#1.base| 0)) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse1 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))) is different from true [2023-12-19 17:03:17,860 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= .cse0 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (not (= .cse3 .cse4)) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-12-19 17:03:17,864 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_26| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= .cse0 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1)))) (not (= .cse3 .cse4)) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-12-19 17:03:17,877 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= .cse3 .cse6)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-12-19 17:03:17,881 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= .cse3 .cse6)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-12-19 17:03:17,892 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse7 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-12-19 17:03:17,896 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse7 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-12-19 17:03:17,911 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse7 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-12-19 17:03:17,915 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse7 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-12-19 17:03:17,926 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-12-19 17:03:17,929 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-12-19 17:03:17,943 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-12-19 17:03:17,947 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-12-19 17:03:17,958 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-12-19 17:03:17,962 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse2) 1))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= .cse1 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse5 (select |v_#valid_BEFORE_CALL_23| .cse5))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse4) 1)))) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or (= .cse1 .cse2) (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-12-19 17:03:17,974 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse9 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ .cse5 4))) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) 4) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (or (= .cse1 .cse3) (= .cse2 .cse3) (= .cse5 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (not (= .cse1 0)) (= (select .cse8 0) 0) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2023-12-19 17:03:17,978 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse9 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ .cse5 4))) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 1))) (not (= .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) 4) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (or (= .cse1 .cse3) (= .cse2 .cse3) (= .cse5 0)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimCell_113 Int) (|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7))) |v_#valid_BEFORE_CALL_23|) (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimCell_113) 1) (not (= v_arrayElimCell_113 0)) (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1)))) (not (= .cse1 0)) (= (select .cse8 0) 0) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2023-12-19 17:03:17,990 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (= .cse5 0)) (.cse3 (select .cse0 (+ .cse5 4)))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select .cse0 4) 0)) .cse1 (not (= .cse2 0)) (not (= .cse3 0)) (or (= .cse3 |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1))))))) is different from false [2023-12-19 17:03:17,993 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (= .cse5 0)) (.cse3 (select .cse0 (+ .cse5 4)))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select .cse0 4) 0)) .cse1 (not (= .cse2 0)) (not (= .cse3 0)) (or (= .cse3 |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_26| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_26| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_26| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1))))))) is different from true [2023-12-19 17:03:18,025 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (not (= .cse1 0)) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) is different from false [2023-12-19 17:03:18,028 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_26| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |v_old(#valid)_AFTER_CALL_26| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_26|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_26| .cse0)))) (not (= .cse1 0)) (not (= .cse2 0)) (= (select |v_old(#valid)_AFTER_CALL_26| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_22| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select |v_old(#valid)_AFTER_CALL_26| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) is different from true [2023-12-19 17:03:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:03:18,948 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2023-12-19 17:03:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-19 17:03:18,948 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 42 states have internal predecessors, (61), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-12-19 17:03:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:03:18,950 INFO L225 Difference]: With dead ends: 114 [2023-12-19 17:03:18,950 INFO L226 Difference]: Without dead ends: 111 [2023-12-19 17:03:18,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 36 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=309, Invalid=3185, Unknown=72, NotChecked=5364, Total=8930 [2023-12-19 17:03:18,953 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2535 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 17:03:18,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 512 Invalid, 3362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 816 Invalid, 0 Unknown, 2535 Unchecked, 0.5s Time] [2023-12-19 17:03:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-19 17:03:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 77. [2023-12-19 17:03:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-19 17:03:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2023-12-19 17:03:18,971 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 38 [2023-12-19 17:03:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:03:18,971 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2023-12-19 17:03:18,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 42 states have internal predecessors, (61), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:03:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2023-12-19 17:03:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-19 17:03:18,972 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:03:18,972 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:03:18,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-19 17:03:19,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:03:19,181 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:03:19,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:03:19,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1361648050, now seen corresponding path program 2 times [2023-12-19 17:03:19,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:03:19,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362211495] [2023-12-19 17:03:19,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:03:19,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:03:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:20,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:03:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:20,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 17:03:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:20,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 17:03:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:03:20,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:03:20,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362211495] [2023-12-19 17:03:20,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362211495] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:03:20,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276020171] [2023-12-19 17:03:20,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:03:20,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:03:20,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:03:20,660 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) [2023-12-19 17:03:20,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-19 17:03:20,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 17:03:20,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:03:20,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 148 conjunts are in the unsatisfiable core [2023-12-19 17:03:20,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:03:20,972 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 [2023-12-19 17:03:21,159 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2023-12-19 17:03:21,161 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2023-12-19 17:03:21,168 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 [2023-12-19 17:03:21,174 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 [2023-12-19 17:03:21,184 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2023-12-19 17:03:21,186 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from true [2023-12-19 17:03:21,224 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-19 17:03:21,224 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 42 treesize of output 39 [2023-12-19 17:03:21,242 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-12-19 17:03:21,242 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 24 treesize of output 19 [2023-12-19 17:03:21,263 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) is different from false [2023-12-19 17:03:21,266 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) is different from true [2023-12-19 17:03:21,284 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2023-12-19 17:03:21,286 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from true [2023-12-19 17:03:21,333 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 1))) (or (= .cse2 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~data#1| 1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2023-12-19 17:03:21,335 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 1))) (or (= .cse2 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~data#1| 1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2023-12-19 17:03:21,342 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 41 treesize of output 25 [2023-12-19 17:03:21,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-19 17:03:21,363 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-19 17:03:21,364 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-19 17:03:21,390 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-19 17:03:21,392 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-19 17:03:21,412 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 [2023-12-19 17:03:21,418 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-19 17:03:21,420 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-19 17:03:21,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:03:21,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2023-12-19 17:03:21,458 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-19 17:03:21,458 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 36 treesize of output 39 [2023-12-19 17:03:21,512 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) 1) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= .cse3 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4)))) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2023-12-19 17:03:21,527 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) 1) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= .cse3 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4)))) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2023-12-19 17:03:21,600 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) 1) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4)))) (= (select |v_#valid_BEFORE_CALL_29| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse3) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2023-12-19 17:03:21,602 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) 1) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4)))) (= (select |v_#valid_BEFORE_CALL_29| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse3) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2023-12-19 17:03:21,680 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse3 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4)))) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 0)))))) is different from false [2023-12-19 17:03:21,683 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse3 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse4 (select |v_#valid_BEFORE_CALL_29| .cse4)))) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 0)))))) is different from true [2023-12-19 17:03:21,824 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) 1) (= .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (or (= .cse3 .cse4) (= .cse2 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 0)))))) is different from false [2023-12-19 17:03:21,827 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) 1) (= .cse2 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (or (= .cse3 .cse4) (= .cse2 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse3) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse5 (select |v_#valid_BEFORE_CALL_29| .cse5)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 0)))))) is different from true [2023-12-19 17:03:21,970 INFO L349 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2023-12-19 17:03:21,970 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 118 [2023-12-19 17:03:21,997 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-12-19 17:03:21,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 367 treesize of output 252 [2023-12-19 17:03:22,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:03:22,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:03:22,008 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 122 treesize of output 75 [2023-12-19 17:03:22,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:03:22,014 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 167 [2023-12-19 17:03:22,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:03:22,045 INFO L349 Elim1Store]: treesize reduction 100, result has 18.7 percent of original size [2023-12-19 17:03:22,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 183 [2023-12-19 17:03:22,075 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 62 treesize of output 33 [2023-12-19 17:03:22,104 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse6 (+ .cse7 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse6))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_30| .cse5) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse6) 0) (or (= .cse4 .cse5) (= .cse2 .cse5) (= .cse7 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#2| .cse4) 0) 1)))))) is different from false [2023-12-19 17:03:22,107 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse6 (+ .cse7 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse6))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_30| .cse5) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse6) 0) (or (= .cse4 .cse5) (= .cse2 .cse5) (= .cse7 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_int#2| .cse4) 0) 1)))))) is different from true [2023-12-19 17:03:22,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:03:22,132 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 194 treesize of output 130 [2023-12-19 17:03:22,154 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:03:22,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:03:22,176 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse3 (+ .cse4 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= .cse4 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)))))) is different from false [2023-12-19 17:03:22,178 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse3 (+ .cse4 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= .cse4 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)))))) is different from true [2023-12-19 17:03:22,308 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_29| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= 1 (select (select |c_#memory_int#2| .cse2) 0)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1)))))) is different from false [2023-12-19 17:03:22,310 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_29| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= 1 (select (select |c_#memory_int#2| .cse2) 0)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1)))))) is different from true [2023-12-19 17:03:22,351 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:03:22,352 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 31 [2023-12-19 17:03:22,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:03:22,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-12-19 17:03:22,377 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (v_arrayElimIndex_29 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_29) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from false [2023-12-19 17:03:22,379 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (v_arrayElimIndex_29 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_29) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from true [2023-12-19 17:03:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2023-12-19 17:03:22,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:03:22,572 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2493 Int) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2494 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2496)) (.cse1 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2490)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (+ 4 (select (select .cse4 .cse5) .cse6)))) (select (select (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2494))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_2493))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2023-12-19 17:03:22,600 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2493 Int) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2494 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9)) (.cse8 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| .cse1 (store (select |c_#memory_$Pointer$#2.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2496)) (.cse2 (store (store |c_#memory_$Pointer$#2.base| .cse1 (store (select |c_#memory_$Pointer$#2.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2490)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (select (select (let ((.cse0 (store |c_#memory_int#2| .cse1 v_ArrVal_2494))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_2493))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2023-12-19 17:03:22,631 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2493 Int) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2494 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse9) .cse10)) (.cse8 (+ (select (select |c_#memory_$Pointer$#2.offset| .cse9) .cse10) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| .cse1 (store (select |c_#memory_$Pointer$#2.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2496)) (.cse2 (store (store |c_#memory_$Pointer$#2.base| .cse1 (store (select |c_#memory_$Pointer$#2.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2490)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (select (select (let ((.cse0 (store |c_#memory_int#2| .cse1 v_ArrVal_2494))) (store .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_2493))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2023-12-19 17:03:22,656 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2493 Int) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2494 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse9) .cse10)) (.cse8 (+ (select (select |c_#memory_$Pointer$#2.offset| .cse9) .cse10) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| .cse1 (store (select |c_#memory_$Pointer$#2.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2496)) (.cse2 (store (store |c_#memory_$Pointer$#2.base| .cse1 (store (select |c_#memory_$Pointer$#2.base| .cse1) .cse8 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2490)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (select (select (let ((.cse0 (store |c_#memory_int#2| .cse1 v_ArrVal_2494))) (store .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (+ 8 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|) v_ArrVal_2493))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2023-12-19 17:03:22,817 INFO L349 Elim1Store]: treesize reduction 955, result has 50.3 percent of original size [2023-12-19 17:03:22,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 6022 treesize of output 6008 [2023-12-19 17:03:22,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:03:22,841 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 2784 treesize of output 2784 [2023-12-19 17:03:22,854 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 3771 treesize of output 3060 [2023-12-19 17:03:22,927 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 240 treesize of output 3 [2023-12-19 17:03:22,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:03:22,957 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 3266 treesize of output 3033 [2023-12-19 17:03:26,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276020171] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:03:26,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:03:26,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 48 [2023-12-19 17:03:26,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774808118] [2023-12-19 17:03:26,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:03:26,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-19 17:03:26,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:03:26,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-19 17:03:26,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1175, Unknown=36, NotChecked=1740, Total=3080 [2023-12-19 17:03:26,389 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 48 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 39 states have internal predecessors, (61), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:03:26,714 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2023-12-19 17:03:26,717 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|)))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2023-12-19 17:03:26,720 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2023-12-19 17:03:26,722 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2023-12-19 17:03:26,725 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse3 (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse0 .cse3) (not .cse3) (= (select |c_#valid| .cse2) 1)))) is different from false [2023-12-19 17:03:26,727 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse3 (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse0 .cse3) (not .cse3) (= (select |c_#valid| .cse2) 1)))) is different from true [2023-12-19 17:03:26,729 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (.cse1 (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 1))) .cse0 (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2023-12-19 17:03:26,731 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (.cse1 (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_27| .cse2) 1))) .cse0 (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2023-12-19 17:03:26,734 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_append_~data#1|) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse2) 1) (not (= .cse1 .cse2)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 1))) (or (= .cse4 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select .cse5 0) 0) (= |c_ULTIMATE.start_dll_append_~data#1| 1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-12-19 17:03:26,737 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_append_~data#1|) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse2) 1) (not (= .cse1 .cse2)) (exists ((|v_#valid_BEFORE_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_27| |c_#valid|))) (store |v_#valid_BEFORE_CALL_27| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| .cse4) 1))) (or (= .cse4 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select .cse5 0) 0) (= |c_ULTIMATE.start_dll_append_~data#1| 1) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-12-19 17:03:26,741 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-19 17:03:26,742 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-19 17:03:26,745 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-19 17:03:26,746 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-19 17:03:26,752 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse2 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse3 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))) is different from false [2023-12-19 17:03:26,755 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse2 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse3 |c_node_create_#res#1.base|)) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))) is different from true [2023-12-19 17:03:26,765 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 1) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse1)) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) (= .cse5 .cse4) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (not (= .cse3 .cse6)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse5) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse7 (select |v_#valid_BEFORE_CALL_29| .cse7)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 0))) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-12-19 17:03:26,767 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 1) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse1)) (= (select |v_#valid_BEFORE_CALL_27| .cse1) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4) (= .cse5 .cse4) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse6)) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (not (= .cse3 .cse6)) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse5) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse7 (select |v_#valid_BEFORE_CALL_29| .cse7)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 0))) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-12-19 17:03:26,778 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse2 0) 1) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (or (= .cse5 .cse6) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (= (select .cse7 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse5) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_29| .cse8)))) (= (select |v_#valid_BEFORE_CALL_29| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse6) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2023-12-19 17:03:26,780 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse2 0) 1) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (or (= .cse5 .cse6) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (= (select .cse7 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse5) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_29| .cse8)))) (= (select |v_#valid_BEFORE_CALL_29| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse6) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2023-12-19 17:03:26,788 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse5 0))) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse2 0) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or (= .cse6 .cse4) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse7 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse6) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_29| .cse8)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 0))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-12-19 17:03:26,791 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse5 0))) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse2 0) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or (= .cse6 .cse4) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse7 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse6) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_29| .cse8)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse4) 0))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-12-19 17:03:26,805 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse9 0))) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4)) (.cse3 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse2 0) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (or (= .cse5 .cse6) (= .cse4 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse5) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_29| .cse8)))) (= (select |v_#valid_BEFORE_CALL_29| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse6) 0))) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-12-19 17:03:26,808 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse9 0))) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4)) (.cse3 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (= (select .cse2 0) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (= .cse4 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) (or (= .cse5 .cse6) (= .cse4 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse6)) (not (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse7 0) 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse5) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse8 (select |v_#valid_BEFORE_CALL_29| .cse8)))) (= (select |v_#valid_BEFORE_CALL_29| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse6) 0))) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-12-19 17:03:26,821 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse11 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse7 (+ .cse8 4))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse7)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_30| .cse5) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse7) 0) (or (= .cse4 .cse5) (= .cse2 .cse5) (= .cse8 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4))) (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4)))) (= (select .cse10 0) 0) (= (select (select |c_#memory_int#2| .cse4) 0) 1) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) is different from false [2023-12-19 17:03:26,824 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse11 0))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse7 (+ .cse8 4))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse7)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((v_arrayElimCell_131 Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= 1 (select |v_#valid_BEFORE_CALL_28| .cse0)) (= (select |v_#valid_BEFORE_CALL_27| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_27| v_arrayElimCell_131) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_27| |v_#valid_BEFORE_CALL_28|))) (store |v_#valid_BEFORE_CALL_27| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1))))))) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1) (= |v_#valid_BEFORE_CALL_29| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse3 (select |v_#valid_BEFORE_CALL_29| .cse3)))) (= (select |v_#valid_BEFORE_CALL_29| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_30| .cse5) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse7) 0) (or (= .cse4 .cse5) (= .cse2 .cse5) (= .cse8 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4))) (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse9) 4)) (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4)))) (= (select .cse10 0) 0) (= (select (select |c_#memory_int#2| .cse4) 0) 1) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) is different from true [2023-12-19 17:03:26,836 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ .cse7 4))) (let ((.cse1 (select .cse6 .cse4)) (.cse5 (= .cse7 0)) (.cse3 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1))) (= (select .cse3 .cse4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| .cse1) 0) 1) .cse5 (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse5 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse6 4)) (select .cse3 4))))))) is different from false [2023-12-19 17:03:26,838 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ .cse7 4))) (let ((.cse1 (select .cse6 .cse4)) (.cse5 (= .cse7 0)) (.cse3 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_29| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_30| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse2) 1))) (= (select .cse3 .cse4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| .cse1) 0) 1) .cse5 (or (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse5 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select .cse6 4)) (select .cse3 4))))))) is different from true [2023-12-19 17:03:26,865 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_29| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= 1 (select (select |c_#memory_int#2| .cse2) 0)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1)))))) is different from false [2023-12-19 17:03:26,867 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |v_#valid_BEFORE_CALL_29| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse1 (select |v_#valid_BEFORE_CALL_29| .cse1)))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_30| .cse0) 1) (= 1 (select (select |c_#memory_int#2| .cse2) 0)) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 4) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1)))))) is different from true [2023-12-19 17:03:26,882 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (v_arrayElimIndex_29 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_29) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse1 0) 1))) is different from false [2023-12-19 17:03:26,883 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_30| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_29| Int) (v_arrayElimIndex_29 Int) (|v_#valid_BEFORE_CALL_29| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_29| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_30| |v_#valid_BEFORE_CALL_29|))) (store |v_#valid_BEFORE_CALL_30| .cse0 (select |v_#valid_BEFORE_CALL_29| .cse0)))) (= (select |v_#valid_BEFORE_CALL_30| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 0) (= (select |v_#valid_BEFORE_CALL_29| |v_ULTIMATE.start_main_~ptr~0#1.base_29|) 1) (= (select |v_#valid_BEFORE_CALL_30| v_arrayElimIndex_29) 1) (= (select |v_#valid_BEFORE_CALL_29| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse1 0) 1))) is different from true [2023-12-19 17:03:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:03:28,574 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2023-12-19 17:03:28,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-19 17:03:28,574 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 39 states have internal predecessors, (61), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-12-19 17:03:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:03:28,575 INFO L225 Difference]: With dead ends: 112 [2023-12-19 17:03:28,575 INFO L226 Difference]: Without dead ends: 110 [2023-12-19 17:03:28,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 36 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=249, Invalid=2277, Unknown=68, NotChecked=4716, Total=7310 [2023-12-19 17:03:28,577 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 40 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2293 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 17:03:28,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 496 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 948 Invalid, 0 Unknown, 2293 Unchecked, 0.6s Time] [2023-12-19 17:03:28,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-19 17:03:28,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 77. [2023-12-19 17:03:28,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-19 17:03:28,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2023-12-19 17:03:28,592 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 38 [2023-12-19 17:03:28,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:03:28,592 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2023-12-19 17:03:28,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 39 states have internal predecessors, (61), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:03:28,592 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2023-12-19 17:03:28,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-19 17:03:28,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:03:28,593 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:03:28,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-19 17:03:28,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-19 17:03:28,801 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:03:28,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:03:28,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1719814514, now seen corresponding path program 3 times [2023-12-19 17:03:28,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:03:28,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405974477] [2023-12-19 17:03:28,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:03:28,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:03:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:31,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:03:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:31,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 17:03:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:31,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 17:03:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:03:31,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:03:31,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405974477] [2023-12-19 17:03:31,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405974477] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:03:31,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228700990] [2023-12-19 17:03:31,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-19 17:03:31,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:03:31,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:03:31,692 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) [2023-12-19 17:03:31,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-19 17:03:32,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-19 17:03:32,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:03:32,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-19 17:03:32,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:03:32,312 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 [2023-12-19 17:03:32,436 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 13 treesize of output 9 [2023-12-19 17:03:32,440 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 13 treesize of output 9 [2023-12-19 17:03:32,720 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-19 17:03:32,720 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 18 treesize of output 17 [2023-12-19 17:03:32,723 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 7 treesize of output 3 [2023-12-19 17:03:32,736 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-19 17:03:32,736 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 18 treesize of output 17 [2023-12-19 17:03:32,738 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 7 treesize of output 3 [2023-12-19 17:03:32,756 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:03:32,756 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 [2023-12-19 17:03:32,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-12-19 17:03:32,829 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 18 treesize of output 13 [2023-12-19 17:03:32,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-12-19 17:03:32,839 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 18 treesize of output 13 [2023-12-19 17:03:32,937 INFO L349 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2023-12-19 17:03:32,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 101 [2023-12-19 17:03:32,951 INFO L349 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2023-12-19 17:03:32,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 91 [2023-12-19 17:03:33,212 INFO L349 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2023-12-19 17:03:33,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 50 [2023-12-19 17:03:33,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2023-12-19 17:03:33,218 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 15 treesize of output 7 [2023-12-19 17:03:33,277 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-19 17:03:33,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:03:33,299 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-19 17:03:33,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 165 treesize of output 132 [2023-12-19 17:03:33,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:03:33,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:03:33,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 110 [2023-12-19 17:03:33,318 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-12-19 17:03:33,318 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 34 treesize of output 36 [2023-12-19 17:03:33,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:03:33,602 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:03:33,610 INFO L349 Elim1Store]: treesize reduction 96, result has 3.0 percent of original size [2023-12-19 17:03:33,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 54 [2023-12-19 17:03:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2023-12-19 17:03:33,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:03:34,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228700990] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:03:34,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:03:34,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22] total 50 [2023-12-19 17:03:34,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329064509] [2023-12-19 17:03:34,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:03:34,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-19 17:03:34,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:03:34,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-19 17:03:34,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2724, Unknown=1, NotChecked=104, Total=2970 [2023-12-19 17:03:34,108 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 50 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 42 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:03:36,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:03:36,795 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2023-12-19 17:03:36,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-19 17:03:36,796 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 42 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-12-19 17:03:36,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:03:36,796 INFO L225 Difference]: With dead ends: 114 [2023-12-19 17:03:36,796 INFO L226 Difference]: Without dead ends: 96 [2023-12-19 17:03:36,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=331, Invalid=5222, Unknown=1, NotChecked=146, Total=5700 [2023-12-19 17:03:36,798 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-19 17:03:36,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 320 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1167 Invalid, 0 Unknown, 63 Unchecked, 0.9s Time] [2023-12-19 17:03:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-19 17:03:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2023-12-19 17:03:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 72 states have internal predecessors, (82), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-19 17:03:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2023-12-19 17:03:36,829 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 38 [2023-12-19 17:03:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:03:36,830 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2023-12-19 17:03:36,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 42 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:03:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2023-12-19 17:03:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-19 17:03:36,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:03:36,832 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:03:36,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-19 17:03:37,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-19 17:03:37,039 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:03:37,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:03:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1421216253, now seen corresponding path program 2 times [2023-12-19 17:03:37,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:03:37,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511327925] [2023-12-19 17:03:37,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:03:37,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:03:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:37,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:03:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:37,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 17:03:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:37,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 17:03:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-19 17:03:37,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:03:37,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511327925] [2023-12-19 17:03:37,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511327925] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:03:37,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954825236] [2023-12-19 17:03:37,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:03:37,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:03:37,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:03:37,186 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) [2023-12-19 17:03:37,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-19 17:03:37,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 17:03:37,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:03:37,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-19 17:03:37,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:03:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-19 17:03:37,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:03:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-19 17:03:37,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954825236] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:03:37,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:03:37,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2023-12-19 17:03:37,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794697190] [2023-12-19 17:03:37,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:03:37,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 17:03:37,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:03:37,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 17:03:37,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-19 17:03:37,601 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-19 17:03:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:03:37,708 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2023-12-19 17:03:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 17:03:37,708 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2023-12-19 17:03:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:03:37,709 INFO L225 Difference]: With dead ends: 104 [2023-12-19 17:03:37,709 INFO L226 Difference]: Without dead ends: 101 [2023-12-19 17:03:37,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-19 17:03:37,710 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 17:03:37,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 238 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 17:03:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-19 17:03:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2023-12-19 17:03:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.1625) internal successors, (93), 80 states have internal predecessors, (93), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-19 17:03:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2023-12-19 17:03:37,731 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 40 [2023-12-19 17:03:37,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:03:37,731 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2023-12-19 17:03:37,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-19 17:03:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2023-12-19 17:03:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-19 17:03:37,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:03:37,733 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:03:37,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-19 17:03:37,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-19 17:03:37,939 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:03:37,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:03:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1421214579, now seen corresponding path program 4 times [2023-12-19 17:03:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:03:37,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374151137] [2023-12-19 17:03:37,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:03:37,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:03:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:39,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 17:03:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 17:03:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:39,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 17:03:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:03:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:03:39,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:03:39,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374151137] [2023-12-19 17:03:39,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374151137] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:03:39,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300603370] [2023-12-19 17:03:39,786 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-19 17:03:39,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:03:39,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:03:39,787 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) [2023-12-19 17:03:39,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-19 17:03:40,096 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-19 17:03:40,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:03:40,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 130 conjunts are in the unsatisfiable core [2023-12-19 17:03:40,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:03:40,110 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 13 treesize of output 9 [2023-12-19 17:03:40,112 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 13 treesize of output 9 [2023-12-19 17:03:40,152 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2023-12-19 17:03:40,152 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 52 treesize of output 36 [2023-12-19 17:03:40,163 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-12-19 17:03:40,163 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 42 treesize of output 35 [2023-12-19 17:03:40,169 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 19 treesize of output 15 [2023-12-19 17:03:40,357 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2023-12-19 17:03:40,357 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 18 [2023-12-19 17:03:40,678 INFO L349 Elim1Store]: treesize reduction 461, result has 37.3 percent of original size [2023-12-19 17:03:40,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 318 [2023-12-19 17:03:40,730 INFO L349 Elim1Store]: treesize reduction 162, result has 29.3 percent of original size [2023-12-19 17:03:40,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 151 [2023-12-19 17:03:43,023 INFO L349 Elim1Store]: treesize reduction 936, result has 17.2 percent of original size [2023-12-19 17:03:43,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 26 case distinctions, treesize of input 994 treesize of output 638 [2023-12-19 17:03:43,077 INFO L349 Elim1Store]: treesize reduction 285, result has 8.1 percent of original size [2023-12-19 17:03:43,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 937 treesize of output 540 [2023-12-19 17:03:43,848 INFO L349 Elim1Store]: treesize reduction 895, result has 29.9 percent of original size [2023-12-19 17:03:43,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 1718 treesize of output 1183 [2023-12-19 17:03:43,923 INFO L349 Elim1Store]: treesize reduction 357, result has 9.4 percent of original size [2023-12-19 17:03:43,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 1291 treesize of output 633 [2023-12-19 17:03:55,313 INFO L349 Elim1Store]: treesize reduction 153, result has 24.3 percent of original size [2023-12-19 17:03:55,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 383 treesize of output 248 [2023-12-19 17:03:55,342 INFO L349 Elim1Store]: treesize reduction 192, result has 16.9 percent of original size [2023-12-19 17:03:55,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 373 treesize of output 235 [2023-12-19 17:03:59,867 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse26 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (+ .cse26 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.offset| .cse10) .cse17)) (.cse27 (select |c_#memory_$Pointer$#2.base| .cse10))) (let ((.cse7 (select .cse27 .cse17)) (.cse15 (+ 4 .cse13))) (let ((.cse106 (+ 8 .cse13)) (.cse92 (exists ((v_arrayElimCell_190 Int)) (= .cse10 (select .cse27 (+ v_arrayElimCell_190 8))))) (.cse2 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse630 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse629 (select .cse630 v_arrayElimIndex_48))) (let ((.cse628 (select (select |c_#memory_$Pointer$#2.base| .cse629) .cse15)) (.cse634 (select (select |c_#memory_$Pointer$#2.offset| .cse629) .cse15))) (let ((.cse631 (+ 4 .cse634)) (.cse633 (select |c_#memory_$Pointer$#2.offset| .cse628)) (.cse632 (+ 8 .cse634))) (and (= v_arrayElimIndex_45 .cse628) (= .cse629 .cse7) (= (select .cse630 .cse631) 0) (= .cse10 .cse629) (= .cse632 v_arrayElimIndex_48) (not (= .cse10 v_arrayElimIndex_45)) (= (select .cse633 .cse631) 0) (= (select .cse633 .cse632) .cse13)))))))) (.cse1 (not (= .cse13 0)))) (let ((.cse116 (exists ((v_arrayElimIndex_45 Int)) (and (exists ((v_arrayElimIndex_48 Int)) (let ((.cse623 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse622 (select .cse623 v_arrayElimIndex_48))) (let ((.cse621 (select (select |c_#memory_$Pointer$#2.base| .cse622) .cse15)) (.cse625 (select (select |c_#memory_$Pointer$#2.offset| .cse622) .cse15))) (let ((.cse624 (+ 4 .cse625)) (.cse627 (select |c_#memory_$Pointer$#2.offset| .cse621)) (.cse626 (+ 8 .cse625))) (and (= v_arrayElimIndex_45 .cse621) (= .cse622 .cse7) (= (select .cse623 .cse624) 0) (= .cse621 .cse622) (= .cse625 .cse15) (= .cse626 v_arrayElimIndex_48) (= (select .cse627 .cse624) 0) (not (= .cse622 0)) (= (select .cse627 .cse626) .cse13))))))) (not (= .cse10 v_arrayElimIndex_45))))) (.cse135 (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse616 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse615 (select .cse616 v_arrayElimIndex_48))) (let ((.cse614 (select (select |c_#memory_$Pointer$#2.base| .cse615) .cse15)) (.cse618 (select (select |c_#memory_$Pointer$#2.offset| .cse615) .cse15))) (let ((.cse617 (+ 4 .cse618)) (.cse620 (select |c_#memory_$Pointer$#2.offset| .cse614)) (.cse619 (+ 8 .cse618))) (and (= v_arrayElimIndex_45 .cse614) (= .cse615 .cse7) (= (select .cse616 .cse617) 0) (= .cse614 .cse615) (= .cse618 .cse15) (= .cse619 v_arrayElimIndex_48) (not (= .cse10 v_arrayElimIndex_45)) (= (select .cse620 .cse617) 0) (= (select .cse620 .cse619) .cse13))))))))) (.cse56 (and .cse92 .cse2)) (.cse67 (exists ((v_arrayElimIndex_45 Int)) (and (not (= .cse10 v_arrayElimIndex_45)) (exists ((v_arrayElimIndex_48 Int)) (let ((.cse608 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse607 (select .cse608 v_arrayElimIndex_48))) (let ((.cse606 (select (select |c_#memory_$Pointer$#2.base| .cse607) .cse15)) (.cse613 (select (select |c_#memory_$Pointer$#2.offset| .cse607) .cse15))) (let ((.cse609 (+ 4 .cse613)) (.cse611 (select |c_#memory_$Pointer$#2.offset| .cse606)) (.cse610 (+ 8 .cse613))) (and (= v_arrayElimIndex_45 .cse606) (= .cse607 .cse7) (= (select .cse608 .cse609) 0) (= .cse10 .cse607) (= .cse610 v_arrayElimIndex_48) (= (select .cse611 .cse609) 0) (exists ((v_arrayElimCell_190 Int)) (let ((.cse612 (+ v_arrayElimCell_190 8))) (and (= .cse10 (select .cse27 .cse612)) (not (= v_arrayElimIndex_48 .cse612))))) (= (select .cse611 .cse610) .cse13)))))))))) (.cse168 (exists ((v_arrayElimIndex_45 Int)) (and (not (= .cse10 v_arrayElimIndex_45)) (exists ((v_arrayElimIndex_48 Int)) (let ((.cse603 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse605 (select (select |c_#memory_$Pointer$#2.offset| .cse603) .cse15))) (let ((.cse602 (select (select |c_#memory_$Pointer$#2.base| .cse603) .cse15)) (.cse604 (+ 8 .cse605))) (and (= v_arrayElimIndex_45 .cse602) (= .cse603 .cse7) (= .cse604 v_arrayElimIndex_48) (= .cse605 .cse13) (not (= .cse603 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse602) .cse604) .cse13) (= v_arrayElimIndex_45 .cse603))))))))) (.cse200 (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse599 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse601 (select (select |c_#memory_$Pointer$#2.offset| .cse599) .cse15))) (let ((.cse598 (select (select |c_#memory_$Pointer$#2.base| .cse599) .cse15)) (.cse600 (+ 8 .cse601))) (and (= v_arrayElimIndex_45 .cse598) (= .cse599 .cse7) (= .cse600 v_arrayElimIndex_48) (= .cse601 .cse13) (not (= .cse10 v_arrayElimIndex_45)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse598) .cse600) .cse13) (= v_arrayElimIndex_45 .cse599)))))))) (.cse169 (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse593 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse592 (select .cse593 v_arrayElimIndex_48))) (let ((.cse591 (select (select |c_#memory_$Pointer$#2.base| .cse592) .cse15)) (.cse597 (select (select |c_#memory_$Pointer$#2.offset| .cse592) .cse15))) (let ((.cse594 (+ 4 .cse597)) (.cse596 (select |c_#memory_$Pointer$#2.offset| .cse591)) (.cse595 (+ 8 .cse597))) (and (= v_arrayElimIndex_45 .cse591) (= .cse592 .cse7) (= (select .cse593 .cse594) 0) (= .cse591 .cse592) (= .cse595 v_arrayElimIndex_48) (not (= .cse10 v_arrayElimIndex_45)) (= (select .cse596 .cse594) 0) (= (select .cse596 .cse595) .cse13) (= .cse106 .cse597))))))))) (.cse171 (exists ((v_arrayElimIndex_45 Int)) (and (exists ((v_arrayElimIndex_48 Int)) (let ((.cse586 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse585 (select .cse586 v_arrayElimIndex_48))) (let ((.cse584 (select (select |c_#memory_$Pointer$#2.base| .cse585) .cse15)) (.cse590 (select (select |c_#memory_$Pointer$#2.offset| .cse585) .cse15))) (let ((.cse587 (+ 4 .cse590)) (.cse589 (select |c_#memory_$Pointer$#2.offset| .cse584)) (.cse588 (+ 8 .cse590))) (and (= v_arrayElimIndex_45 .cse584) (= .cse585 .cse7) (= (select .cse586 .cse587) 0) (= .cse584 .cse585) (= .cse588 v_arrayElimIndex_48) (= (select .cse589 .cse587) 0) (not (= .cse585 0)) (= (select .cse589 .cse588) .cse13) (= .cse106 .cse590))))))) (not (= .cse10 v_arrayElimIndex_45))))) (.cse492 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse581 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse583 (select (select |c_#memory_$Pointer$#2.offset| .cse581) .cse15))) (let ((.cse580 (select (select |c_#memory_$Pointer$#2.base| .cse581) .cse15)) (.cse582 (+ 8 .cse583))) (and (= v_arrayElimIndex_45 .cse580) (= .cse581 .cse7) (= .cse10 .cse581) (= .cse582 v_arrayElimIndex_48) (= .cse583 .cse13) (not (= .cse17 v_arrayElimIndex_48)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse580) .cse582) .cse13) (= v_arrayElimIndex_45 .cse581))))))) (.cse25 (not (= .cse26 .cse13))) (.cse107 (= .cse10 .cse7)) (.cse551 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse577 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse576 (select .cse577 v_arrayElimIndex_48))) (let ((.cse578 (select (select |c_#memory_$Pointer$#2.offset| .cse576) .cse15))) (let ((.cse575 (select (select |c_#memory_$Pointer$#2.base| .cse576) .cse15)) (.cse579 (+ 8 .cse578))) (and (= v_arrayElimIndex_45 .cse575) (= .cse576 .cse7) (= (select .cse577 (+ 4 .cse578)) 0) (= .cse575 .cse576) (= .cse579 v_arrayElimIndex_48) (= .cse578 .cse13) (not (= .cse10 v_arrayElimIndex_45)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse575) .cse579) .cse13)))))))) (.cse329 (exists ((v_arrayElimIndex_48 Int)) (and (not (= .cse17 v_arrayElimIndex_48)) (exists ((v_arrayElimIndex_45 Int)) (let ((.cse572 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse571 (select .cse572 v_arrayElimIndex_48))) (let ((.cse573 (select (select |c_#memory_$Pointer$#2.offset| .cse571) .cse15))) (let ((.cse570 (select (select |c_#memory_$Pointer$#2.base| .cse571) .cse15)) (.cse574 (+ 8 .cse573))) (and (= v_arrayElimIndex_45 .cse570) (= .cse571 .cse7) (= (select .cse572 (+ 4 .cse573)) 0) (= .cse570 .cse571) (= .cse10 .cse571) (= .cse574 v_arrayElimIndex_48) (= .cse573 .cse13) (= (select (select |c_#memory_$Pointer$#2.offset| .cse570) .cse574) .cse13))))))))))) (let ((.cse16 (or (exists ((v_arrayElimIndex_48 Int)) (and (exists ((v_arrayElimIndex_45 Int)) (let ((.cse565 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse564 (select .cse565 v_arrayElimIndex_48))) (let ((.cse563 (select (select |c_#memory_$Pointer$#2.base| .cse564) .cse15)) (.cse569 (select (select |c_#memory_$Pointer$#2.offset| .cse564) .cse15))) (let ((.cse566 (+ 4 .cse569)) (.cse568 (select |c_#memory_$Pointer$#2.offset| .cse563)) (.cse567 (+ 8 .cse569))) (and (= v_arrayElimIndex_45 .cse563) (= .cse564 .cse7) (= (select .cse565 .cse566) 0) (= .cse10 .cse564) (= .cse567 v_arrayElimIndex_48) (= (select .cse568 .cse566) 0) (= (select .cse568 .cse567) .cse13))))))) (not (= .cse17 v_arrayElimIndex_48)))) .cse329)) (.cse170 (exists ((v_arrayElimIndex_48 Int)) (and (exists ((v_arrayElimIndex_45 Int)) (let ((.cse558 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse557 (select .cse558 v_arrayElimIndex_48))) (let ((.cse556 (select (select |c_#memory_$Pointer$#2.base| .cse557) .cse15)) (.cse562 (select (select |c_#memory_$Pointer$#2.offset| .cse557) .cse15))) (let ((.cse559 (+ 4 .cse562)) (.cse561 (select |c_#memory_$Pointer$#2.offset| .cse556)) (.cse560 (+ 8 .cse562))) (and (= v_arrayElimIndex_45 .cse556) (= .cse557 .cse7) (= (select .cse558 .cse559) 0) (= .cse556 .cse557) (= .cse560 v_arrayElimIndex_48) (= (select .cse561 .cse559) 0) (not (= .cse10 .cse557)) (not (= .cse557 0)) (= (select .cse561 .cse560) .cse13) (= .cse106 .cse562))))))) (not (= .cse17 v_arrayElimIndex_48))))) (.cse29 (and .cse1 .cse551)) (.cse109 (not .cse107)) (.cse201 (exists ((v_arrayElimIndex_48 Int)) (and (exists ((v_arrayElimIndex_45 Int)) (let ((.cse553 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse555 (select (select |c_#memory_$Pointer$#2.offset| .cse553) .cse15))) (let ((.cse552 (select (select |c_#memory_$Pointer$#2.base| .cse553) .cse15)) (.cse554 (+ 8 .cse555))) (and (= v_arrayElimIndex_45 .cse552) (= .cse553 .cse7) (= .cse554 v_arrayElimIndex_48) (= .cse555 .cse13) (not (= .cse10 .cse553)) (not (= .cse553 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse552) .cse554) .cse13) (= v_arrayElimIndex_45 .cse553)))))) (not (= .cse17 v_arrayElimIndex_48))))) (.cse202 (and .cse1 .cse551 .cse25)) (.cse62 (and (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse547 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse549 (select (select |c_#memory_$Pointer$#2.offset| .cse547) .cse15)) (.cse546 (select (select |c_#memory_$Pointer$#2.base| .cse547) .cse15))) (let ((.cse550 (select |c_#memory_$Pointer$#2.offset| .cse546)) (.cse548 (+ 8 .cse549))) (and (= v_arrayElimIndex_45 .cse546) (= .cse547 .cse7) (= .cse10 .cse547) (= .cse548 v_arrayElimIndex_48) (= .cse549 .cse13) (= (select .cse550 (+ 4 .cse549)) 0) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse547 0)) (= (select .cse550 .cse548) .cse13) (= v_arrayElimIndex_45 .cse547)))))) .cse92)) (.cse63 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse540 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse539 (select .cse540 v_arrayElimIndex_48))) (let ((.cse538 (select (select |c_#memory_$Pointer$#2.base| .cse539) .cse15)) (.cse545 (select (select |c_#memory_$Pointer$#2.offset| .cse539) .cse15))) (let ((.cse541 (+ 4 .cse545)) (.cse543 (select |c_#memory_$Pointer$#2.offset| .cse538)) (.cse542 (+ 8 .cse545))) (and (= v_arrayElimIndex_45 .cse538) (= .cse539 .cse7) (= (select .cse540 .cse541) 0) (= .cse10 .cse539) (= .cse542 v_arrayElimIndex_48) (= (select .cse543 .cse541) 0) (exists ((v_arrayElimCell_190 Int)) (let ((.cse544 (+ v_arrayElimCell_190 8))) (and (= .cse10 (select .cse27 .cse544)) (not (= v_arrayElimIndex_48 .cse544))))) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse539 0)) (= (select .cse543 .cse542) .cse13)))))))) (.cse64 (and .cse1 (or (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse534 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse536 (select (select |c_#memory_$Pointer$#2.offset| .cse534) .cse15))) (let ((.cse533 (select (select |c_#memory_$Pointer$#2.base| .cse534) .cse15)) (.cse535 (+ 8 .cse536))) (and (= v_arrayElimIndex_45 .cse533) (= .cse534 .cse7) (= .cse10 .cse534) (= .cse535 v_arrayElimIndex_48) (= .cse536 .cse13) (exists ((v_arrayElimCell_190 Int)) (let ((.cse537 (+ v_arrayElimCell_190 8))) (and (= .cse10 (select .cse27 .cse537)) (not (= v_arrayElimIndex_48 .cse537))))) (not (= .cse17 v_arrayElimIndex_48)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse533) .cse535) .cse13) (= v_arrayElimIndex_45 .cse534)))))) (and .cse492 .cse92)))) (.cse65 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse528 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse530 (select (select |c_#memory_$Pointer$#2.offset| .cse528) .cse15)) (.cse527 (select (select |c_#memory_$Pointer$#2.base| .cse528) .cse15))) (let ((.cse531 (select |c_#memory_$Pointer$#2.offset| .cse527)) (.cse529 (+ 8 .cse530))) (and (= v_arrayElimIndex_45 .cse527) (= .cse528 .cse7) (= .cse10 .cse528) (= .cse529 v_arrayElimIndex_48) (= .cse530 .cse13) (= (select .cse531 (+ 4 .cse530)) 0) (exists ((v_arrayElimCell_190 Int)) (let ((.cse532 (+ v_arrayElimCell_190 8))) (and (= .cse10 (select .cse27 .cse532)) (not (= v_arrayElimIndex_48 .cse532))))) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse528 0)) (= (select .cse531 .cse529) .cse13) (= v_arrayElimIndex_45 .cse528))))))) (.cse66 (and (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse524 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse526 (select (select |c_#memory_$Pointer$#2.offset| .cse524) .cse15))) (let ((.cse523 (select (select |c_#memory_$Pointer$#2.base| .cse524) .cse15)) (.cse525 (+ 8 .cse526))) (and (= v_arrayElimIndex_45 .cse523) (= .cse524 .cse7) (= .cse10 .cse524) (= .cse525 v_arrayElimIndex_48) (= .cse526 .cse13) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse524 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse523) .cse525) .cse13) (= v_arrayElimIndex_45 .cse524)))))) .cse92)) (.cse75 (and (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse518 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse517 (select .cse518 v_arrayElimIndex_48))) (let ((.cse516 (select (select |c_#memory_$Pointer$#2.base| .cse517) .cse15)) (.cse522 (select (select |c_#memory_$Pointer$#2.offset| .cse517) .cse15))) (let ((.cse519 (+ 4 .cse522)) (.cse521 (select |c_#memory_$Pointer$#2.offset| .cse516)) (.cse520 (+ 8 .cse522))) (and (= v_arrayElimIndex_45 .cse516) (= .cse517 .cse7) (= (select .cse518 .cse519) 0) (= .cse10 .cse517) (= .cse520 v_arrayElimIndex_48) (= (select .cse521 .cse519) 0) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse517 0)) (= (select .cse521 .cse520) .cse13))))))) .cse92)) (.cse99 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse512 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse514 (select (select |c_#memory_$Pointer$#2.offset| .cse512) .cse15))) (let ((.cse511 (select (select |c_#memory_$Pointer$#2.base| .cse512) .cse15)) (.cse513 (+ 8 .cse514))) (and (= v_arrayElimIndex_45 .cse511) (= .cse512 .cse7) (= .cse10 .cse512) (= .cse513 v_arrayElimIndex_48) (= .cse514 .cse13) (exists ((v_arrayElimCell_190 Int)) (let ((.cse515 (+ v_arrayElimCell_190 8))) (and (= .cse10 (select .cse27 .cse515)) (not (= v_arrayElimIndex_48 .cse515))))) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse512 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse511) .cse513) .cse13) (= v_arrayElimIndex_45 .cse512))))))) (.cse203 (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse508 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse507 (select .cse508 v_arrayElimIndex_48))) (let ((.cse509 (select (select |c_#memory_$Pointer$#2.offset| .cse507) .cse15))) (let ((.cse506 (select (select |c_#memory_$Pointer$#2.base| .cse507) .cse15)) (.cse510 (+ 8 .cse509))) (and (= v_arrayElimIndex_45 .cse506) (= .cse507 .cse7) (= (select .cse508 (+ 4 .cse509)) 0) (= .cse506 .cse507) (= .cse510 v_arrayElimIndex_48) (= .cse509 .cse13) (not (= .cse17 v_arrayElimIndex_48)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse506) .cse510) .cse13))))))) .cse25)) (.cse172 (and .cse25 (or .cse169 .cse171))) (.cse204 (and (or (exists ((v_arrayElimIndex_48 Int)) (and (not (= .cse17 v_arrayElimIndex_48)) (exists ((v_arrayElimIndex_45 Int)) (let ((.cse499 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse501 (select (select |c_#memory_$Pointer$#2.offset| .cse499) .cse15))) (let ((.cse498 (select (select |c_#memory_$Pointer$#2.base| .cse499) .cse15)) (.cse500 (+ 8 .cse501))) (and (= v_arrayElimIndex_45 .cse498) (= .cse499 .cse7) (= .cse500 v_arrayElimIndex_48) (= .cse501 .cse13) (not (= .cse499 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse498) .cse500) .cse13) (= v_arrayElimIndex_45 .cse499)))))))) (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse503 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse505 (select (select |c_#memory_$Pointer$#2.offset| .cse503) .cse15))) (let ((.cse502 (select (select |c_#memory_$Pointer$#2.base| .cse503) .cse15)) (.cse504 (+ 8 .cse505))) (and (= v_arrayElimIndex_45 .cse502) (= .cse503 .cse7) (= .cse504 v_arrayElimIndex_48) (= .cse505 .cse13) (not (= .cse17 v_arrayElimIndex_48)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse502) .cse504) .cse13) (= v_arrayElimIndex_45 .cse503)))))))) .cse25)) (.cse205 (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse495 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse494 (select .cse495 v_arrayElimIndex_48))) (let ((.cse496 (select (select |c_#memory_$Pointer$#2.offset| .cse494) .cse15))) (let ((.cse493 (select (select |c_#memory_$Pointer$#2.base| .cse494) .cse15)) (.cse497 (+ 8 .cse496))) (and (= v_arrayElimIndex_45 .cse493) (= .cse494 .cse7) (= (select .cse495 (+ 4 .cse496)) 0) (= .cse493 .cse494) (= .cse497 v_arrayElimIndex_48) (= .cse496 .cse13) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse10 .cse494)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse493) .cse497) .cse13))))))))) (.cse0 (and .cse1 .cse492)) (.cse3 (exists ((v_arrayElimIndex_48 Int)) (and (exists ((v_arrayElimIndex_45 Int)) (let ((.cse489 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse491 (select (select |c_#memory_$Pointer$#2.offset| .cse489) .cse15))) (let ((.cse488 (select (select |c_#memory_$Pointer$#2.base| .cse489) .cse15)) (.cse490 (+ 8 .cse491))) (and (= v_arrayElimIndex_45 .cse488) (= .cse489 .cse7) (= .cse10 .cse489) (= .cse490 v_arrayElimIndex_48) (= .cse491 .cse13) (not (= .cse489 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse488) .cse490) .cse13) (= v_arrayElimIndex_45 .cse489)))))) (not (= .cse17 v_arrayElimIndex_48))))) (.cse4 (exists ((v_arrayElimIndex_48 Int)) (and (exists ((v_arrayElimIndex_45 Int)) (let ((.cse484 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse486 (select (select |c_#memory_$Pointer$#2.offset| .cse484) .cse15)) (.cse483 (select (select |c_#memory_$Pointer$#2.base| .cse484) .cse15))) (let ((.cse487 (select |c_#memory_$Pointer$#2.offset| .cse483)) (.cse485 (+ 8 .cse486))) (and (= v_arrayElimIndex_45 .cse483) (= .cse484 .cse7) (= .cse10 .cse484) (= .cse485 v_arrayElimIndex_48) (= .cse486 .cse13) (= (select .cse487 (+ 4 .cse486)) 0) (not (= .cse484 0)) (= (select .cse487 .cse485) .cse13) (= v_arrayElimIndex_45 .cse484)))))) (not (= .cse17 v_arrayElimIndex_48))))) (.cse108 (not (= .cse7 0))) (.cse173 (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse478 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse477 (select .cse478 v_arrayElimIndex_48))) (let ((.cse476 (select (select |c_#memory_$Pointer$#2.base| .cse477) .cse15)) (.cse482 (select (select |c_#memory_$Pointer$#2.offset| .cse477) .cse15))) (let ((.cse479 (+ 4 .cse482)) (.cse481 (select |c_#memory_$Pointer$#2.offset| .cse476)) (.cse480 (+ 8 .cse482))) (and (= v_arrayElimIndex_45 .cse476) (= .cse477 .cse7) (= (select .cse478 .cse479) 0) (= .cse476 .cse477) (= .cse480 v_arrayElimIndex_48) (= (select .cse481 .cse479) 0) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse10 .cse477)) (= (select .cse481 .cse480) .cse13) (= .cse106 .cse482))))))))) (.cse206 (and (or .cse168 .cse200) .cse25)) (.cse105 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse174 (and (or (exists ((v_arrayElimIndex_48 Int)) (and (not (= .cse17 v_arrayElimIndex_48)) (exists ((v_arrayElimIndex_45 Int)) (let ((.cse464 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse463 (select .cse464 v_arrayElimIndex_48))) (let ((.cse462 (select (select |c_#memory_$Pointer$#2.base| .cse463) .cse15)) (.cse468 (select (select |c_#memory_$Pointer$#2.offset| .cse463) .cse15))) (let ((.cse465 (+ 4 .cse468)) (.cse467 (select |c_#memory_$Pointer$#2.offset| .cse462)) (.cse466 (+ 8 .cse468))) (and (= v_arrayElimIndex_45 .cse462) (= .cse463 .cse7) (= (select .cse464 .cse465) 0) (= .cse462 .cse463) (= .cse466 v_arrayElimIndex_48) (= (select .cse467 .cse465) 0) (not (= .cse463 0)) (= (select .cse467 .cse466) .cse13) (= .cse106 .cse468))))))))) (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse471 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse470 (select .cse471 v_arrayElimIndex_48))) (let ((.cse469 (select (select |c_#memory_$Pointer$#2.base| .cse470) .cse15)) (.cse475 (select (select |c_#memory_$Pointer$#2.offset| .cse470) .cse15))) (let ((.cse472 (+ 4 .cse475)) (.cse474 (select |c_#memory_$Pointer$#2.offset| .cse469)) (.cse473 (+ 8 .cse475))) (and (= v_arrayElimIndex_45 .cse469) (= .cse470 .cse7) (= (select .cse471 .cse472) 0) (= .cse469 .cse470) (= .cse473 v_arrayElimIndex_48) (= (select .cse474 .cse472) 0) (not (= .cse17 v_arrayElimIndex_48)) (= (select .cse474 .cse473) .cse13) (= .cse106 .cse475))))))))) .cse25)) (.cse125 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse456 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse455 (select .cse456 v_arrayElimIndex_48))) (let ((.cse454 (select (select |c_#memory_$Pointer$#2.base| .cse455) .cse15)) (.cse461 (select (select |c_#memory_$Pointer$#2.offset| .cse455) .cse15))) (let ((.cse457 (+ 4 .cse461)) (.cse459 (select |c_#memory_$Pointer$#2.offset| .cse454)) (.cse458 (+ 8 .cse461))) (and (= v_arrayElimIndex_45 .cse454) (= .cse455 .cse7) (= (select .cse456 .cse457) 0) (= .cse10 .cse455) (= .cse458 v_arrayElimIndex_48) (= (select .cse459 .cse457) 0) (exists ((v_arrayElimCell_190 Int)) (let ((.cse460 (+ v_arrayElimCell_190 8))) (and (= .cse10 (select .cse27 .cse460)) (not (= v_arrayElimIndex_48 .cse460))))) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse455 0)) (= (select .cse459 .cse458) .cse13) (not (= v_arrayElimIndex_45 .cse455))))))))) (.cse47 (and (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse449 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse448 (select .cse449 v_arrayElimIndex_48))) (let ((.cse447 (select (select |c_#memory_$Pointer$#2.base| .cse448) .cse15)) (.cse453 (select (select |c_#memory_$Pointer$#2.offset| .cse448) .cse15))) (let ((.cse450 (+ 4 .cse453)) (.cse452 (select |c_#memory_$Pointer$#2.offset| .cse447)) (.cse451 (+ 8 .cse453))) (and (= v_arrayElimIndex_45 .cse447) (= .cse448 .cse7) (= (select .cse449 .cse450) 0) (= .cse10 .cse448) (= .cse451 v_arrayElimIndex_48) (not (= .cse10 v_arrayElimIndex_45)) (= (select .cse452 .cse450) 0) (not (= .cse448 0)) (= (select .cse452 .cse451) .cse13))))))) .cse92)) (.cse126 (and (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse442 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse441 (select .cse442 v_arrayElimIndex_48))) (let ((.cse440 (select (select |c_#memory_$Pointer$#2.base| .cse441) .cse15)) (.cse446 (select (select |c_#memory_$Pointer$#2.offset| .cse441) .cse15))) (let ((.cse443 (+ 4 .cse446)) (.cse445 (select |c_#memory_$Pointer$#2.offset| .cse440)) (.cse444 (+ 8 .cse446))) (and (= v_arrayElimIndex_45 .cse440) (= .cse441 .cse7) (= (select .cse442 .cse443) 0) (= .cse10 .cse441) (= .cse444 v_arrayElimIndex_48) (= (select .cse445 .cse443) 0) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse441 0)) (= (select .cse445 .cse444) .cse13) (not (= v_arrayElimIndex_45 .cse441)))))))) .cse92)) (.cse124 (or (and .cse92 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse427 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse426 (select .cse427 v_arrayElimIndex_48))) (let ((.cse425 (select (select |c_#memory_$Pointer$#2.base| .cse426) .cse15)) (.cse431 (select (select |c_#memory_$Pointer$#2.offset| .cse426) .cse15))) (let ((.cse428 (+ 4 .cse431)) (.cse430 (select |c_#memory_$Pointer$#2.offset| .cse425)) (.cse429 (+ 8 .cse431))) (and (= v_arrayElimIndex_45 .cse425) (= .cse426 .cse7) (= (select .cse427 .cse428) 0) (= .cse10 .cse426) (= .cse429 v_arrayElimIndex_48) (= (select .cse430 .cse428) 0) (not (= .cse17 v_arrayElimIndex_48)) (= (select .cse430 .cse429) .cse13) (not (= v_arrayElimIndex_45 .cse426))))))))) (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse434 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse433 (select .cse434 v_arrayElimIndex_48))) (let ((.cse432 (select (select |c_#memory_$Pointer$#2.base| .cse433) .cse15)) (.cse439 (select (select |c_#memory_$Pointer$#2.offset| .cse433) .cse15))) (let ((.cse435 (+ 4 .cse439)) (.cse437 (select |c_#memory_$Pointer$#2.offset| .cse432)) (.cse436 (+ 8 .cse439))) (and (= v_arrayElimIndex_45 .cse432) (= .cse433 .cse7) (= (select .cse434 .cse435) 0) (= .cse10 .cse433) (= .cse436 v_arrayElimIndex_48) (= (select .cse437 .cse435) 0) (exists ((v_arrayElimCell_190 Int)) (let ((.cse438 (+ v_arrayElimCell_190 8))) (and (= .cse10 (select .cse27 .cse438)) (not (= v_arrayElimIndex_48 .cse438))))) (not (= .cse17 v_arrayElimIndex_48)) (= (select .cse437 .cse436) .cse13) (not (= v_arrayElimIndex_45 .cse433)))))))))) (.cse327 (and .cse1 (or .cse56 .cse67))) (.cse76 (exists ((v_arrayElimIndex_45 Int)) (and (exists ((v_arrayElimIndex_48 Int)) (let ((.cse419 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse418 (select .cse419 v_arrayElimIndex_48))) (let ((.cse417 (select (select |c_#memory_$Pointer$#2.base| .cse418) .cse15)) (.cse424 (select (select |c_#memory_$Pointer$#2.offset| .cse418) .cse15))) (let ((.cse420 (+ 4 .cse424)) (.cse422 (select |c_#memory_$Pointer$#2.offset| .cse417)) (.cse421 (+ 8 .cse424))) (and (= v_arrayElimIndex_45 .cse417) (= .cse418 .cse7) (= (select .cse419 .cse420) 0) (= .cse10 .cse418) (= .cse421 v_arrayElimIndex_48) (= (select .cse422 .cse420) 0) (exists ((v_arrayElimCell_190 Int)) (let ((.cse423 (+ v_arrayElimCell_190 8))) (and (= .cse10 (select .cse27 .cse423)) (not (= v_arrayElimIndex_48 .cse423))))) (not (= .cse418 0)) (= (select .cse422 .cse421) .cse13))))))) (not (= .cse10 v_arrayElimIndex_45))))) (.cse38 (exists ((v_prenex_37 Int)) (= (select .cse27 (+ v_prenex_37 8)) 0))) (.cse28 (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse412 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse411 (select .cse412 v_arrayElimIndex_48))) (let ((.cse410 (select (select |c_#memory_$Pointer$#2.base| .cse411) .cse15)) (.cse414 (select (select |c_#memory_$Pointer$#2.offset| .cse411) .cse15))) (let ((.cse413 (+ 4 .cse414)) (.cse416 (select |c_#memory_$Pointer$#2.offset| .cse410)) (.cse415 (+ 8 .cse414))) (and (= v_arrayElimIndex_45 .cse410) (= .cse411 .cse7) (= (select .cse412 .cse413) 0) (= .cse410 .cse411) (= .cse414 .cse15) (= .cse415 v_arrayElimIndex_48) (= (select .cse416 .cse413) 0) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse10 .cse411)) (= (select .cse416 .cse415) .cse13))))))))) (.cse134 (and (or (exists ((v_arrayElimIndex_48 Int)) (and (not (= .cse17 v_arrayElimIndex_48)) (exists ((v_arrayElimIndex_45 Int)) (let ((.cse398 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse397 (select .cse398 v_arrayElimIndex_48))) (let ((.cse396 (select (select |c_#memory_$Pointer$#2.base| .cse397) .cse15)) (.cse400 (select (select |c_#memory_$Pointer$#2.offset| .cse397) .cse15))) (let ((.cse399 (+ 4 .cse400)) (.cse402 (select |c_#memory_$Pointer$#2.offset| .cse396)) (.cse401 (+ 8 .cse400))) (and (= v_arrayElimIndex_45 .cse396) (= .cse397 .cse7) (= (select .cse398 .cse399) 0) (= .cse396 .cse397) (= .cse400 .cse15) (= .cse401 v_arrayElimIndex_48) (= (select .cse402 .cse399) 0) (not (= .cse397 0)) (= (select .cse402 .cse401) .cse13))))))))) (and (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse405 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse404 (select .cse405 v_arrayElimIndex_48))) (let ((.cse403 (select (select |c_#memory_$Pointer$#2.base| .cse404) .cse15)) (.cse407 (select (select |c_#memory_$Pointer$#2.offset| .cse404) .cse15))) (let ((.cse406 (+ 4 .cse407)) (.cse409 (select |c_#memory_$Pointer$#2.offset| .cse403)) (.cse408 (+ 8 .cse407))) (and (= v_arrayElimIndex_45 .cse403) (= .cse404 .cse7) (= (select .cse405 .cse406) 0) (= .cse403 .cse404) (= .cse407 .cse15) (= .cse408 v_arrayElimIndex_48) (= (select .cse409 .cse406) 0) (not (= .cse17 v_arrayElimIndex_48)) (= (select .cse409 .cse408) .cse13))))))) .cse1)) .cse25)) (.cse328 (exists ((v_arrayElimIndex_48 Int)) (and (not (= .cse17 v_arrayElimIndex_48)) (exists ((v_arrayElimIndex_45 Int)) (let ((.cse391 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse390 (select .cse391 v_arrayElimIndex_48))) (let ((.cse389 (select (select |c_#memory_$Pointer$#2.base| .cse390) .cse15)) (.cse393 (select (select |c_#memory_$Pointer$#2.offset| .cse390) .cse15))) (let ((.cse392 (+ 4 .cse393)) (.cse395 (select |c_#memory_$Pointer$#2.offset| .cse389)) (.cse394 (+ 8 .cse393))) (and (= v_arrayElimIndex_45 .cse389) (= .cse390 .cse7) (= (select .cse391 .cse392) 0) (= .cse389 .cse390) (= .cse393 .cse15) (= .cse394 v_arrayElimIndex_48) (= (select .cse395 .cse392) 0) (not (= .cse10 .cse390)) (not (= .cse390 0)) (= (select .cse395 .cse394) .cse13)))))))))) (.cse360 (and (or .cse116 .cse135) .cse25)) (.cse207 (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse386 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse388 (select (select |c_#memory_$Pointer$#2.offset| .cse386) .cse15))) (let ((.cse385 (select (select |c_#memory_$Pointer$#2.base| .cse386) .cse15)) (.cse387 (+ 8 .cse388))) (and (= v_arrayElimIndex_45 .cse385) (= .cse386 .cse7) (= .cse387 v_arrayElimIndex_48) (= .cse388 .cse13) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse10 .cse386)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse385) .cse387) .cse13) (= v_arrayElimIndex_45 .cse386))))))))) (or (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4 (exists ((v_arrayElimIndex_45 Int)) (and (exists ((v_arrayElimIndex_48 Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse6 (select .cse8 v_arrayElimIndex_48))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse15)) (.cse14 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse15))) (let ((.cse9 (+ 4 .cse14)) (.cse12 (select |c_#memory_$Pointer$#2.offset| .cse5)) (.cse11 (+ 8 .cse14))) (and (= v_arrayElimIndex_45 .cse5) (= .cse6 .cse7) (= (select .cse8 .cse9) 0) (= .cse10 .cse6) (= .cse11 v_arrayElimIndex_48) (= (select .cse12 .cse9) 0) (not (= .cse6 0)) (= (select .cse12 .cse11) .cse13))))))) (not (= .cse10 v_arrayElimIndex_45)))) (and .cse1 .cse16) (exists ((v_arrayElimIndex_48 Int)) (and (not (= .cse17 v_arrayElimIndex_48)) (exists ((v_arrayElimIndex_45 Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse19 (select .cse20 v_arrayElimIndex_48))) (let ((.cse18 (select (select |c_#memory_$Pointer$#2.base| .cse19) .cse15)) (.cse24 (select (select |c_#memory_$Pointer$#2.offset| .cse19) .cse15))) (let ((.cse21 (+ 4 .cse24)) (.cse23 (select |c_#memory_$Pointer$#2.offset| .cse18)) (.cse22 (+ 8 .cse24))) (and (= v_arrayElimIndex_45 .cse18) (= .cse19 .cse7) (= (select .cse20 .cse21) 0) (= .cse10 .cse19) (= .cse22 v_arrayElimIndex_48) (= (select .cse23 .cse21) 0) (not (= .cse19 0)) (= (select .cse23 .cse22) .cse13)))))))))) .cse25 (exists ((v_prenex_37 Int)) (and (not (= .cse26 (+ v_prenex_37 4))) (= .cse10 (select .cse27 (+ v_prenex_37 8)))))) .cse28 .cse29 (and (or (and .cse1 (exists ((v_arrayElimIndex_48 Int)) (let ((.cse32 (select .cse27 v_arrayElimIndex_48))) (let ((.cse33 (select (select |c_#memory_$Pointer$#2.offset| .cse32) .cse15))) (let ((.cse30 (select (select |c_#memory_$Pointer$#2.base| .cse32) .cse15)) (.cse31 (+ .cse33 8))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse30) .cse31) .cse13) (= .cse32 .cse7) (= .cse33 .cse13) (= .cse30 .cse32) (not (= .cse17 v_arrayElimIndex_48)) (= .cse30 .cse10) (= .cse31 v_arrayElimIndex_48))))))) (exists ((v_arrayElimIndex_48 Int)) (let ((.cse36 (select .cse27 v_arrayElimIndex_48))) (let ((.cse37 (select (select |c_#memory_$Pointer$#2.offset| .cse36) .cse15))) (let ((.cse34 (select (select |c_#memory_$Pointer$#2.base| .cse36) .cse15)) (.cse35 (+ .cse37 8))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse34) .cse35) .cse13) (not (= .cse36 0)) (= .cse36 .cse7) (= .cse37 .cse13) (= .cse34 .cse36) (not (= .cse17 v_arrayElimIndex_48)) (= .cse34 .cse10) (= .cse35 v_arrayElimIndex_48))))))) .cse25) (and (or (and .cse38 (or (exists ((v_arrayElimIndex_45 Int)) (and (not (= .cse10 v_arrayElimIndex_45)) (exists ((v_arrayElimIndex_48 Int) (v_arrayElimCell_190 Int)) (let ((.cse41 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse40 (select .cse41 v_arrayElimIndex_48))) (let ((.cse39 (select (select |c_#memory_$Pointer$#2.base| .cse40) .cse15)) (.cse46 (select (select |c_#memory_$Pointer$#2.offset| .cse40) .cse15))) (let ((.cse43 (+ v_arrayElimCell_190 8)) (.cse42 (+ 4 .cse46)) (.cse45 (select |c_#memory_$Pointer$#2.offset| .cse39)) (.cse44 (+ 8 .cse46))) (and (= v_arrayElimIndex_45 .cse39) (= .cse40 .cse7) (= (select .cse41 .cse42) 0) (= .cse10 (select .cse27 .cse43)) (= .cse10 .cse40) (not (= v_arrayElimIndex_48 .cse43)) (= .cse44 v_arrayElimIndex_48) (= (select .cse45 .cse42) 0) (not (= .cse40 0)) (= (select .cse45 .cse44) .cse13))))))))) .cse47)) (and .cse1 .cse38 (or (exists ((v_arrayElimIndex_45 Int)) (and (not (= .cse10 v_arrayElimIndex_45)) (exists ((v_arrayElimIndex_48 Int) (v_arrayElimCell_190 Int)) (let ((.cse50 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse49 (select .cse50 v_arrayElimIndex_48))) (let ((.cse48 (select (select |c_#memory_$Pointer$#2.base| .cse49) .cse15)) (.cse55 (select (select |c_#memory_$Pointer$#2.offset| .cse49) .cse15))) (let ((.cse52 (+ v_arrayElimCell_190 8)) (.cse51 (+ 4 .cse55)) (.cse54 (select |c_#memory_$Pointer$#2.offset| .cse48)) (.cse53 (+ 8 .cse55))) (and (= v_arrayElimIndex_45 .cse48) (= .cse49 .cse7) (= (select .cse50 .cse51) 0) (= .cse10 (select .cse27 .cse52)) (= .cse10 .cse49) (not (= v_arrayElimIndex_48 .cse52)) (= .cse53 v_arrayElimIndex_48) (= (select .cse54 .cse51) 0) (= (select .cse54 .cse53) .cse13))))))))) .cse56))) .cse25) (and (exists ((v_arrayElimIndex_48 Int)) (let ((.cse60 (select .cse27 v_arrayElimIndex_48))) (let ((.cse59 (select (select |c_#memory_$Pointer$#2.offset| .cse60) .cse15)) (.cse61 (select (select |c_#memory_$Pointer$#2.base| .cse60) .cse15))) (let ((.cse57 (select |c_#memory_$Pointer$#2.offset| .cse61)) (.cse58 (+ .cse59 8))) (and (= (select .cse57 .cse58) .cse13) (= .cse17 .cse59) (not (= .cse60 0)) (= .cse60 .cse7) (= .cse10 .cse60) (= .cse59 .cse13) (= (select .cse57 (+ .cse59 4)) 0) (= .cse61 .cse10) (= .cse58 v_arrayElimIndex_48)))))) .cse25) (and .cse25 (let ((.cse78 (select |c_#memory_$Pointer$#2.offset| 0))) (let ((.cse80 (select .cse78 .cse17))) (let ((.cse82 (select |c_#memory_$Pointer$#2.base| 0)) (.cse103 (+ .cse80 4))) (let ((.cse81 (select .cse78 .cse103)) (.cse100 (select .cse82 .cse103))) (let ((.cse101 (select |c_#memory_$Pointer$#2.base| .cse100)) (.cse79 (+ .cse81 8)) (.cse102 (select |c_#memory_$Pointer$#2.offset| .cse100)) (.cse83 (+ .cse81 4))) (let ((.cse68 (= (select .cse102 .cse83) 0)) (.cse71 (= (select .cse101 .cse79) 0)) (.cse72 (= (select .cse102 .cse79) .cse80)) (.cse74 (= (select .cse101 .cse83) 0)) (.cse70 (= (select .cse82 .cse17) 0)) (.cse69 (= .cse100 0)) (.cse73 (= .cse10 0))) (or .cse62 .cse47 .cse63 .cse64 .cse65 .cse66 (and .cse1 (or .cse56 .cse67 (and .cse68 (not .cse69) .cse70 .cse71 .cse72 .cse73 .cse74))) .cse75 .cse76 (and .cse1 (or (and (let ((.cse77 (not (= .cse26 .cse83)))) (or (and .cse68 .cse77 .cse70 .cse71 .cse72 .cse74) (and (= (select .cse78 .cse79) .cse80) .cse77 .cse70 (= .cse80 .cse81) (= 0 (select .cse82 .cse79)) .cse69))) .cse73) (exists ((v_arrayElimCell_190 Int)) (let ((.cse84 (+ v_arrayElimCell_190 8))) (and (= .cse10 (select .cse27 .cse84)) (exists ((v_arrayElimIndex_48 Int)) (and (not (= v_arrayElimIndex_48 .cse84)) (exists ((v_arrayElimIndex_45 Int)) (let ((.cse87 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse86 (select .cse87 v_arrayElimIndex_48))) (let ((.cse85 (select (select |c_#memory_$Pointer$#2.base| .cse86) .cse15)) (.cse91 (select (select |c_#memory_$Pointer$#2.offset| .cse86) .cse15))) (let ((.cse88 (+ 4 .cse91)) (.cse90 (select |c_#memory_$Pointer$#2.offset| .cse85)) (.cse89 (+ 8 .cse91))) (and (= v_arrayElimIndex_45 .cse85) (= .cse86 .cse7) (= (select .cse87 .cse88) 0) (= .cse10 .cse86) (= .cse89 v_arrayElimIndex_48) (= (select .cse90 .cse88) 0) (= (select .cse90 .cse89) .cse13))))))) (not (= .cse17 v_arrayElimIndex_48))))))) (and .cse92 .cse16) (exists ((v_arrayElimCell_190 Int)) (let ((.cse93 (+ v_arrayElimCell_190 8))) (and (= .cse10 (select .cse27 .cse93)) (exists ((v_arrayElimIndex_48 Int)) (and (not (= v_arrayElimIndex_48 .cse93)) (not (= .cse17 v_arrayElimIndex_48)) (exists ((v_arrayElimIndex_45 Int)) (let ((.cse96 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse95 (select .cse96 v_arrayElimIndex_48))) (let ((.cse97 (select (select |c_#memory_$Pointer$#2.offset| .cse95) .cse15))) (let ((.cse94 (select (select |c_#memory_$Pointer$#2.base| .cse95) .cse15)) (.cse98 (+ 8 .cse97))) (and (= v_arrayElimIndex_45 .cse94) (= .cse95 .cse7) (= (select .cse96 (+ 4 .cse97)) 0) (= .cse94 .cse95) (= .cse10 .cse95) (= .cse98 v_arrayElimIndex_48) (= .cse97 .cse13) (= (select (select |c_#memory_$Pointer$#2.offset| .cse94) .cse98) .cse13)))))))))))))) .cse99)))))))) (let ((.cse104 (select |c_#memory_$Pointer$#2.offset| .cse7))) (and (= (select .cse104 .cse15) .cse13) (= (select .cse105 .cse15) .cse7) (= (select .cse105 .cse13) 0) (or (= (select .cse105 .cse106) .cse10) .cse107) (= (select .cse104 .cse13) 0) (or .cse1 .cse108) (or .cse109 .cse25))) (and (exists ((v_arrayElimIndex_48 Int)) (let ((.cse113 (select .cse27 v_arrayElimIndex_48))) (let ((.cse112 (select (select |c_#memory_$Pointer$#2.offset| .cse113) .cse15)) (.cse115 (select (select |c_#memory_$Pointer$#2.base| .cse113) .cse15))) (let ((.cse110 (select |c_#memory_$Pointer$#2.offset| .cse115)) (.cse114 (+ .cse112 4)) (.cse111 (+ .cse112 8))) (and (= (select .cse110 .cse111) .cse13) (= .cse17 .cse112) (not (= .cse113 0)) (= .cse113 .cse7) (= (select .cse110 .cse114) 0) (= (select .cse27 .cse114) 0) (= .cse115 .cse10) (= .cse111 v_arrayElimIndex_48)))))) .cse25) .cse116 (and (or (and .cse1 (or (and .cse38 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse119 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse118 (select .cse119 v_arrayElimIndex_48))) (let ((.cse117 (select (select |c_#memory_$Pointer$#2.base| .cse118) .cse15)) (.cse123 (select (select |c_#memory_$Pointer$#2.offset| .cse118) .cse15))) (let ((.cse120 (+ 4 .cse123)) (.cse122 (select |c_#memory_$Pointer$#2.offset| .cse117)) (.cse121 (+ 8 .cse123))) (and (= v_arrayElimIndex_45 .cse117) (= .cse118 .cse7) (= (select .cse119 .cse120) 0) (= .cse10 .cse117) (= .cse121 v_arrayElimIndex_48) (= (select .cse122 .cse120) 0) (= (select .cse122 .cse121) .cse13) (not (= v_arrayElimIndex_45 .cse118)) (= .cse17 .cse123)))))))) (and .cse38 .cse124))) (and (or .cse125 .cse126) .cse38) (and .cse38 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse129 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse128 (select .cse129 v_arrayElimIndex_48))) (let ((.cse127 (select (select |c_#memory_$Pointer$#2.base| .cse128) .cse15)) (.cse133 (select (select |c_#memory_$Pointer$#2.offset| .cse128) .cse15))) (let ((.cse130 (+ 4 .cse133)) (.cse132 (select |c_#memory_$Pointer$#2.offset| .cse127)) (.cse131 (+ 8 .cse133))) (and (= v_arrayElimIndex_45 .cse127) (= .cse128 .cse7) (= (select .cse129 .cse130) 0) (= .cse10 .cse127) (= .cse131 v_arrayElimIndex_48) (= (select .cse132 .cse130) 0) (not (= .cse128 0)) (= (select .cse132 .cse131) .cse13) (not (= v_arrayElimIndex_45 .cse128)) (= .cse17 .cse133))))))))) .cse25) .cse134 .cse135 (and (or (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse139 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse137 (select .cse139 v_arrayElimIndex_48))) (let ((.cse138 (select |c_#memory_$Pointer$#2.base| .cse137))) (let ((.cse136 (select .cse138 .cse15)) (.cse143 (select (select |c_#memory_$Pointer$#2.offset| .cse137) .cse15))) (let ((.cse140 (+ 4 .cse143)) (.cse142 (select |c_#memory_$Pointer$#2.offset| .cse136)) (.cse141 (+ 8 .cse143))) (and (= v_arrayElimIndex_45 .cse136) (= .cse137 .cse7) (= .cse10 (select .cse138 .cse106)) (= (select .cse139 .cse140) 0) (= .cse141 v_arrayElimIndex_48) (not (= .cse10 v_arrayElimIndex_45)) (= (select .cse142 .cse140) 0) (= (select .cse142 .cse141) .cse13))))))))) (exists ((v_arrayElimIndex_45 Int)) (and (not (= .cse10 v_arrayElimIndex_45)) (exists ((v_arrayElimIndex_48 Int)) (let ((.cse147 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse145 (select .cse147 v_arrayElimIndex_48))) (let ((.cse146 (select |c_#memory_$Pointer$#2.base| .cse145))) (let ((.cse144 (select .cse146 .cse15)) (.cse151 (select (select |c_#memory_$Pointer$#2.offset| .cse145) .cse15))) (let ((.cse148 (+ 4 .cse151)) (.cse150 (select |c_#memory_$Pointer$#2.offset| .cse144)) (.cse149 (+ 8 .cse151))) (and (= v_arrayElimIndex_45 .cse144) (= .cse145 .cse7) (= .cse10 (select .cse146 .cse106)) (= (select .cse147 .cse148) 0) (= .cse149 v_arrayElimIndex_48) (= (select .cse150 .cse148) 0) (not (= .cse145 0)) (= (select .cse150 .cse149) .cse13))))))))))) .cse25) (and .cse25 (or (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse155 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse153 (select .cse155 v_arrayElimIndex_48))) (let ((.cse154 (select |c_#memory_$Pointer$#2.base| .cse153))) (let ((.cse152 (select .cse154 .cse15)) (.cse159 (select (select |c_#memory_$Pointer$#2.offset| .cse153) .cse15))) (let ((.cse156 (+ 4 .cse159)) (.cse158 (select |c_#memory_$Pointer$#2.offset| .cse152)) (.cse157 (+ 8 .cse159))) (and (= v_arrayElimIndex_45 .cse152) (= .cse153 .cse7) (= .cse10 (select .cse154 .cse106)) (= (select .cse155 .cse156) 0) (= .cse157 v_arrayElimIndex_48) (= (select .cse158 .cse156) 0) (not (= .cse17 v_arrayElimIndex_48)) (= (select .cse158 .cse157) .cse13))))))))) (exists ((v_arrayElimIndex_48 Int)) (and (exists ((v_arrayElimIndex_45 Int)) (let ((.cse163 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse161 (select .cse163 v_arrayElimIndex_48))) (let ((.cse162 (select |c_#memory_$Pointer$#2.base| .cse161))) (let ((.cse160 (select .cse162 .cse15)) (.cse167 (select (select |c_#memory_$Pointer$#2.offset| .cse161) .cse15))) (let ((.cse164 (+ 4 .cse167)) (.cse166 (select |c_#memory_$Pointer$#2.offset| .cse160)) (.cse165 (+ 8 .cse167))) (and (= v_arrayElimIndex_45 .cse160) (= .cse161 .cse7) (= .cse10 (select .cse162 .cse106)) (= (select .cse163 .cse164) 0) (= .cse165 v_arrayElimIndex_48) (= (select .cse166 .cse164) 0) (not (= .cse161 0)) (= (select .cse166 .cse165) .cse13)))))))) (not (= .cse17 v_arrayElimIndex_48)))))) .cse168 (and .cse38 (or .cse169 .cse170 .cse171 .cse172 .cse173 .cse174)) .cse169 .cse170 (and (or (exists ((v_arrayElimIndex_48 Int)) (let ((.cse177 (select .cse27 v_arrayElimIndex_48))) (let ((.cse180 (select (select |c_#memory_$Pointer$#2.offset| .cse177) .cse15)) (.cse179 (select (select |c_#memory_$Pointer$#2.base| .cse177) .cse15))) (let ((.cse175 (select |c_#memory_$Pointer$#2.offset| .cse179)) (.cse178 (+ .cse180 4)) (.cse176 (+ .cse180 8))) (and (= (select .cse175 .cse176) .cse13) (not (= .cse177 0)) (= .cse177 .cse7) (= .cse10 .cse177) (= (select .cse175 .cse178) 0) (not (= .cse17 v_arrayElimIndex_48)) (= (select .cse27 .cse178) 0) (= .cse179 .cse10) (= .cse176 v_arrayElimIndex_48)))))) (exists ((v_arrayElimIndex_48 Int)) (let ((.cse183 (select .cse27 v_arrayElimIndex_48))) (let ((.cse184 (select (select |c_#memory_$Pointer$#2.offset| .cse183) .cse15)) (.cse185 (select (select |c_#memory_$Pointer$#2.base| .cse183) .cse15))) (let ((.cse181 (select |c_#memory_$Pointer$#2.offset| .cse185)) (.cse182 (+ .cse184 8))) (and (= (select .cse181 .cse182) .cse13) (not (= .cse183 0)) (= .cse183 .cse7) (= .cse10 .cse183) (= .cse184 .cse13) (= (select .cse181 (+ .cse184 4)) 0) (not (= .cse17 v_arrayElimIndex_48)) (= .cse185 .cse10) (= .cse182 v_arrayElimIndex_48)))))) (and .cse1 (exists ((v_arrayElimIndex_48 Int)) (let ((.cse188 (select .cse27 v_arrayElimIndex_48))) (let ((.cse191 (select (select |c_#memory_$Pointer$#2.offset| .cse188) .cse15)) (.cse190 (select (select |c_#memory_$Pointer$#2.base| .cse188) .cse15))) (let ((.cse186 (select |c_#memory_$Pointer$#2.offset| .cse190)) (.cse189 (+ .cse191 4)) (.cse187 (+ .cse191 8))) (and (= (select .cse186 .cse187) .cse13) (= .cse188 .cse7) (= .cse10 .cse188) (= (select .cse186 .cse189) 0) (not (= .cse17 v_arrayElimIndex_48)) (= (select .cse27 .cse189) 0) (= .cse190 .cse10) (= .cse187 v_arrayElimIndex_48)))))))) .cse25) .cse171 (exists ((v_arrayElimIndex_45 Int)) (and (exists ((v_arrayElimIndex_48 Int)) (let ((.cse195 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse193 (select .cse195 v_arrayElimIndex_48))) (let ((.cse194 (select |c_#memory_$Pointer$#2.base| .cse193))) (let ((.cse192 (select .cse194 .cse15)) (.cse199 (select (select |c_#memory_$Pointer$#2.offset| .cse193) .cse15))) (let ((.cse196 (+ 4 .cse199)) (.cse198 (select |c_#memory_$Pointer$#2.offset| .cse192)) (.cse197 (+ 8 .cse199))) (and (= v_arrayElimIndex_45 .cse192) (= .cse193 .cse7) (= .cse10 (select .cse194 .cse106)) (= (select .cse195 .cse196) 0) (= .cse197 v_arrayElimIndex_48) (= (select .cse198 .cse196) 0) (not (= .cse10 .cse193)) (not (= .cse193 0)) (= (select .cse198 .cse197) .cse13)))))))) (not (= .cse10 v_arrayElimIndex_45)))) (and (or .cse29 .cse168 .cse200 .cse201 .cse202 .cse203 .cse204 .cse205 .cse206 .cse207) .cse38) (exists ((v_arrayElimIndex_48 Int)) (let ((.cse211 (select .cse27 v_arrayElimIndex_48))) (let ((.cse210 (select (select |c_#memory_$Pointer$#2.offset| .cse211) .cse15)) (.cse213 (select (select |c_#memory_$Pointer$#2.base| .cse211) .cse15))) (let ((.cse208 (select |c_#memory_$Pointer$#2.offset| .cse213)) (.cse212 (+ .cse210 4)) (.cse209 (+ .cse210 8))) (and (= (select .cse208 .cse209) .cse13) (= .cse17 .cse210) (not (= .cse211 0)) (= .cse211 .cse7) (not (= .cse10 .cse211)) (= (select .cse208 .cse212) 0) (= (select .cse27 .cse212) 0) (= .cse213 .cse10) (= .cse209 v_arrayElimIndex_48)))))) (exists ((v_arrayElimIndex_48 Int)) (and (not (= .cse17 v_arrayElimIndex_48)) (exists ((v_arrayElimIndex_45 Int)) (let ((.cse217 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse215 (select .cse217 v_arrayElimIndex_48))) (let ((.cse216 (select |c_#memory_$Pointer$#2.base| .cse215))) (let ((.cse214 (select .cse216 .cse15)) (.cse221 (select (select |c_#memory_$Pointer$#2.offset| .cse215) .cse15))) (let ((.cse218 (+ 4 .cse221)) (.cse220 (select |c_#memory_$Pointer$#2.offset| .cse214)) (.cse219 (+ 8 .cse221))) (and (= v_arrayElimIndex_45 .cse214) (= .cse215 .cse7) (= .cse10 (select .cse216 .cse106)) (= (select .cse217 .cse218) 0) (= .cse219 v_arrayElimIndex_48) (= (select .cse220 .cse218) 0) (not (= .cse10 .cse215)) (not (= .cse215 0)) (= (select .cse220 .cse219) .cse13)))))))))) (and (exists ((v_arrayElimIndex_43 Int) (v_arrayElimIndex_42 Int)) (let ((.cse224 (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_43))) (let ((.cse223 (select .cse224 v_arrayElimIndex_42))) (let ((.cse225 (+ .cse223 4))) (let ((.cse222 (select .cse105 .cse225))) (and (= v_arrayElimIndex_43 .cse222) (= .cse10 .cse222) (= .cse223 .cse13) (not (= .cse26 .cse223)) (= (select (select |c_#memory_$Pointer$#2.base| .cse222) .cse223) 0) (= (select .cse224 .cse223) 0) (= .cse222 .cse7) (= .cse225 v_arrayElimIndex_42))))))) .cse108) (exists ((v_arrayElimIndex_43 Int) (v_arrayElimIndex_42 Int)) (let ((.cse228 (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_43))) (let ((.cse227 (select .cse228 v_arrayElimIndex_42))) (let ((.cse229 (+ .cse227 4))) (let ((.cse226 (select .cse105 .cse229))) (and (= v_arrayElimIndex_43 .cse226) (= .cse227 .cse13) (not (= .cse227 0)) (= .cse10 (select .cse105 (+ .cse227 8))) (not (= .cse26 .cse227)) (= (select (select |c_#memory_$Pointer$#2.base| .cse226) .cse227) 0) (= (select .cse228 .cse227) 0) (= .cse226 .cse7) (= .cse229 v_arrayElimIndex_42))))))) (and .cse38 (or (exists ((v_arrayElimIndex_48 Int)) (and (not (= .cse17 v_arrayElimIndex_48)) (exists ((v_arrayElimIndex_45 Int)) (let ((.cse232 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse231 (select .cse232 v_arrayElimIndex_48))) (let ((.cse230 (select (select |c_#memory_$Pointer$#2.base| .cse231) .cse15)) (.cse236 (select (select |c_#memory_$Pointer$#2.offset| .cse231) .cse15))) (let ((.cse233 (+ 4 .cse236)) (.cse235 (select |c_#memory_$Pointer$#2.offset| .cse230)) (.cse234 (+ 8 .cse236))) (and (= v_arrayElimIndex_45 .cse230) (= .cse231 .cse7) (= (select .cse232 .cse233) 0) (= .cse10 .cse230) (= .cse234 v_arrayElimIndex_48) (= (select .cse235 .cse233) 0) (not (= .cse10 .cse231)) (not (= .cse231 0)) (= (select .cse235 .cse234) .cse13) (= .cse17 .cse236))))))))) (and (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse239 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse238 (select .cse239 v_arrayElimIndex_48))) (let ((.cse237 (select (select |c_#memory_$Pointer$#2.base| .cse238) .cse15)) (.cse243 (select (select |c_#memory_$Pointer$#2.offset| .cse238) .cse15))) (let ((.cse240 (+ 4 .cse243)) (.cse242 (select |c_#memory_$Pointer$#2.offset| .cse237)) (.cse241 (+ 8 .cse243))) (and (= v_arrayElimIndex_45 .cse237) (= .cse238 .cse7) (= (select .cse239 .cse240) 0) (= .cse10 .cse237) (= .cse241 v_arrayElimIndex_48) (= (select .cse242 .cse240) 0) (not (= .cse10 .cse238)) (= (select .cse242 .cse241) .cse13) (= .cse17 .cse243))))))) .cse1))) .cse200 (and .cse109 (or (exists ((v_arrayElimIndex_43 Int) (v_arrayElimIndex_42 Int)) (let ((.cse246 (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_43))) (let ((.cse245 (select .cse246 v_arrayElimIndex_42))) (let ((.cse247 (+ .cse245 4))) (let ((.cse244 (select .cse105 .cse247))) (and (= v_arrayElimIndex_43 .cse244) (= .cse245 .cse13) (not (= .cse245 0)) (= .cse10 (select .cse105 (+ .cse245 8))) (= (select (select |c_#memory_$Pointer$#2.base| .cse244) .cse245) 0) (= (select .cse246 .cse245) 0) (= .cse244 .cse7) (= .cse247 v_arrayElimIndex_42))))))) (and .cse108 (exists ((v_arrayElimIndex_43 Int) (v_arrayElimIndex_42 Int)) (let ((.cse250 (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_43))) (let ((.cse249 (select .cse250 v_arrayElimIndex_42))) (let ((.cse251 (+ .cse249 4))) (let ((.cse248 (select .cse105 .cse251))) (and (= v_arrayElimIndex_43 .cse248) (= .cse249 .cse13) (= .cse10 (select .cse105 (+ .cse249 8))) (= (select (select |c_#memory_$Pointer$#2.base| .cse248) .cse249) 0) (= (select .cse250 .cse249) 0) (= .cse248 .cse7) (= .cse251 v_arrayElimIndex_42)))))))))) (and .cse1 (or (exists ((v_arrayElimIndex_48 Int)) (let ((.cse255 (select .cse27 v_arrayElimIndex_48))) (let ((.cse254 (select (select |c_#memory_$Pointer$#2.offset| .cse255) .cse15)) (.cse257 (select (select |c_#memory_$Pointer$#2.base| .cse255) .cse15))) (let ((.cse252 (select |c_#memory_$Pointer$#2.offset| .cse257)) (.cse256 (+ .cse254 4)) (.cse253 (+ .cse254 8))) (and (= (select .cse252 .cse253) .cse13) (= .cse17 .cse254) (= .cse255 .cse7) (not (= .cse10 .cse255)) (= (select .cse252 .cse256) 0) (= (select .cse27 .cse256) 0) (= .cse257 .cse10) (= .cse253 v_arrayElimIndex_48)))))) (and (exists ((v_arrayElimIndex_48 Int)) (let ((.cse261 (select .cse27 v_arrayElimIndex_48))) (let ((.cse260 (select (select |c_#memory_$Pointer$#2.offset| .cse261) .cse15)) (.cse263 (select (select |c_#memory_$Pointer$#2.base| .cse261) .cse15))) (let ((.cse258 (select |c_#memory_$Pointer$#2.offset| .cse263)) (.cse262 (+ .cse260 4)) (.cse259 (+ .cse260 8))) (and (= (select .cse258 .cse259) .cse13) (= .cse17 .cse260) (= .cse261 .cse7) (= (select .cse258 .cse262) 0) (= (select .cse27 .cse262) 0) (= .cse263 .cse10) (= .cse259 v_arrayElimIndex_48)))))) .cse25))) (and (or (and .cse1 (exists ((v_prenex_37 Int) (v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse266 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse265 (select .cse266 v_arrayElimIndex_48))) (let ((.cse264 (select (select |c_#memory_$Pointer$#2.base| .cse265) .cse15)) (.cse271 (select (select |c_#memory_$Pointer$#2.offset| .cse265) .cse15))) (let ((.cse267 (+ 4 .cse271)) (.cse270 (+ v_prenex_37 8)) (.cse269 (select |c_#memory_$Pointer$#2.offset| .cse264)) (.cse268 (+ 8 .cse271))) (and (= v_arrayElimIndex_45 .cse264) (not (= .cse26 (+ v_prenex_37 4))) (= .cse265 .cse7) (= (select .cse266 .cse267) 0) (= .cse10 .cse265) (= .cse268 v_arrayElimIndex_48) (= (select .cse269 .cse267) 0) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse270 v_arrayElimIndex_48)) (= .cse10 (select .cse27 .cse270)) (= (select .cse269 .cse268) .cse13)))))))) (exists ((v_prenex_37 Int)) (let ((.cse276 (+ v_prenex_37 8))) (and (not (= .cse26 (+ v_prenex_37 4))) (exists ((v_arrayElimIndex_48 Int)) (and (exists ((v_arrayElimIndex_45 Int)) (let ((.cse273 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse275 (select (select |c_#memory_$Pointer$#2.offset| .cse273) .cse15))) (let ((.cse272 (select (select |c_#memory_$Pointer$#2.base| .cse273) .cse15)) (.cse274 (+ 8 .cse275))) (and (= v_arrayElimIndex_45 .cse272) (= .cse273 .cse7) (= .cse10 .cse273) (= .cse274 v_arrayElimIndex_48) (= .cse275 .cse13) (not (= .cse273 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse272) .cse274) .cse13) (= v_arrayElimIndex_45 .cse273)))))) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse276 v_arrayElimIndex_48)))) (= .cse10 (select .cse27 .cse276))))) (and .cse1 (exists ((v_prenex_37 Int) (v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse279 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse278 (select .cse279 v_arrayElimIndex_48))) (let ((.cse277 (select (select |c_#memory_$Pointer$#2.base| .cse278) .cse15)) (.cse284 (select (select |c_#memory_$Pointer$#2.offset| .cse278) .cse15))) (let ((.cse280 (+ 4 .cse284)) (.cse283 (+ v_prenex_37 8)) (.cse282 (select |c_#memory_$Pointer$#2.offset| .cse277)) (.cse281 (+ 8 .cse284))) (and (= v_arrayElimIndex_45 .cse277) (not (= .cse26 (+ v_prenex_37 4))) (= .cse278 .cse7) (= (select .cse279 .cse280) 0) (= .cse10 .cse278) (= .cse281 v_arrayElimIndex_48) (not (= .cse10 v_arrayElimIndex_45)) (= (select .cse282 .cse280) 0) (not (= .cse283 v_arrayElimIndex_48)) (= .cse10 (select .cse27 .cse283)) (= (select .cse282 .cse281) .cse13)))))))) (and .cse1 (exists ((v_prenex_37 Int) (v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse286 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse288 (select (select |c_#memory_$Pointer$#2.offset| .cse286) .cse15))) (let ((.cse289 (+ v_prenex_37 8)) (.cse285 (select (select |c_#memory_$Pointer$#2.base| .cse286) .cse15)) (.cse287 (+ 8 .cse288))) (and (= v_arrayElimIndex_45 .cse285) (not (= .cse26 (+ v_prenex_37 4))) (= .cse286 .cse7) (= .cse10 .cse286) (= .cse287 v_arrayElimIndex_48) (= .cse288 .cse13) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse289 v_arrayElimIndex_48)) (= .cse10 (select .cse27 .cse289)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse285) .cse287) .cse13) (= v_arrayElimIndex_45 .cse286))))))) (exists ((v_prenex_37 Int)) (let ((.cse297 (+ v_prenex_37 8))) (and (not (= .cse26 (+ v_prenex_37 4))) (exists ((v_arrayElimIndex_48 Int)) (and (not (= .cse17 v_arrayElimIndex_48)) (exists ((v_arrayElimIndex_45 Int)) (let ((.cse292 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse291 (select .cse292 v_arrayElimIndex_48))) (let ((.cse290 (select (select |c_#memory_$Pointer$#2.base| .cse291) .cse15)) (.cse296 (select (select |c_#memory_$Pointer$#2.offset| .cse291) .cse15))) (let ((.cse293 (+ 4 .cse296)) (.cse295 (select |c_#memory_$Pointer$#2.offset| .cse290)) (.cse294 (+ 8 .cse296))) (and (= v_arrayElimIndex_45 .cse290) (= .cse291 .cse7) (= (select .cse292 .cse293) 0) (= .cse10 .cse291) (= .cse294 v_arrayElimIndex_48) (= (select .cse295 .cse293) 0) (not (= .cse291 0)) (= (select .cse295 .cse294) .cse13))))))) (not (= .cse297 v_arrayElimIndex_48)))) (= .cse10 (select .cse27 .cse297))))) (exists ((v_prenex_37 Int)) (let ((.cse298 (+ v_prenex_37 8))) (and (not (= .cse26 (+ v_prenex_37 4))) (exists ((v_arrayElimIndex_48 Int)) (and (not (= .cse298 v_arrayElimIndex_48)) (exists ((v_arrayElimIndex_45 Int)) (let ((.cse301 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse300 (select .cse301 v_arrayElimIndex_48))) (let ((.cse299 (select (select |c_#memory_$Pointer$#2.base| .cse300) .cse15)) (.cse305 (select (select |c_#memory_$Pointer$#2.offset| .cse300) .cse15))) (let ((.cse302 (+ 4 .cse305)) (.cse304 (select |c_#memory_$Pointer$#2.offset| .cse299)) (.cse303 (+ 8 .cse305))) (and (= v_arrayElimIndex_45 .cse299) (= .cse300 .cse7) (= (select .cse301 .cse302) 0) (= .cse10 .cse300) (= .cse303 v_arrayElimIndex_48) (not (= .cse10 v_arrayElimIndex_45)) (= (select .cse304 .cse302) 0) (not (= .cse300 0)) (= (select .cse304 .cse303) .cse13))))))))) (= .cse10 (select .cse27 .cse298))))) (exists ((v_prenex_37 Int)) (let ((.cse306 (+ v_prenex_37 8))) (and (not (= .cse26 (+ v_prenex_37 4))) (= .cse10 (select .cse27 .cse306)) (exists ((v_arrayElimIndex_48 Int)) (and (exists ((v_arrayElimIndex_45 Int)) (let ((.cse308 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse310 (select (select |c_#memory_$Pointer$#2.offset| .cse308) .cse15)) (.cse307 (select (select |c_#memory_$Pointer$#2.base| .cse308) .cse15))) (let ((.cse311 (select |c_#memory_$Pointer$#2.offset| .cse307)) (.cse309 (+ 8 .cse310))) (and (= v_arrayElimIndex_45 .cse307) (= .cse308 .cse7) (= .cse10 .cse308) (= .cse309 v_arrayElimIndex_48) (= .cse310 .cse13) (= (select .cse311 (+ 4 .cse310)) 0) (not (= .cse308 0)) (= (select .cse311 .cse309) .cse13) (= v_arrayElimIndex_45 .cse308)))))) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse306 v_arrayElimIndex_48)))))))) .cse25) .cse201 .cse202 (and (or .cse62 .cse47 (and .cse1 (or (and (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse314 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse313 (select .cse314 v_arrayElimIndex_48))) (let ((.cse312 (select (select |c_#memory_$Pointer$#2.base| .cse313) .cse15)) (.cse318 (select (select |c_#memory_$Pointer$#2.offset| .cse313) .cse15))) (let ((.cse315 (+ 4 .cse318)) (.cse317 (select |c_#memory_$Pointer$#2.offset| .cse312)) (.cse316 (+ 8 .cse318))) (and (= v_arrayElimIndex_45 .cse312) (= .cse313 .cse7) (= (select .cse314 .cse315) 0) (= .cse10 .cse313) (= .cse316 v_arrayElimIndex_48) (= (select .cse317 .cse315) 0) (not (= .cse17 v_arrayElimIndex_48)) (= (select .cse317 .cse316) .cse13))))))) .cse92) (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse321 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse320 (select .cse321 v_arrayElimIndex_48))) (let ((.cse319 (select (select |c_#memory_$Pointer$#2.base| .cse320) .cse15)) (.cse326 (select (select |c_#memory_$Pointer$#2.offset| .cse320) .cse15))) (let ((.cse322 (+ 4 .cse326)) (.cse324 (select |c_#memory_$Pointer$#2.offset| .cse319)) (.cse323 (+ 8 .cse326))) (and (= v_arrayElimIndex_45 .cse319) (= .cse320 .cse7) (= (select .cse321 .cse322) 0) (= .cse10 .cse320) (= .cse323 v_arrayElimIndex_48) (= (select .cse324 .cse322) 0) (exists ((v_arrayElimCell_190 Int)) (let ((.cse325 (+ v_arrayElimCell_190 8))) (and (= .cse10 (select .cse27 .cse325)) (not (= v_arrayElimIndex_48 .cse325))))) (not (= .cse17 v_arrayElimIndex_48)) (= (select .cse324 .cse323) .cse13))))))))) .cse63 .cse64 .cse65 .cse66 .cse327 .cse75 .cse76 .cse99) .cse25) .cse203 .cse172 .cse328 .cse204 .cse205 (and .cse38 (or .cse0 (and .cse1 (or .cse329 (exists ((v_arrayElimIndex_48 Int)) (and (exists ((v_arrayElimIndex_45 Int)) (let ((.cse332 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse331 (select .cse332 v_arrayElimIndex_48))) (let ((.cse330 (select (select |c_#memory_$Pointer$#2.base| .cse331) .cse15)) (.cse336 (select (select |c_#memory_$Pointer$#2.offset| .cse331) .cse15))) (let ((.cse333 (+ 4 .cse336)) (.cse335 (select |c_#memory_$Pointer$#2.offset| .cse330)) (.cse334 (+ 8 .cse336))) (and (= v_arrayElimIndex_45 .cse330) (= .cse331 .cse7) (= (select .cse332 .cse333) 0) (= .cse10 .cse331) (= .cse10 .cse330) (= .cse334 v_arrayElimIndex_48) (= (select .cse335 .cse333) 0) (= (select .cse335 .cse334) .cse13))))))) (not (= .cse17 v_arrayElimIndex_48)))))) .cse3 (exists ((v_arrayElimIndex_48 Int)) (and (exists ((v_arrayElimIndex_45 Int)) (let ((.cse339 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse338 (select .cse339 v_arrayElimIndex_48))) (let ((.cse337 (select (select |c_#memory_$Pointer$#2.base| .cse338) .cse15)) (.cse343 (select (select |c_#memory_$Pointer$#2.offset| .cse338) .cse15))) (let ((.cse340 (+ 4 .cse343)) (.cse342 (select |c_#memory_$Pointer$#2.offset| .cse337)) (.cse341 (+ 8 .cse343))) (and (= v_arrayElimIndex_45 .cse337) (= .cse338 .cse7) (= (select .cse339 .cse340) 0) (= .cse10 .cse338) (= .cse10 .cse337) (= .cse341 v_arrayElimIndex_48) (= (select .cse342 .cse340) 0) (not (= .cse338 0)) (= (select .cse342 .cse341) .cse13))))))) (not (= .cse17 v_arrayElimIndex_48)))) .cse4) .cse25) (and (exists ((v_arrayElimIndex_43 Int) (v_arrayElimIndex_42 Int)) (let ((.cse346 (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_43))) (let ((.cse345 (select .cse346 v_arrayElimIndex_42))) (let ((.cse347 (+ .cse345 4))) (let ((.cse344 (select .cse105 .cse347))) (and (= v_arrayElimIndex_43 .cse344) (= .cse345 .cse13) (= .cse10 (select .cse105 (+ .cse345 8))) (not (= .cse26 .cse345)) (= (select (select |c_#memory_$Pointer$#2.base| .cse344) .cse345) 0) (= (select .cse346 .cse345) 0) (= .cse344 .cse7) (= .cse347 v_arrayElimIndex_42))))))) .cse108) (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse351 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse349 (select .cse351 v_arrayElimIndex_48))) (let ((.cse350 (select |c_#memory_$Pointer$#2.base| .cse349))) (let ((.cse348 (select .cse350 .cse15)) (.cse355 (select (select |c_#memory_$Pointer$#2.offset| .cse349) .cse15))) (let ((.cse352 (+ 4 .cse355)) (.cse354 (select |c_#memory_$Pointer$#2.offset| .cse348)) (.cse353 (+ 8 .cse355))) (and (= v_arrayElimIndex_45 .cse348) (= .cse349 .cse7) (= .cse10 (select .cse350 .cse106)) (= (select .cse351 .cse352) 0) (= .cse353 v_arrayElimIndex_48) (= (select .cse354 .cse352) 0) (not (= .cse17 v_arrayElimIndex_48)) (not (= .cse10 .cse349)) (= (select .cse354 .cse353) .cse13))))))))) .cse173 .cse206 (exists ((v_arrayElimIndex_43 Int) (v_arrayElimIndex_42 Int)) (let ((.cse358 (select |c_#memory_$Pointer$#2.offset| v_arrayElimIndex_43))) (let ((.cse357 (select .cse358 v_arrayElimIndex_42))) (let ((.cse359 (+ .cse357 4))) (let ((.cse356 (select .cse105 .cse359))) (and (= v_arrayElimIndex_43 .cse356) (= .cse10 .cse356) (= .cse357 .cse13) (not (= .cse357 0)) (not (= .cse26 .cse357)) (= (select (select |c_#memory_$Pointer$#2.base| .cse356) .cse357) 0) (= (select .cse358 .cse357) 0) (= .cse356 .cse7) (= .cse359 v_arrayElimIndex_42))))))) .cse174 .cse360 (and (or (exists ((v_arrayElimIndex_48 Int)) (and (exists ((v_arrayElimIndex_45 Int)) (let ((.cse362 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse365 (select (select |c_#memory_$Pointer$#2.offset| .cse362) .cse15)) (.cse363 (select |c_#memory_$Pointer$#2.base| .cse362))) (let ((.cse361 (select .cse363 .cse15)) (.cse364 (+ 8 .cse365))) (and (= v_arrayElimIndex_45 .cse361) (= .cse362 .cse7) (= .cse10 (select .cse363 .cse106)) (= .cse364 v_arrayElimIndex_48) (= .cse365 .cse13) (not (= .cse362 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse361) .cse364) .cse13) (= v_arrayElimIndex_45 .cse362)))))) (not (= .cse17 v_arrayElimIndex_48)))) (exists ((v_arrayElimIndex_48 Int)) (and (not (= .cse17 v_arrayElimIndex_48)) (exists ((v_arrayElimIndex_45 Int)) (let ((.cse367 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse368 (select |c_#memory_$Pointer$#2.base| .cse367))) (let ((.cse370 (select (select |c_#memory_$Pointer$#2.offset| .cse367) .cse15)) (.cse366 (select .cse368 .cse15))) (let ((.cse371 (select |c_#memory_$Pointer$#2.offset| .cse366)) (.cse369 (+ 8 .cse370))) (and (= v_arrayElimIndex_45 .cse366) (= .cse367 .cse7) (= .cse10 (select .cse368 .cse106)) (= .cse369 v_arrayElimIndex_48) (= .cse370 .cse13) (= (select .cse371 (+ 4 .cse370)) 0) (not (= .cse367 0)) (= (select .cse371 .cse369) .cse13) (= v_arrayElimIndex_45 .cse367))))))))) (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse373 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45) v_arrayElimIndex_48))) (let ((.cse376 (select (select |c_#memory_$Pointer$#2.offset| .cse373) .cse15)) (.cse374 (select |c_#memory_$Pointer$#2.base| .cse373))) (let ((.cse372 (select .cse374 .cse15)) (.cse375 (+ 8 .cse376))) (and (= v_arrayElimIndex_45 .cse372) (= .cse373 .cse7) (= .cse10 (select .cse374 .cse106)) (= .cse375 v_arrayElimIndex_48) (= .cse376 .cse13) (not (= .cse17 v_arrayElimIndex_48)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse372) .cse375) .cse13) (= v_arrayElimIndex_45 .cse373)))))))) .cse25) (and .cse1 (exists ((v_arrayElimIndex_48 Int) (v_arrayElimIndex_45 Int)) (let ((.cse380 (select |c_#memory_$Pointer$#2.base| v_arrayElimIndex_45))) (let ((.cse378 (select .cse380 v_arrayElimIndex_48))) (let ((.cse379 (select |c_#memory_$Pointer$#2.base| .cse378))) (let ((.cse377 (select .cse379 .cse15)) (.cse384 (select (select |c_#memory_$Pointer$#2.offset| .cse378) .cse15))) (let ((.cse381 (+ 4 .cse384)) (.cse383 (select |c_#memory_$Pointer$#2.offset| .cse377)) (.cse382 (+ 8 .cse384))) (and (= v_arrayElimIndex_45 .cse377) (= .cse378 .cse7) (= .cse10 (select .cse379 .cse106)) (= (select .cse380 .cse381) 0) (= .cse382 v_arrayElimIndex_48) (not (= .cse10 v_arrayElimIndex_45)) (= (select .cse383 .cse381) 0) (not (= .cse10 .cse378)) (= (select .cse383 .cse382) .cse13))))))))) (and .cse38 (or .cse125 .cse47 .cse126 (and .cse1 .cse124) .cse327 .cse76) .cse25) (and .cse38 (or .cse28 .cse116 .cse134 .cse135 .cse328 .cse360)) .cse207)))))))) is different from true [2023-12-19 17:04:05,276 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 46251 treesize of output 38259 [2023-12-19 17:04:05,763 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 38263 treesize of output 31195 [2023-12-19 17:04:46,348 WARN L293 SmtUtils]: Spent 23.40s on a formula simplification. DAG size of input: 4353 DAG size of output: 4298 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 17:06:49,617 WARN L293 SmtUtils]: Spent 28.25s on a formula simplification. DAG size of input: 4755 DAG size of output: 4755 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 17:07:38,639 WARN L293 SmtUtils]: Spent 15.95s on a formula simplification that was a NOOP. DAG size: 4761 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 17:08:56,697 WARN L293 SmtUtils]: Spent 17.15s on a formula simplification that was a NOOP. DAG size: 4965 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 17:10:00,732 WARN L293 SmtUtils]: Spent 18.18s on a formula simplification that was a NOOP. DAG size: 4970 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)