/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/dll2c_append_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:53:18,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:53:18,440 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-15 21:53:18,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:53:18,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:53:18,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:53:18,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:53:18,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:53:18,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:53:18,473 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:53:18,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:53:18,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:53:18,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:53:18,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:53:18,475 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:53:18,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:53:18,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:53:18,476 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:53:18,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:53:18,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:53:18,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:53:18,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:53:18,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:53:18,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:53:18,477 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:53:18,477 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:53:18,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:53:18,477 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:53:18,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:53:18,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:53:18,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:53:18,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:53:18,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:53:18,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:53:18,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:53:18,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:53:18,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:53:18,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:53:18,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:53:18,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:53:18,480 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:53:18,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:53:18,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:53:18,480 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-15 21:53:18,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:53:18,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:53:18,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:53:18,687 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:53:18,687 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:53:18,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal.i [2023-12-15 21:53:19,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:53:20,037 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:53:20,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i [2023-12-15 21:53:20,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/820a31c75/7f1098fb4cb1446a93ca0c2cd77ef746/FLAGcba35b03d [2023-12-15 21:53:20,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/820a31c75/7f1098fb4cb1446a93ca0c2cd77ef746 [2023-12-15 21:53:20,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:53:20,063 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:53:20,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:53:20,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:53:20,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:53:20,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:53:20" (1/1) ... [2023-12-15 21:53:20,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158cb8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20, skipping insertion in model container [2023-12-15 21:53:20,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:53:20" (1/1) ... [2023-12-15 21:53:20,108 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:53:20,279 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/dll2c_append_unequal.i[24672,24685] [2023-12-15 21:53:20,282 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:53:20,288 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:53:20,316 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/dll2c_append_unequal.i[24672,24685] [2023-12-15 21:53:20,317 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:53:20,335 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:53:20,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20 WrapperNode [2023-12-15 21:53:20,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:53:20,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:53:20,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:53:20,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:53:20,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20" (1/1) ... [2023-12-15 21:53:20,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20" (1/1) ... [2023-12-15 21:53:20,383 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2023-12-15 21:53:20,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:53:20,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:53:20,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:53:20,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:53:20,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20" (1/1) ... [2023-12-15 21:53:20,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20" (1/1) ... [2023-12-15 21:53:20,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20" (1/1) ... [2023-12-15 21:53:20,431 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 20, 9]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2023-12-15 21:53:20,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20" (1/1) ... [2023-12-15 21:53:20,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20" (1/1) ... [2023-12-15 21:53:20,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20" (1/1) ... [2023-12-15 21:53:20,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20" (1/1) ... [2023-12-15 21:53:20,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20" (1/1) ... [2023-12-15 21:53:20,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20" (1/1) ... [2023-12-15 21:53:20,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:53:20,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:53:20,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:53:20,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:53:20,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20" (1/1) ... [2023-12-15 21:53:20,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:53:20,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:53:20,484 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-15 21:53:20,487 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-15 21:53:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:53:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:53:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:53:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:53:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:53:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:53:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-15 21:53:20,507 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-15 21:53:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:53:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:53:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-15 21:53:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:53:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:53:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-15 21:53:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:53:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:53:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-15 21:53:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:53:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-15 21:53:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-15 21:53:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-15 21:53:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:53:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:53:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:53:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:53:20,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:53:20,601 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:53:20,602 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:53:20,751 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:53:20,779 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:53:20,780 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-15 21:53:20,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:53:20 BoogieIcfgContainer [2023-12-15 21:53:20,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:53:20,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:53:20,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:53:20,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:53:20,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:53:20" (1/3) ... [2023-12-15 21:53:20,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337a64b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:53:20, skipping insertion in model container [2023-12-15 21:53:20,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:53:20" (2/3) ... [2023-12-15 21:53:20,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337a64b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:53:20, skipping insertion in model container [2023-12-15 21:53:20,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:53:20" (3/3) ... [2023-12-15 21:53:20,788 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2023-12-15 21:53:20,799 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:53:20,800 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:53:20,831 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:53:20,835 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;@4bc8104f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:53:20,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:53:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 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-15 21:53:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-15 21:53:20,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:53:20,843 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:53:20,844 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:53:20,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:53:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash -977421440, now seen corresponding path program 1 times [2023-12-15 21:53:20,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:53:20,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035351301] [2023-12-15 21:53:20,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:20,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:53:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:21,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:53:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:21,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:53:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:53:21,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:53:21,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035351301] [2023-12-15 21:53:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035351301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:53:21,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:53:21,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:53:21,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034135296] [2023-12-15 21:53:21,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:53:21,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:53:21,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:53:21,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:53:21,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:53:21,137 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 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) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-15 21:53:21,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:53:21,197 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2023-12-15 21:53:21,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:53:21,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 18 [2023-12-15 21:53:21,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:53:21,204 INFO L225 Difference]: With dead ends: 54 [2023-12-15 21:53:21,204 INFO L226 Difference]: Without dead ends: 24 [2023-12-15 21:53:21,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-15 21:53:21,209 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:53:21,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:53:21,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-15 21:53:21,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-15 21:53:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-15 21:53:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-15 21:53:21,244 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 18 [2023-12-15 21:53:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:53:21,246 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-15 21:53:21,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-15 21:53:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-15 21:53:21,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-15 21:53:21,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:53:21,248 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:53:21,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:53:21,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:53:21,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:53:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1639470509, now seen corresponding path program 1 times [2023-12-15 21:53:21,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:53:21,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643749205] [2023-12-15 21:53:21,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:21,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:53:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:21,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:53:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:21,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:53:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:53:21,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:53:21,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643749205] [2023-12-15 21:53:21,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643749205] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:53:21,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:53:21,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:53:21,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812482115] [2023-12-15 21:53:21,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:53:21,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:53:21,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:53:21,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:53:21,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:53:21,483 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-15 21:53:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:53:21,531 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-12-15 21:53:21,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:53:21,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 18 [2023-12-15 21:53:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:53:21,532 INFO L225 Difference]: With dead ends: 45 [2023-12-15 21:53:21,532 INFO L226 Difference]: Without dead ends: 29 [2023-12-15 21:53:21,533 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-15 21:53:21,534 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:53:21,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:53:21,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-15 21:53:21,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2023-12-15 21:53:21,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-15 21:53:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-12-15 21:53:21,543 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 18 [2023-12-15 21:53:21,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:53:21,544 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-12-15 21:53:21,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-15 21:53:21,544 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-12-15 21:53:21,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 21:53:21,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:53:21,545 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:53:21,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:53:21,546 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:53:21,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:53:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2143999192, now seen corresponding path program 1 times [2023-12-15 21:53:21,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:53:21,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834976253] [2023-12-15 21:53:21,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:21,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:53:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:53:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:21,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:53:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:21,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 21:53:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:53:21,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:53:21,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834976253] [2023-12-15 21:53:21,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834976253] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:53:21,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786622858] [2023-12-15 21:53:21,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:21,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:53:21,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:53:21,976 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-15 21:53:22,000 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-15 21:53:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:22,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-15 21:53:22,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:53:22,361 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-15 21:53:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:53:22,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:53:22,416 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-15 21:53:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:53:22,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786622858] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:53:22,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:53:22,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 18 [2023-12-15 21:53:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117636905] [2023-12-15 21:53:22,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:53:22,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-15 21:53:22,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:53:22,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-15 21:53:22,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-12-15 21:53:22,451 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-15 21:53:26,464 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-15 21:53:30,475 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-15 21:53:34,489 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-15 21:53:38,521 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-15 21:53:42,530 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-15 21:53:46,729 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-15 21:53:50,748 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-15 21:53:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:53:50,759 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2023-12-15 21:53:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-15 21:53:50,759 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 26 [2023-12-15 21:53:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:53:50,760 INFO L225 Difference]: With dead ends: 53 [2023-12-15 21:53:50,760 INFO L226 Difference]: Without dead ends: 32 [2023-12-15 21:53:50,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 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-15 21:53:50,761 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:53:50,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 265 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 228 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2023-12-15 21:53:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-15 21:53:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-12-15 21:53:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-15 21:53:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-12-15 21:53:50,765 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 26 [2023-12-15 21:53:50,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:53:50,765 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-12-15 21:53:50,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-15 21:53:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-12-15 21:53:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 21:53:50,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:53:50,766 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:53:50,777 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-15 21:53:50,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:53:50,975 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:53:50,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:53:50,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2142152150, now seen corresponding path program 1 times [2023-12-15 21:53:50,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:53:50,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169590595] [2023-12-15 21:53:50,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:50,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:53:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:52,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:53:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:52,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:53:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 21:53:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:53:52,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:53:52,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169590595] [2023-12-15 21:53:52,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169590595] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:53:52,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158729585] [2023-12-15 21:53:52,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:52,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:53:52,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:53:52,625 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-15 21:53:52,645 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-15 21:53:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:53,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 108 conjunts are in the unsatisfiable core [2023-12-15 21:53:53,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:53:53,223 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-15 21:53:53,385 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-15 21:53:53,457 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:53:53,457 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-15 21:53:53,516 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 23 treesize of output 11 [2023-12-15 21:53:53,569 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-15 21:53:53,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:53:53,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-12-15 21:53:53,692 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 20 treesize of output 1 [2023-12-15 21:53:53,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:53:53,700 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-15 21:53:53,704 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 26 treesize of output 15 [2023-12-15 21:53:53,756 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 14 [2023-12-15 21:53:53,760 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-15 21:53:53,763 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-15 21:53:53,904 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-15 21:53:53,904 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 20 treesize of output 23 [2023-12-15 21:53:53,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:53:53,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-12-15 21:53:53,953 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-15 21:53:53,953 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-15 21:53:54,175 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 84 treesize of output 52 [2023-12-15 21:53:54,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:53:54,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:53:54,184 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 45 treesize of output 36 [2023-12-15 21:53:54,187 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 26 treesize of output 15 [2023-12-15 21:53:54,231 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-15 21:53:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:53:54,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:53:54,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158729585] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:53:54,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:53:54,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2023-12-15 21:53:54,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824242659] [2023-12-15 21:53:54,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:53:54,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-15 21:53:54,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:53:54,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-15 21:53:54,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1894, Unknown=30, NotChecked=0, Total=2070 [2023-12-15 21:53:54,633 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-15 21:53:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:53:55,573 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2023-12-15 21:53:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-15 21:53:55,573 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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 26 [2023-12-15 21:53:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:53:55,574 INFO L225 Difference]: With dead ends: 55 [2023-12-15 21:53:55,574 INFO L226 Difference]: Without dead ends: 53 [2023-12-15 21:53:55,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=260, Invalid=3131, Unknown=31, NotChecked=0, Total=3422 [2023-12-15 21:53:55,575 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:53:55,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 268 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:53:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-15 21:53:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2023-12-15 21:53:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-15 21:53:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-12-15 21:53:55,580 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 26 [2023-12-15 21:53:55,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:53:55,581 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-12-15 21:53:55,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-15 21:53:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-12-15 21:53:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-15 21:53:55,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:53:55,581 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:53:55,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 21:53:55,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-15 21:53:55,782 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:53:55,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:53:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2125151189, now seen corresponding path program 1 times [2023-12-15 21:53:55,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:53:55,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267714392] [2023-12-15 21:53:55,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:55,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:53:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:57,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:53:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:53:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:57,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 21:53:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:53:57,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:53:57,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267714392] [2023-12-15 21:53:57,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267714392] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:53:57,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867079416] [2023-12-15 21:53:57,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:57,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:53:57,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:53:57,865 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-15 21:53:57,890 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-15 21:53:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:58,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 98 conjunts are in the unsatisfiable core [2023-12-15 21:53:58,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:53:58,288 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-15 21:53:58,514 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2023-12-15 21:53:58,515 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2023-12-15 21:53:58,536 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-15 21:53:58,544 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2023-12-15 21:53:58,545 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2023-12-15 21:53:58,566 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:53:58,567 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 33 treesize of output 32 [2023-12-15 21:53:58,579 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from false [2023-12-15 21:53:58,587 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from true [2023-12-15 21:53:58,614 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))))) is different from false [2023-12-15 21:53:58,615 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))))) is different from true [2023-12-15 21:53:58,674 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-15 21:53:58,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 104 [2023-12-15 21:53:58,690 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 104 treesize of output 94 [2023-12-15 21:53:58,703 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 38 [2023-12-15 21:53:58,724 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse2 (select .cse1 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select .cse1 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1))))))) is different from false [2023-12-15 21:53:58,726 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse2 (select .cse1 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select .cse1 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1))))))) is different from true [2023-12-15 21:53:58,734 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 33 treesize of output 9 [2023-12-15 21:53:58,746 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2023-12-15 21:53:58,747 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2023-12-15 21:53:58,763 WARN L854 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2023-12-15 21:53:58,765 WARN L876 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2023-12-15 21:53:58,788 WARN L854 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2023-12-15 21:53:58,789 WARN L876 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2023-12-15 21:53:58,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:53:58,820 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 41 treesize of output 24 [2023-12-15 21:53:58,856 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse1 (select .cse3 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= (select .cse3 4) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))))))) is different from false [2023-12-15 21:53:58,859 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse1 (select .cse3 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= (select .cse3 4) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))))))) is different from true [2023-12-15 21:53:58,901 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse1 (select .cse0 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 4) .cse1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))))))) is different from false [2023-12-15 21:53:58,903 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse1 (select .cse0 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 4) .cse1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse3)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))))))) is different from true [2023-12-15 21:53:58,928 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-15 21:53:58,933 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:53:58,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:53:58,942 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 173 treesize of output 44 [2023-12-15 21:53:58,968 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-15 21:53:58,972 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:53:58,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:53:58,981 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 229 treesize of output 54 [2023-12-15 21:53:59,006 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-15 21:53:59,010 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:53:59,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:53:59,022 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 225 treesize of output 56 [2023-12-15 21:53:59,038 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:53:59,044 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 431 treesize of output 343 [2023-12-15 21:53:59,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:53:59,070 INFO L349 Elim1Store]: treesize reduction 223, result has 4.7 percent of original size [2023-12-15 21:53:59,070 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 375 treesize of output 89 [2023-12-15 21:53:59,199 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse11 4))) (let ((.cse3 (select .cse11 0)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse2 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse2)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse2 .cse3)))) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_old(#valid)_AFTER_CALL_9| .cse6))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse7 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse7)) (= .cse7 .cse3)))))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_old(#valid)_AFTER_CALL_9| .cse8))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))) (or (and (not (= .cse0 .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse9 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= .cse1 .cse9) (= .cse9 .cse3))))) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse10 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse1 .cse10) (= .cse10 .cse3))))))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse12) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13)))))))) is different from false [2023-12-15 21:53:59,203 WARN L876 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse11 4))) (let ((.cse3 (select .cse11 0)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse2 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse2)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse2 .cse3)))) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_old(#valid)_AFTER_CALL_9| .cse6))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse7 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse7)) (= .cse7 .cse3)))))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_old(#valid)_AFTER_CALL_9| .cse8))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))) (or (and (not (= .cse0 .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse9 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= .cse1 .cse9) (= .cse9 .cse3))))) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse10 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse1 .cse10) (= .cse10 .cse3))))))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse12) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13)))))))) is different from true [2023-12-15 21:53:59,366 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse11 4))) (let ((.cse3 (select .cse11 0)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse2 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse2)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse2 .cse3)))) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_old(#valid)_AFTER_CALL_9| .cse6))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse7 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse7)) (= .cse7 .cse3)))))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_old(#valid)_AFTER_CALL_9| .cse8))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))) (or (and (not (= .cse0 .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse9 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= .cse1 .cse9) (= .cse9 .cse3))))) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse10 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse1 .cse10) (= .cse10 .cse3)))))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse12) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))) is different from false [2023-12-15 21:53:59,371 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse11 4))) (let ((.cse3 (select .cse11 0)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse2 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse2)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse2 .cse3)))) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_old(#valid)_AFTER_CALL_9| .cse6))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse7 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse7)) (= .cse7 .cse3)))))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse8 (select |v_old(#valid)_AFTER_CALL_9| .cse8))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)))) (or (and (not (= .cse0 .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse9 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= .cse1 .cse9) (= .cse9 .cse3))))) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse10 (select .cse4 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse1 .cse10) (= .cse10 .cse3)))))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse12) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))) is different from true [2023-12-15 21:53:59,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:53:59,595 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 394 treesize of output 282 [2023-12-15 21:53:59,678 INFO L349 Elim1Store]: treesize reduction 104, result has 32.0 percent of original size [2023-12-15 21:53:59,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 264 treesize of output 191 [2023-12-15 21:53:59,711 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 21:53:59,711 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-15 21:54:00,112 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_43)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_43) 1))) (exists ((v_arrayElimCell_43 Int) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int))) (and (= v_prenex_7 (let ((.cse1 (@diff v_prenex_5 v_prenex_7))) (store v_prenex_5 .cse1 (select v_prenex_7 .cse1)))) (= (select v_prenex_7 v_arrayElimCell_43) 1) (= (select v_prenex_7 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select v_prenex_5 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_5 v_arrayElimCell_43) 0)))) is different from false [2023-12-15 21:54:00,115 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_43)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_43) 1))) (exists ((v_arrayElimCell_43 Int) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int))) (and (= v_prenex_7 (let ((.cse1 (@diff v_prenex_5 v_prenex_7))) (store v_prenex_5 .cse1 (select v_prenex_7 .cse1)))) (= (select v_prenex_7 v_arrayElimCell_43) 1) (= (select v_prenex_7 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select v_prenex_5 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_5 v_arrayElimCell_43) 0)))) is different from true [2023-12-15 21:54:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-15 21:54:00,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:00,205 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 582 treesize of output 470 [2023-12-15 21:54:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867079416] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:19,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:54:19,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2023-12-15 21:54:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749435139] [2023-12-15 21:54:19,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:19,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-15 21:54:19,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:19,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-15 21:54:19,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1107, Unknown=29, NotChecked=1014, Total=2256 [2023-12-15 21:54:19,610 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 42 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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-15 21:54:19,853 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2023-12-15 21:54:19,854 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2023-12-15 21:54:19,857 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2023-12-15 21:54:19,858 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2023-12-15 21:54:19,861 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2023-12-15 21:54:19,863 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2023-12-15 21:54:19,866 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0))) is different from false [2023-12-15 21:54:19,868 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0))) is different from true [2023-12-15 21:54:19,875 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (select .cse2 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select |c_#valid| .cse1) 1) (= (select .cse2 4) .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_append_~data#1|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 1))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0))))) is different from false [2023-12-15 21:54:19,877 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (select .cse2 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= (select |c_#valid| .cse1) 1) (= (select .cse2 4) .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_append_~data#1|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 1))) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0))))) is different from true [2023-12-15 21:54:19,903 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2023-12-15 21:54:19,904 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2023-12-15 21:54:19,911 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |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) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2023-12-15 21:54:19,912 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |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) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2023-12-15 21:54:19,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse1)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#valid| (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse1 (select |c_#memory_$Pointer$#1.offset| .cse1))))) is different from false [2023-12-15 21:54:19,924 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse1)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#valid| (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse2 (select |c_#valid| .cse2)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse1 (select |c_#memory_$Pointer$#1.offset| .cse1))))) is different from true [2023-12-15 21:54:19,934 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse7 (select .cse5 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse1 (select .cse4 0)) (.cse6 (= .cse7 .cse3))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3)) (= (select .cse4 4) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse5 0))) .cse6) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (not .cse6) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8)) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse8) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse9 (select |v_#valid_BEFORE_CALL_7| .cse9))))))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from false [2023-12-15 21:54:19,937 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse7 (select .cse5 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse1 (select .cse4 0)) (.cse6 (= .cse7 .cse3))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3)) (= (select .cse4 4) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse5 0))) .cse6) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (not .cse6) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8)) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse8) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse9 (select |v_#valid_BEFORE_CALL_7| .cse9))))))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from true [2023-12-15 21:54:19,968 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse0 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse8 (select .cse0 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse4 (select .cse3 0)) (.cse2 (= .cse8 .cse7)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (or (and (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse0 0))) .cse1) .cse2) (= (select .cse3 4) .cse4) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse6) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (or (not .cse2) (and .cse1 (= 0 (select (store (select |c_#memory_$Pointer$#1.offset| .cse8) (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4) 0) 0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8)))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_7| .cse10))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from false [2023-12-15 21:54:19,971 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse0 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse8 (select .cse0 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse4 (select .cse3 0)) (.cse2 (= .cse8 .cse7)) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (or (and (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse0 0))) .cse1) .cse2) (= (select .cse3 4) .cse4) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse6) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (or (not .cse2) (and .cse1 (= 0 (select (store (select |c_#memory_$Pointer$#1.offset| .cse8) (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4) 0) 0)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8)))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse10 (select |v_#valid_BEFORE_CALL_7| .cse10))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from true [2023-12-15 21:54:20,048 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select .cse0 0) 0) (let ((.cse2 (select .cse13 0))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse1 (select .cse12 4))) (let ((.cse4 (select .cse12 0)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse3 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse3)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse3 .cse4)))) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_old(#valid)_AFTER_CALL_9| .cse6))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)))))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_old(#valid)_AFTER_CALL_9| .cse7))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse8 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse8)) (= .cse8 .cse4)))))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_old(#valid)_AFTER_CALL_9| .cse9))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)))) (or (and (not (= .cse1 .cse2)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse10 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= .cse2 .cse10) (= .cse10 .cse4))))) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse11 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse2 .cse11) (= .cse11 .cse4))))))))))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| .cse15))) (let ((.cse14 (select .cse16 4))) (or (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse14) 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse15) 0) 0)) (not (= (select .cse16 0) .cse14)))))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse17 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse17) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse17) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse18 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse18 (select |v_#valid_BEFORE_CALL_7| .cse18))))))))) is different from false [2023-12-15 21:54:20,052 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select .cse0 0) 0) (let ((.cse2 (select .cse13 0))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse1 (select .cse12 4))) (let ((.cse4 (select .cse12 0)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse3 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse3)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse3 .cse4)))) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_old(#valid)_AFTER_CALL_9| .cse6))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)))))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_old(#valid)_AFTER_CALL_9| .cse7))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse8 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse8)) (= .cse8 .cse4)))))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_old(#valid)_AFTER_CALL_9| .cse9))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)))) (or (and (not (= .cse1 .cse2)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse10 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= .cse2 .cse10) (= .cse10 .cse4))))) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse11 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse2 .cse11) (= .cse11 .cse4))))))))))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| .cse15))) (let ((.cse14 (select .cse16 4))) (or (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse14) 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse15) 0) 0)) (not (= (select .cse16 0) .cse14)))))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse17 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse17) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse17) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse18 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse18 (select |v_#valid_BEFORE_CALL_7| .cse18))))))))) is different from true [2023-12-15 21:54:20,140 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select .cse14 0))) (and (= (select .cse0 0) 0) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse1 (select .cse12 4))) (let ((.cse4 (select .cse12 0)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse3 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse3)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse3 .cse4)))) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_old(#valid)_AFTER_CALL_9| .cse6))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)))))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_old(#valid)_AFTER_CALL_9| .cse7))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse8 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse8)) (= .cse8 .cse4)))))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_old(#valid)_AFTER_CALL_9| .cse9))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)))) (or (and (not (= .cse1 .cse2)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse10 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= .cse2 .cse10) (= .cse10 .cse4))))) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse11 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse2 .cse11) (= .cse11 .cse4)))))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (or (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse13) 8)) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (not (= (select (select |c_#memory_$Pointer$#1.base| (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) .cse13)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse15) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse15) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse16 (select |v_#valid_BEFORE_CALL_7| .cse16))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)))) is different from false [2023-12-15 21:54:20,144 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select .cse14 0))) (and (= (select .cse0 0) 0) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse1 (select .cse12 4))) (let ((.cse4 (select .cse12 0)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse3 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse3)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse3 .cse4)))) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_old(#valid)_AFTER_CALL_9| .cse6))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)))))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_old(#valid)_AFTER_CALL_9| .cse7))) |v_old(#valid)_AFTER_CALL_9|) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse8 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse8)) (= .cse8 .cse4)))))))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse9 (select |v_old(#valid)_AFTER_CALL_9| .cse9))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)))) (or (and (not (= .cse1 .cse2)) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse10 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (= .cse2 .cse10) (= .cse10 .cse4))))) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse11 (select .cse5 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)))) (and (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse2 .cse11) (= .cse11 .cse4)))))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (or (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse13) 8)) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (not (= (select (select |c_#memory_$Pointer$#1.base| (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) .cse13)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse15) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse15) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse16 (select |v_#valid_BEFORE_CALL_7| .cse16))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)))) is different from true [2023-12-15 21:54:20,163 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_43)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_43) 1))) (exists ((v_arrayElimCell_43 Int) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int))) (and (= v_prenex_7 (let ((.cse1 (@diff v_prenex_5 v_prenex_7))) (store v_prenex_5 .cse1 (select v_prenex_7 .cse1)))) (= (select v_prenex_7 v_arrayElimCell_43) 1) (= (select v_prenex_7 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select v_prenex_5 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_5 v_arrayElimCell_43) 0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)))) is different from false [2023-12-15 21:54:20,166 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_43)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_43) 1))) (exists ((v_arrayElimCell_43 Int) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int))) (and (= v_prenex_7 (let ((.cse1 (@diff v_prenex_5 v_prenex_7))) (store v_prenex_5 .cse1 (select v_prenex_7 .cse1)))) (= (select v_prenex_7 v_arrayElimCell_43) 1) (= (select v_prenex_7 |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (select v_prenex_5 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_5 v_arrayElimCell_43) 0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)))) is different from true [2023-12-15 21:54:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:20,224 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2023-12-15 21:54:20,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-15 21:54:20,224 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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 29 [2023-12-15 21:54:20,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:20,225 INFO L225 Difference]: With dead ends: 61 [2023-12-15 21:54:20,225 INFO L226 Difference]: Without dead ends: 56 [2023-12-15 21:54:20,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=157, Invalid=1374, Unknown=55, NotChecked=2574, Total=4160 [2023-12-15 21:54:20,227 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1078 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:20,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 344 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 312 Invalid, 0 Unknown, 1078 Unchecked, 0.2s Time] [2023-12-15 21:54:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-15 21:54:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-15 21:54:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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-15 21:54:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2023-12-15 21:54:20,233 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 29 [2023-12-15 21:54:20,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:20,233 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2023-12-15 21:54:20,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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-15 21:54:20,233 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2023-12-15 21:54:20,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-15 21:54:20,234 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:20,234 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:20,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-15 21:54:20,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:20,443 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:20,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:20,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2125194899, now seen corresponding path program 1 times [2023-12-15 21:54:20,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:20,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424142494] [2023-12-15 21:54:20,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:20,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:22,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:22,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:22,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 21:54:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:54:22,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424142494] [2023-12-15 21:54:22,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424142494] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50747281] [2023-12-15 21:54:22,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:22,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:22,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:22,872 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-15 21:54:22,873 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-15 21:54:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:23,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 171 conjunts are in the unsatisfiable core [2023-12-15 21:54:23,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:23,332 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-15 21:54:23,337 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-15 21:54:23,608 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2023-12-15 21:54:23,611 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2023-12-15 21:54:23,625 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-15 21:54:23,631 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-15 21:54:23,662 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:54:23,662 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 16 treesize of output 15 [2023-12-15 21:54:23,678 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (exists ((|v_#memory_int#1_229| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int#1_229| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_#memory_int#1|) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_4| |v_#memory_int#1_229|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1) (= |v_#memory_int#1_229| (store |v_#memory_int#1_BEFORE_CALL_4| .cse1 (select |v_#memory_int#1_229| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1))) is different from false [2023-12-15 21:54:23,681 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (exists ((|v_#memory_int#1_229| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int#1_229| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_#memory_int#1|) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_4| |v_#memory_int#1_229|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1) (= |v_#memory_int#1_229| (store |v_#memory_int#1_BEFORE_CALL_4| .cse1 (select |v_#memory_int#1_229| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1))) is different from true [2023-12-15 21:54:23,714 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:54:23,714 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 132 treesize of output 115 [2023-12-15 21:54:23,727 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-12-15 21:54:23,727 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-15 21:54:23,748 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 47 treesize of output 23 [2023-12-15 21:54:23,755 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse2) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse2)))) is different from false [2023-12-15 21:54:23,757 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse2) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse2)))) is different from true [2023-12-15 21:54:23,787 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse2) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse2)))) is different from false [2023-12-15 21:54:23,789 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse2) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse2)))) is different from true [2023-12-15 21:54:23,866 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-15 21:54:23,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 282 treesize of output 208 [2023-12-15 21:54:23,872 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 208 treesize of output 178 [2023-12-15 21:54:23,884 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 71 treesize of output 35 [2023-12-15 21:54:23,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:23,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2023-12-15 21:54:23,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:23,900 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 95 treesize of output 57 [2023-12-15 21:54:23,910 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 28 [2023-12-15 21:54:23,982 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse2 (select .cse1 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select .cse1 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse3 4) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |c_#valid| .cse4)))))) (= (select .cse3 0) 0) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0))))) is different from false [2023-12-15 21:54:23,984 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse0)) (.cse2 (select .cse1 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select .cse1 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse3 4) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse4 (select |c_#valid| .cse4)))))) (= (select .cse3 0) 0) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0))))) is different from true [2023-12-15 21:54:23,997 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 63 treesize of output 23 [2023-12-15 21:54:24,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:24,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 10 [2023-12-15 21:54:24,009 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 7 treesize of output 3 [2023-12-15 21:54:24,028 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_65) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_12| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-12-15 21:54:24,029 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_65) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_12| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-12-15 21:54:24,055 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_65) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_12| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-12-15 21:54:24,056 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_65) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_12| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-12-15 21:54:24,086 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_65) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_12| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1)))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2023-12-15 21:54:24,088 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_65) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_12| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1)))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2023-12-15 21:54:24,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:24,122 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 71 treesize of output 42 [2023-12-15 21:54:24,149 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2023-12-15 21:54:24,151 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 78 [2023-12-15 21:54:24,243 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-15 21:54:24,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2023-12-15 21:54:24,273 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse6 (select .cse7 0))) (let ((.cse4 (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse6))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse6))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse0 (= (select .cse2 0) 0)) (.cse3 (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse5))) (or (and .cse0 (= .cse1 .cse2) (= (select .cse2 4) 0)) (and (or (and (= (select .cse1 4) 0) (= (select .cse1 0) 0)) .cse3) (or .cse0 .cse4) (not (= .cse5 .cse6))) (and .cse3 .cse4)))) (= (select .cse7 4) .cse6) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse8) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse9 (select |v_#valid_BEFORE_CALL_12| .cse9)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse8) 1)))) (or (= (select (select |c_#memory_int#1| .cse6) 8) 1) .cse4) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse10 (select |v_#valid_BEFORE_CALL_13| .cse10))) |v_#valid_BEFORE_CALL_13|))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))))) is different from false [2023-12-15 21:54:24,276 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse6 (select .cse7 0))) (let ((.cse4 (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse6))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse6))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse0 (= (select .cse2 0) 0)) (.cse3 (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse5))) (or (and .cse0 (= .cse1 .cse2) (= (select .cse2 4) 0)) (and (or (and (= (select .cse1 4) 0) (= (select .cse1 0) 0)) .cse3) (or .cse0 .cse4) (not (= .cse5 .cse6))) (and .cse3 .cse4)))) (= (select .cse7 4) .cse6) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse8) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse9 (select |v_#valid_BEFORE_CALL_12| .cse9)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse8) 1)))) (or (= (select (select |c_#memory_int#1| .cse6) 8) 1) .cse4) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse10 (select |v_#valid_BEFORE_CALL_13| .cse10))) |v_#valid_BEFORE_CALL_13|))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))))) is different from true [2023-12-15 21:54:24,391 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse6 (select .cse8 0))) (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse6))) (let ((.cse3 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (.cse1 (= (select .cse4 0) 0)) (.cse2 (select |c_#memory_$Pointer$#1.offset| .cse5))) (or (and (or .cse0 .cse1) (or (and (= (select .cse2 4) 0) (= (select .cse2 0) 0)) .cse3)) (and .cse0 .cse3) (and .cse1 (= .cse2 .cse4) (= (select .cse4 4) 0))))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= (select .cse8 4) .cse6) (or .cse0 (= (select (select |c_#memory_int#1| .cse6) 8) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse9) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse10 (select |v_#valid_BEFORE_CALL_12| .cse10)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse9) 1)))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0)))))) is different from false [2023-12-15 21:54:24,394 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse6 (select .cse8 0))) (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse6))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse6))) (let ((.cse3 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (.cse1 (= (select .cse4 0) 0)) (.cse2 (select |c_#memory_$Pointer$#1.offset| .cse5))) (or (and (or .cse0 .cse1) (or (and (= (select .cse2 4) 0) (= (select .cse2 0) 0)) .cse3)) (and .cse0 .cse3) (and .cse1 (= .cse2 .cse4) (= (select .cse4 4) 0))))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_13| .cse7))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= (select .cse8 4) .cse6) (or .cse0 (= (select (select |c_#memory_int#1| .cse6) 8) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse9) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse10 (select |v_#valid_BEFORE_CALL_12| .cse10)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse9) 1)))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0)))))) is different from true [2023-12-15 21:54:24,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 360 treesize of output 153 [2023-12-15 21:54:24,489 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 77 [2023-12-15 21:54:24,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 428 treesize of output 197 [2023-12-15 21:54:24,522 INFO L349 Elim1Store]: treesize reduction 178, result has 0.6 percent of original size [2023-12-15 21:54:24,522 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 693 treesize of output 246 [2023-12-15 21:54:24,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 379 treesize of output 164 [2023-12-15 21:54:24,538 WARN L200 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:54:24,552 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:54:24,556 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:54:24,561 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:54:24,566 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:54:24,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 364 treesize of output 157 [2023-12-15 21:54:24,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 604 treesize of output 219 [2023-12-15 21:54:24,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:24,611 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 0 case distinctions, treesize of input 245 treesize of output 124 [2023-12-15 21:54:24,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 413 treesize of output 190 [2023-12-15 21:54:24,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:24,628 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 51 [2023-12-15 21:54:24,633 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 0 case distinctions, treesize of input 23 treesize of output 29 [2023-12-15 21:54:24,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 379 treesize of output 164 [2023-12-15 21:54:24,675 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:54:24,680 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:54:24,684 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:54:24,689 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:54:24,753 INFO L349 Elim1Store]: treesize reduction 355, result has 3.0 percent of original size [2023-12-15 21:54:24,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 759 treesize of output 291 [2023-12-15 21:54:24,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 142 [2023-12-15 21:54:24,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:24,793 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 158 treesize of output 120 [2023-12-15 21:54:24,798 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 116 treesize of output 38 [2023-12-15 21:54:24,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:24,816 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 38 treesize of output 19 [2023-12-15 21:54:24,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2023-12-15 21:54:24,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 67 treesize of output 107 [2023-12-15 21:54:24,866 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:24,866 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:24,867 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 0 case distinctions, treesize of input 26 treesize of output 7 [2023-12-15 21:54:24,902 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:54:24,916 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse1 (select .cse9 0)) (.cse0 (select .cse9 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse3 (= (select .cse4 0) 0))) (or (and (= (select .cse2 0) 0) .cse3) (and (= (store (store .cse4 0 0) 4 0) .cse2) .cse3 (= (select .cse4 4) 0))))) (= (select .cse2 4) 0) (not (= .cse5 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_12| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) .cse1) (= (select (select |c_#memory_int#1| .cse1) 8) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse8 (select |v_#valid_BEFORE_CALL_13| .cse8))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 0))))))) is different from false [2023-12-15 21:54:24,919 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse1 (select .cse9 0)) (.cse0 (select .cse9 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse3 (= (select .cse4 0) 0))) (or (and (= (select .cse2 0) 0) .cse3) (and (= (store (store .cse4 0 0) 4 0) .cse2) .cse3 (= (select .cse4 4) 0))))) (= (select .cse2 4) 0) (not (= .cse5 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_12| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) .cse1) (= (select (select |c_#memory_int#1| .cse1) 8) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse8 (select |v_#valid_BEFORE_CALL_13| .cse8))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 0))))))) is different from true [2023-12-15 21:54:25,027 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse1 (select .cse7 0)) (.cse0 (select .cse7 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 4) 0) (not (= .cse3 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_12| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 1)))) (= (select .cse2 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) .cse1) (= (select (select |c_#memory_int#1| .cse1) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3))))) is different from false [2023-12-15 21:54:25,029 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse1 (select .cse7 0)) (.cse0 (select .cse7 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 4) 0) (not (= .cse3 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_12| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 1)))) (= (select .cse2 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) .cse1) (= (select (select |c_#memory_int#1| .cse1) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3))))) is different from true [2023-12-15 21:54:25,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:25,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 132 [2023-12-15 21:54:25,158 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 21:54:25,158 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 45 [2023-12-15 21:54:25,168 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-15 21:54:25,178 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 21:54:25,179 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-15 21:54:25,219 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_arrayElimCell_111 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_111) 1) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_111) 0))) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) 1)) is different from false [2023-12-15 21:54:25,221 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_arrayElimCell_111 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_111) 1) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_111) 0))) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) 1)) is different from true [2023-12-15 21:54:25,256 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_ULTIMATE.start_main_#t~mem18#1.base_16| Int) (v_arrayElimCell_111 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| |v_ULTIMATE.start_main_#t~mem18#1.base_16|) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_111) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_111) 0))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) 1)) is different from false [2023-12-15 21:54:25,258 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_ULTIMATE.start_main_#t~mem18#1.base_16| Int) (v_arrayElimCell_111 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| |v_ULTIMATE.start_main_#t~mem18#1.base_16|) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_111) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_13| .cse0))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_111) 0))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) 1)) is different from true [2023-12-15 21:54:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-12-15 21:54:25,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:25,589 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse8)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse8))) (let ((.cse0 (select |c_#memory_int#1| .cse5)) (.cse15 (store |c_#memory_$Pointer$#1.offset| .cse5 (store (select |c_#memory_$Pointer$#1.offset| .cse5) .cse1 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (.cse3 (+ .cse13 4)) (.cse10 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (.cse11 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_1213 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1213 .cse1)) v_ArrVal_1213)) (forall ((v_ArrVal_1220 Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1217 Int)) (let ((.cse2 (select (let ((.cse14 (store .cse15 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1211))) (store .cse14 .cse6 (store (select .cse14 .cse6) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse12))) (let ((.cse4 (select .cse2 .cse13))) (or (= (select .cse2 .cse3) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse5 v_ArrVal_1213) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1214) .cse6 v_ArrVal_1215) (select (select (let ((.cse7 (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse5 (store .cse11 .cse1 v_ArrVal_1220)))) (store .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse10 .cse5) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1217))))) (store .cse7 .cse6 (store (select .cse7 .cse6) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse12) .cse13)) (+ 8 .cse4))))))))) (forall ((v_ArrVal_1213 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1213 .cse1)) v_ArrVal_1213)) (forall ((v_ArrVal_1220 Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1217 Int)) (let ((.cse18 (select (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$#1.base| .cse5 (store .cse11 .cse1 v_ArrVal_1220)))) (store .cse20 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse10 .cse5) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1217))))) (store .cse19 .cse6 (store (select .cse19 .cse6) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse12))) (let ((.cse16 (select .cse18 .cse13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse5 v_ArrVal_1213) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1214) .cse6 v_ArrVal_1215) .cse16) (+ 8 (select (select (let ((.cse17 (store .cse15 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1211))) (store .cse17 .cse6 (store (select .cse17 .cse6) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse12) .cse13)))) (= .cse16 (select .cse18 .cse3)))))))))))) is different from false [2023-12-15 21:54:25,643 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse6)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse6))) (let ((.cse0 (select |c_#memory_int#1| .cse2)) (.cse14 (+ 4 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) (.cse15 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse11 (+ .cse9 4)) (.cse7 (store |c_#memory_$Pointer$#1.offset| .cse2 (store (select |c_#memory_$Pointer$#1.offset| .cse2) .cse1 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_1213 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1213 .cse1)) v_ArrVal_1213)) (forall ((v_ArrVal_1220 Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1217 Int)) (let ((.cse10 (select (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse2 (store .cse15 .cse1 v_ArrVal_1220)))) (store .cse13 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse14 .cse2) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| v_ArrVal_1217))))) (store .cse12 .cse3 (store (select .cse12 .cse3) .cse6 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) .cse8))) (let ((.cse4 (select .cse10 .cse9))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse2 v_ArrVal_1213) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1214) .cse3 v_ArrVal_1215) .cse4) (+ (select (select (let ((.cse5 (store .cse7 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1211))) (store .cse5 .cse3 (store (select .cse5 .cse3) .cse6 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) .cse8) .cse9) 8))) (= .cse4 (select .cse10 .cse11)))))))) (forall ((v_ArrVal_1213 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1213 .cse1)) v_ArrVal_1213)) (forall ((v_ArrVal_1220 Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1217 Int)) (let ((.cse19 (select (let ((.cse20 (store .cse7 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1211))) (store .cse20 .cse3 (store (select .cse20 .cse3) .cse6 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) .cse8))) (let ((.cse18 (select .cse19 .cse9))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse2 v_ArrVal_1213) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1214) .cse3 v_ArrVal_1215) (select (select (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$#1.base| .cse2 (store .cse15 .cse1 v_ArrVal_1220)))) (store .cse17 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse14 .cse2) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| v_ArrVal_1217))))) (store .cse16 .cse3 (store (select .cse16 .cse3) .cse6 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) .cse8) .cse9)) (+ .cse18 8))) (= .cse18 (select .cse19 .cse11)))))))))))) is different from false [2023-12-15 21:54:26,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50747281] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:26,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:54:26,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 42 [2023-12-15 21:54:26,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495346324] [2023-12-15 21:54:26,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:26,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-15 21:54:26,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:26,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-15 21:54:26,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=916, Unknown=30, NotChecked=1200, Total=2256 [2023-12-15 21:54:26,209 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 42 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 32 states have internal predecessors, (43), 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-15 21:54:26,525 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (let ((.cse1 (= .cse2 1))) (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)))) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) .cse1 (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1)))) is different from false [2023-12-15 21:54:26,527 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (let ((.cse1 (= .cse2 1))) (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)))) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) .cse1 (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1)))) is different from true [2023-12-15 21:54:26,532 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (.cse3 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (and (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse3) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or .cse3 (exists ((|v_#memory_int#1_229| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int#1_229| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_#memory_int#1|) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |v_#memory_int#1_229|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1) (= |v_#memory_int#1_229| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |v_#memory_int#1_229| .cse4))) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (= .cse0 1)))) is different from false [2023-12-15 21:54:26,535 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (.cse3 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (and (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse3) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or .cse3 (exists ((|v_#memory_int#1_229| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int#1_229| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_#memory_int#1|) (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_4| |v_#memory_int#1_229|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1) (= |v_#memory_int#1_229| (store |v_#memory_int#1_BEFORE_CALL_4| .cse4 (select |v_#memory_int#1_229| .cse4))) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (= .cse0 1)))) is different from true [2023-12-15 21:54:26,537 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0)) (.cse3 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) .cse2 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or .cse2 .cse3) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2023-12-15 21:54:26,539 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0)) (.cse3 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) .cse2 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or .cse2 .cse3) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from true [2023-12-15 21:54:26,542 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse2) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0)))) is different from false [2023-12-15 21:54:26,544 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse2) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0)))) is different from true [2023-12-15 21:54:26,556 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse7 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse6 (select .cse5 0)) (.cse2 (select .cse0 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= (select .cse0 4) .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 8)) (not (= (select .cse3 4) 8)) (= (select .cse3 0) 0) (= (select |c_#valid| .cse4) 1) (= (select .cse5 4) .cse6) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse7 4) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse2 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= |c_#valid| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse8 (select |c_#valid| .cse8)))))) (= (select .cse7 0) 0) (= (select (select |c_#memory_int#1| .cse6) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 0) 0) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0))))) is different from false [2023-12-15 21:54:26,558 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse7 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse6 (select .cse5 0)) (.cse2 (select .cse0 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (not (= (select .cse0 4) .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 8)) (not (= (select .cse3 4) 8)) (= (select .cse3 0) 0) (= (select |c_#valid| .cse4) 1) (= (select .cse5 4) .cse6) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse7 4) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse2 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= |c_#valid| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (store |v_#valid_BEFORE_CALL_11| .cse8 (select |c_#valid| .cse8)))))) (= (select .cse7 0) 0) (= (select (select |c_#memory_int#1| .cse6) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 0) 0) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0))))) is different from true [2023-12-15 21:54:26,583 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_65) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_12| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from false [2023-12-15 21:54:26,585 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_65) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_12| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= |c_old(#length)| |c_#length|)) is different from true [2023-12-15 21:54:26,592 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_65) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_12| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |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) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-12-15 21:54:26,594 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_65) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_#valid_BEFORE_CALL_12| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 1)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |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) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-12-15 21:54:26,604 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse3 (select |c_#memory_int#1| |c_node_create_#res#1.base|)) (.cse4 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|)) (.cse5 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_65) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_12| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 1)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse3)) (= |c_node_create_#in~data#1| (select .cse3 8)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| .cse4 (select |c_#memory_int#1| .cse4))) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= .cse4 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse5)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse5 (select |c_#memory_$Pointer$#1.offset| .cse5))))) is different from false [2023-12-15 21:54:26,609 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse3 (select |c_#memory_int#1| |c_node_create_#res#1.base|)) (.cse4 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|)) (.cse5 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_65) 1) (= |v_#valid_BEFORE_CALL_12| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_12| .cse1)))) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 1)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse3)) (= |c_node_create_#in~data#1| (select .cse3 8)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| .cse4 (select |c_#memory_int#1| .cse4))) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= .cse4 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse5)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse5 (select |c_#memory_$Pointer$#1.offset| .cse5))))) is different from true [2023-12-15 21:54:26,627 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse11 (select .cse12 0))) (let ((.cse9 (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse11)) (.cse3 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse1 (select .cse18 4)) (.cse15 (select .cse18 .cse4))) (and (= (select .cse0 0) 0) (not (= .cse1 .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)) (= 0 (select .cse3 .cse4)) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse11))) (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse10)) (.cse5 (= (select .cse7 0) 0)) (.cse8 (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse10))) (or (and .cse5 (= .cse6 .cse7) (= (select .cse7 4) 0)) (and (or (and (= (select .cse6 4) 0) (= (select .cse6 0) 0)) .cse8) (or .cse5 .cse9) (not (= .cse10 .cse11))) (and .cse8 .cse9)))) (= (select .cse12 4) .cse11) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse13) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse14 (select |v_#valid_BEFORE_CALL_12| .cse14)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse13) 1)))) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse15)) (or (= (select (select |c_#memory_int#1| .cse11) 8) 1) .cse9) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse11) 1) (= (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse16 (select |v_#valid_BEFORE_CALL_13| .cse16))) |v_#valid_BEFORE_CALL_13|))) (let ((.cse17 (= .cse1 .cse15))) (or (and (not (= (select .cse3 4) 8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 8)) .cse17) (and (not (= .cse15 .cse2)) (not .cse17) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse15) 8))))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from false [2023-12-15 21:54:26,630 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse11 (select .cse12 0))) (let ((.cse9 (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse11)) (.cse3 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse1 (select .cse18 4)) (.cse15 (select .cse18 .cse4))) (and (= (select .cse0 0) 0) (not (= .cse1 .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)) (= 0 (select .cse3 .cse4)) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse11))) (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse10)) (.cse5 (= (select .cse7 0) 0)) (.cse8 (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse10))) (or (and .cse5 (= .cse6 .cse7) (= (select .cse7 4) 0)) (and (or (and (= (select .cse6 4) 0) (= (select .cse6 0) 0)) .cse8) (or .cse5 .cse9) (not (= .cse10 .cse11))) (and .cse8 .cse9)))) (= (select .cse12 4) .cse11) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse13) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse14 (select |v_#valid_BEFORE_CALL_12| .cse14)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse13) 1)))) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse15)) (or (= (select (select |c_#memory_int#1| .cse11) 8) 1) .cse9) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse10) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse11) 1) (= (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse16 (select |v_#valid_BEFORE_CALL_13| .cse16))) |v_#valid_BEFORE_CALL_13|))) (let ((.cse17 (= .cse1 .cse15))) (or (and (not (= (select .cse3 4) 8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 8)) .cse17) (and (not (= .cse15 .cse2)) (not .cse17) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse15) 8))))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from true [2023-12-15 21:54:26,663 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse13 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse9 (select .cse14 0))) (let ((.cse3 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse9)) (.cse12 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse1 (select .cse18 4)) (.cse10 (select .cse18 .cse13))) (and (= (select .cse0 0) 0) (not (= .cse1 .cse2)) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse9))) (let ((.cse6 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (.cse4 (= (select .cse7 0) 0)) (.cse5 (select |c_#memory_$Pointer$#1.offset| .cse8))) (or (and (or .cse3 .cse4) (or (and (= (select .cse5 4) 0) (= (select .cse5 0) 0)) .cse6)) (and .cse3 .cse6) (and .cse4 (= .cse5 .cse7) (= (select .cse7 4) 0))))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse9) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse11 (select |v_#valid_BEFORE_CALL_13| .cse11))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= 0 (select .cse12 .cse13)) (= (select .cse14 4) .cse9) (or .cse3 (= (select (select |c_#memory_int#1| .cse9) 8) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse15) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse16 (select |v_#valid_BEFORE_CALL_12| .cse16)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse15) 1)))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (let ((.cse17 (= .cse1 .cse10))) (or (and (not (= (select .cse12 4) 8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 8)) .cse17) (and (not (= .cse10 .cse2)) (not .cse17) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse10) 8))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from false [2023-12-15 21:54:26,666 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse13 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse9 (select .cse14 0))) (let ((.cse3 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse9)) (.cse12 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse1 (select .cse18 4)) (.cse10 (select .cse18 .cse13))) (and (= (select .cse0 0) 0) (not (= .cse1 .cse2)) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse9))) (let ((.cse6 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (.cse4 (= (select .cse7 0) 0)) (.cse5 (select |c_#memory_$Pointer$#1.offset| .cse8))) (or (and (or .cse3 .cse4) (or (and (= (select .cse5 4) 0) (= (select .cse5 0) 0)) .cse6)) (and .cse3 .cse6) (and .cse4 (= .cse5 .cse7) (= (select .cse7 4) 0))))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse9) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse11 (select |v_#valid_BEFORE_CALL_13| .cse11))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= 0 (select .cse12 .cse13)) (= (select .cse14 4) .cse9) (or .cse3 (= (select (select |c_#memory_int#1| .cse9) 8) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse15) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse16 (select |v_#valid_BEFORE_CALL_12| .cse16)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse15) 1)))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (let ((.cse17 (= .cse1 .cse10))) (or (and (not (= (select .cse12 4) 8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 8)) .cse17) (and (not (= .cse10 .cse2)) (not .cse17) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse10) 8))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))))) is different from true [2023-12-15 21:54:26,679 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse13 0))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse8)) (.cse1 (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select .cse12 0)) (.cse3 (select .cse12 4))) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (not (= .cse3 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse4))) (let ((.cse6 (= (select .cse7 0) 0))) (or (and (= (select .cse5 0) 0) .cse6) (and (= (store (store .cse7 0 0) 4 0) .cse5) .cse6 (= (select .cse7 4) 0))))) (= (select .cse5 4) 0) (not (= .cse8 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse9) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse10 (select |v_#valid_BEFORE_CALL_12| .cse10)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse9) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 4) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) 8)) (= (select (select |c_#memory_int#1| .cse4) 8) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse11 (select |v_#valid_BEFORE_CALL_13| .cse11))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0)))))))) is different from false [2023-12-15 21:54:26,682 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse13 0))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse8)) (.cse1 (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select .cse12 0)) (.cse3 (select .cse12 4))) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (not (= .cse3 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse4))) (let ((.cse6 (= (select .cse7 0) 0))) (or (and (= (select .cse5 0) 0) .cse6) (and (= (store (store .cse7 0 0) 4 0) .cse5) .cse6 (= (select .cse7 4) 0))))) (= (select .cse5 4) 0) (not (= .cse8 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse9) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse10 (select |v_#valid_BEFORE_CALL_12| .cse10)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse9) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) 4) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) 8)) (= (select (select |c_#memory_int#1| .cse4) 8) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse11 (select |v_#valid_BEFORE_CALL_13| .cse11))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0)))))))) is different from true [2023-12-15 21:54:26,752 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse1 (select .cse7 0)) (.cse0 (select .cse7 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 4) 0) (not (= .cse3 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_12| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 1)))) (= (select .cse2 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) .cse1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= (select (select |c_#memory_int#1| .cse1) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3))))) is different from false [2023-12-15 21:54:26,755 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse1 (select .cse7 0)) (.cse0 (select .cse7 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 4) 0) (not (= .cse3 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_65 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= |v_#valid_BEFORE_CALL_12| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_12|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_12| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_65)) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 1)))) (= (select .cse2 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) .cse1) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= (select (select |c_#memory_int#1| .cse1) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3))))) is different from true [2023-12-15 21:54:26,770 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimCell_111 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_111) 1) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_111) 0))) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select .cse0 8) 1))) is different from false [2023-12-15 21:54:26,771 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimCell_111 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_111) 1) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_#t~mem18#1.base|) 0) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_111) 0))) (= |c_ULTIMATE.start_main_#t~mem18#1.offset| 0) (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select .cse0 8) 1))) is different from true [2023-12-15 21:54:26,784 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_main_#t~mem18#1.base_16| Int) (v_arrayElimCell_111 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| |v_ULTIMATE.start_main_#t~mem18#1.base_16|) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_111) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_111) 0))) (= (select .cse0 8) 1))) is different from false [2023-12-15 21:54:26,786 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_main_#t~mem18#1.base_16| Int) (v_arrayElimCell_111 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| |v_ULTIMATE.start_main_#t~mem18#1.base_16|) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_111) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimCell_111) 0))) (= (select .cse0 8) 1))) is different from true [2023-12-15 21:54:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:26,841 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2023-12-15 21:54:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 21:54:26,841 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 32 states have internal predecessors, (43), 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 29 [2023-12-15 21:54:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:26,842 INFO L225 Difference]: With dead ends: 60 [2023-12-15 21:54:26,842 INFO L226 Difference]: Without dead ends: 58 [2023-12-15 21:54:26,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=161, Invalid=1161, Unknown=58, NotChecked=2910, Total=4290 [2023-12-15 21:54:26,843 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1163 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:26,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 250 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 302 Invalid, 0 Unknown, 1163 Unchecked, 0.3s Time] [2023-12-15 21:54:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-15 21:54:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2023-12-15 21:54:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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-15 21:54:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2023-12-15 21:54:26,850 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 29 [2023-12-15 21:54:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:26,850 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2023-12-15 21:54:26,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 32 states have internal predecessors, (43), 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-15 21:54:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2023-12-15 21:54:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-15 21:54:26,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:26,851 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:26,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 21:54:27,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:27,051 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:27,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:27,053 INFO L85 PathProgramCache]: Analyzing trace with hash 536803287, now seen corresponding path program 1 times [2023-12-15 21:54:27,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:27,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055051928] [2023-12-15 21:54:27,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:27,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:27,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:27,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:27,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 21:54:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:54:27,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:27,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055051928] [2023-12-15 21:54:27,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055051928] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:27,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295954905] [2023-12-15 21:54:27,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:27,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:27,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:27,152 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-15 21:54:27,178 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-15 21:54:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:27,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-15 21:54:27,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:54:27,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:54:27,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295954905] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:27,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:27,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-12-15 21:54:27,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145127369] [2023-12-15 21:54:27,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:27,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:54:27,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:27,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:54:27,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:54:27,371 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-15 21:54:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:27,424 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2023-12-15 21:54:27,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:54:27,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2023-12-15 21:54:27,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:27,425 INFO L225 Difference]: With dead ends: 82 [2023-12-15 21:54:27,425 INFO L226 Difference]: Without dead ends: 46 [2023-12-15 21:54:27,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:54:27,426 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:27,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 118 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-15 21:54:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-15 21:54:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-15 21:54:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-12-15 21:54:27,432 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 29 [2023-12-15 21:54:27,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:27,432 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-12-15 21:54:27,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-15 21:54:27,432 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-12-15 21:54:27,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-15 21:54:27,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:27,433 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:27,444 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-15 21:54:27,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:27,639 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:27,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:27,639 INFO L85 PathProgramCache]: Analyzing trace with hash -370873652, now seen corresponding path program 1 times [2023-12-15 21:54:27,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:27,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295523437] [2023-12-15 21:54:27,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:27,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:29,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:29,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:29,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 21:54:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:54:29,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295523437] [2023-12-15 21:54:29,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295523437] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193286222] [2023-12-15 21:54:29,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:29,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:29,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:29,885 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-15 21:54:29,886 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-15 21:54:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:30,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 167 conjunts are in the unsatisfiable core [2023-12-15 21:54:30,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:30,147 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 Received shutdown request... [2023-12-15 21:54:30,506 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:54:30,507 WARN L235 SmtUtils]: Removed 3 from assertion stack [2023-12-15 21:54:30,508 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:54:30,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-15 21:54:30,537 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:54:30,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:30,715 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 33 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 16 for 14ms.. [2023-12-15 21:54:30,718 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:30,720 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:54:30,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:54:30 BoogieIcfgContainer [2023-12-15 21:54:30,721 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:54:30,721 INFO L158 Benchmark]: Toolchain (without parser) took 70658.88ms. Allocated memory was 256.9MB in the beginning and 379.6MB in the end (delta: 122.7MB). Free memory was 202.0MB in the beginning and 269.4MB in the end (delta: -67.4MB). Peak memory consumption was 56.0MB. Max. memory is 8.0GB. [2023-12-15 21:54:30,721 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:54:30,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.36ms. Allocated memory is still 256.9MB. Free memory was 201.7MB in the beginning and 183.2MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-15 21:54:30,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.84ms. Allocated memory is still 256.9MB. Free memory was 183.2MB in the beginning and 181.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:54:30,722 INFO L158 Benchmark]: Boogie Preprocessor took 59.95ms. Allocated memory is still 256.9MB. Free memory was 181.1MB in the beginning and 177.6MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:54:30,722 INFO L158 Benchmark]: RCFGBuilder took 335.80ms. Allocated memory is still 256.9MB. Free memory was 177.6MB in the beginning and 157.0MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-15 21:54:30,722 INFO L158 Benchmark]: TraceAbstraction took 69937.21ms. Allocated memory was 256.9MB in the beginning and 379.6MB in the end (delta: 122.7MB). Free memory was 156.3MB in the beginning and 269.4MB in the end (delta: -113.2MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2023-12-15 21:54:30,723 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.36ms. Allocated memory is still 256.9MB. Free memory was 201.7MB in the beginning and 183.2MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.84ms. Allocated memory is still 256.9MB. Free memory was 183.2MB in the beginning and 181.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.95ms. Allocated memory is still 256.9MB. Free memory was 181.1MB in the beginning and 177.6MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 335.80ms. Allocated memory is still 256.9MB. Free memory was 177.6MB in the beginning and 157.0MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 69937.21ms. Allocated memory was 256.9MB in the beginning and 379.6MB in the end (delta: 122.7MB). Free memory was 156.3MB in the beginning and 269.4MB in the end (delta: -113.2MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 650). Cancelled while NwaCegarLoop was analyzing trace of length 33 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 16 for 14ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.9s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 29.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 1362 SdHoareTripleChecker+Invalid, 29.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2241 IncrementalHoareTripleChecker+Unchecked, 1208 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1573 IncrementalHoareTripleChecker+Invalid, 3857 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 154 mSDtfsCounter, 1573 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 218 ConstructedPredicates, 56 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 24.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=5, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 32.7s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 355 ConstructedInterpolants, 40 QuantifiedInterpolants, 8242 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1939 ConjunctsInSsa, 413 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 74/130 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown