/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 false -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-21 03:33:13,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:33:13,817 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-21 03:33:13,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:33:13,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:33:13,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:33:13,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:33:13,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:33:13,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:33:13,843 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:33:13,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:33:13,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:33:13,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:33:13,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:33:13,845 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:33:13,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:33:13,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:33:13,846 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:33:13,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:33:13,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:33:13,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:33:13,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:33:13,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:33:13,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:33:13,847 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:33:13,847 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:33:13,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:33:13,847 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:33:13,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:33:13,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:33:13,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:33:13,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:33:13,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:33:13,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:33:13,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:33:13,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:33:13,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:33:13,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:33:13,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:33:13,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:33:13,850 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:33:13,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:33:13,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:33:13,850 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 -> false [2023-12-21 03:33:14,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:33:14,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:33:14,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:33:14,086 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:33:14,087 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:33:14,087 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-21 03:33:15,127 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:33:15,319 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:33:15,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i [2023-12-21 03:33:15,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cff9e40e/63add70bb1f244a08d84214f94646736/FLAGce543d87c [2023-12-21 03:33:15,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cff9e40e/63add70bb1f244a08d84214f94646736 [2023-12-21 03:33:15,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:33:15,347 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:33:15,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:33:15,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:33:15,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:33:15,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:33:15" (1/1) ... [2023-12-21 03:33:15,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3565006f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15, skipping insertion in model container [2023-12-21 03:33:15,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:33:15" (1/1) ... [2023-12-21 03:33:15,390 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:33:15,577 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-21 03:33:15,581 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:33:15,594 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:33:15,652 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-21 03:33:15,654 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:33:15,677 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:33:15,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15 WrapperNode [2023-12-21 03:33:15,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:33:15,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:33:15,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:33:15,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:33:15,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15" (1/1) ... [2023-12-21 03:33:15,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15" (1/1) ... [2023-12-21 03:33:15,731 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2023-12-21 03:33:15,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:33:15,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:33:15,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:33:15,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:33:15,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15" (1/1) ... [2023-12-21 03:33:15,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15" (1/1) ... [2023-12-21 03:33:15,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15" (1/1) ... [2023-12-21 03:33:15,758 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-21 03:33:15,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15" (1/1) ... [2023-12-21 03:33:15,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15" (1/1) ... [2023-12-21 03:33:15,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15" (1/1) ... [2023-12-21 03:33:15,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15" (1/1) ... [2023-12-21 03:33:15,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15" (1/1) ... [2023-12-21 03:33:15,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15" (1/1) ... [2023-12-21 03:33:15,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:33:15,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:33:15,771 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:33:15,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:33:15,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15" (1/1) ... [2023-12-21 03:33:15,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:33:15,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:33:15,805 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-21 03:33:15,811 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-21 03:33:15,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 03:33:15,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 03:33:15,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 03:33:15,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:33:15,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:33:15,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 03:33:15,831 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-21 03:33:15,832 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-21 03:33:15,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 03:33:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:33:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 03:33:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 03:33:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 03:33:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-21 03:33:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 03:33:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 03:33:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-21 03:33:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 03:33:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-21 03:33:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-21 03:33:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-21 03:33:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:33:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:33:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 03:33:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:33:15,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:33:15,931 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:33:15,932 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:33:16,176 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:33:16,221 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:33:16,221 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 03:33:16,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:33:16 BoogieIcfgContainer [2023-12-21 03:33:16,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:33:16,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:33:16,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:33:16,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:33:16,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:33:15" (1/3) ... [2023-12-21 03:33:16,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a45674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:33:16, skipping insertion in model container [2023-12-21 03:33:16,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:33:15" (2/3) ... [2023-12-21 03:33:16,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a45674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:33:16, skipping insertion in model container [2023-12-21 03:33:16,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:33:16" (3/3) ... [2023-12-21 03:33:16,227 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2023-12-21 03:33:16,239 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:33:16,239 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 03:33:16,268 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:33:16,272 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;@684a2635, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:33:16,272 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 03:33:16,275 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-21 03:33:16,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 03:33:16,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:33:16,281 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:33:16,281 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:33:16,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:33:16,285 INFO L85 PathProgramCache]: Analyzing trace with hash -977421440, now seen corresponding path program 1 times [2023-12-21 03:33:16,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:33:16,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908567900] [2023-12-21 03:33:16,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:33:16,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:33:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:33:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:16,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:33:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:16,573 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-21 03:33:16,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:33:16,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908567900] [2023-12-21 03:33:16,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908567900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:33:16,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:33:16,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:33:16,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781487881] [2023-12-21 03:33:16,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:33:16,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:33:16,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:33:16,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:33:16,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:33:16,610 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-21 03:33:16,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:33:16,678 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2023-12-21 03:33:16,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:33:16,681 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-21 03:33:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:33:16,686 INFO L225 Difference]: With dead ends: 54 [2023-12-21 03:33:16,686 INFO L226 Difference]: Without dead ends: 24 [2023-12-21 03:33:16,688 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-21 03:33:16,691 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-21 03:33:16,692 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-21 03:33:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-21 03:33:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-21 03:33:16,714 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-21 03:33:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-21 03:33:16,715 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 18 [2023-12-21 03:33:16,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:33:16,716 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-21 03:33:16,716 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-21 03:33:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-21 03:33:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 03:33:16,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:33:16,718 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:33:16,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:33:16,718 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:33:16,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:33:16,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1639470509, now seen corresponding path program 1 times [2023-12-21 03:33:16,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:33:16,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149298800] [2023-12-21 03:33:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:33:16,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:33:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:16,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:33:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:16,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:33:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:16,912 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-21 03:33:16,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:33:16,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149298800] [2023-12-21 03:33:16,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149298800] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:33:16,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:33:16,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:33:16,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796321072] [2023-12-21 03:33:16,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:33:16,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:33:16,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:33:16,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:33:16,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:33:16,919 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-21 03:33:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:33:16,967 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-12-21 03:33:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:33:16,968 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-21 03:33:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:33:16,969 INFO L225 Difference]: With dead ends: 45 [2023-12-21 03:33:16,969 INFO L226 Difference]: Without dead ends: 29 [2023-12-21 03:33:16,970 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-21 03:33:16,971 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-21 03:33:16,971 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-21 03:33:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-21 03:33:16,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2023-12-21 03:33:16,980 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-21 03:33:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-12-21 03:33:16,981 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 18 [2023-12-21 03:33:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:33:16,982 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-12-21 03:33:16,982 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-21 03:33:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-12-21 03:33:16,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 03:33:16,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:33:16,983 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-21 03:33:16,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:33:16,984 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:33:16,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:33:16,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2143999192, now seen corresponding path program 1 times [2023-12-21 03:33:16,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:33:16,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404031384] [2023-12-21 03:33:16,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:33:16,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:33:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:17,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:33:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:17,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:33:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:17,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 03:33:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:17,378 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-21 03:33:17,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:33:17,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404031384] [2023-12-21 03:33:17,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404031384] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:33:17,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950546028] [2023-12-21 03:33:17,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:33:17,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:33:17,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:33:17,382 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-21 03:33:17,456 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-21 03:33:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:17,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 03:33:17,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:33:17,832 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-21 03:33:17,844 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-21 03:33:17,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:33:17,872 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-21 03:33:17,893 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-21 03:33:17,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950546028] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:33:17,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:33:17,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 18 [2023-12-21 03:33:17,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906059736] [2023-12-21 03:33:17,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:33:17,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 03:33:17,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:33:17,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 03:33:17,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-12-21 03:33:17,895 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-21 03:33:21,909 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-21 03:33:25,921 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-21 03:33:29,936 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-21 03:33:33,969 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-21 03:33:37,982 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-21 03:33:42,235 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-21 03:33:46,252 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-21 03:33:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:33:46,263 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2023-12-21 03:33:46,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 03:33:46,263 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-21 03:33:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:33:46,264 INFO L225 Difference]: With dead ends: 53 [2023-12-21 03:33:46,264 INFO L226 Difference]: Without dead ends: 32 [2023-12-21 03:33:46,265 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-21 03:33:46,265 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-21 03:33:46,265 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-21 03:33:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-21 03:33:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-12-21 03:33:46,269 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-21 03:33:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-12-21 03:33:46,269 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 26 [2023-12-21 03:33:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:33:46,270 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-12-21 03:33:46,270 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-21 03:33:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-12-21 03:33:46,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 03:33:46,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:33:46,270 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-21 03:33:46,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 03:33:46,471 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-21 03:33:46,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:33:46,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:33:46,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2142152150, now seen corresponding path program 1 times [2023-12-21 03:33:46,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:33:46,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703715339] [2023-12-21 03:33:46,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:33:46,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:33:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:47,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:33:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:47,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:33:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:48,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 03:33:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:48,280 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-21 03:33:48,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:33:48,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703715339] [2023-12-21 03:33:48,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703715339] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:33:48,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261660384] [2023-12-21 03:33:48,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:33:48,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:33:48,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:33:48,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:33:48,288 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-21 03:33:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:48,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 108 conjunts are in the unsatisfiable core [2023-12-21 03:33:48,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:33:48,855 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-21 03:33:49,008 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-21 03:33:49,071 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:33:49,071 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-21 03:33:49,130 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-21 03:33:49,187 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-21 03:33:49,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:33:49,342 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-21 03:33:49,346 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-21 03:33:49,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:33:49,355 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-21 03:33:49,359 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-21 03:33:49,411 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-21 03:33:49,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-21 03:33:49,418 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-21 03:33:49,579 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-21 03:33:49,580 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-21 03:33:49,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:33:49,603 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-21 03:33:49,615 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-21 03:33:49,616 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-21 03:33:49,771 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-21 03:33:49,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:33:49,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:33:49,777 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-21 03:33:49,780 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-21 03:33:49,839 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-21 03:33:49,902 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-21 03:33:49,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:33:55,410 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| Int) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_673 (Array Int Int)) (v_DerPreprocessor_1 Int) (v_ArrVal_675 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.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|)) (.cse2 (+ (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 ((.cse0 (store (store |c_#memory_int#1| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| v_ArrVal_684) .cse1) .cse2) v_ArrVal_675) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16| v_ArrVal_673))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_1)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_16|) 0)))) is different from false [2023-12-21 03:33:55,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261660384] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:33:55,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:33:55,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2023-12-21 03:33:55,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486097212] [2023-12-21 03:33:55,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:33:55,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-21 03:33:55,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:33:55,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-21 03:33:55,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1803, Unknown=37, NotChecked=86, Total=2070 [2023-12-21 03:33:55,415 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-21 03:33:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:33:56,605 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2023-12-21 03:33:56,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 03:33:56,605 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-21 03:33:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:33:56,606 INFO L225 Difference]: With dead ends: 55 [2023-12-21 03:33:56,606 INFO L226 Difference]: Without dead ends: 53 [2023-12-21 03:33:56,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=255, Invalid=3018, Unknown=37, NotChecked=112, Total=3422 [2023-12-21 03:33:56,607 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2023-12-21 03:33:56,608 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.7s Time] [2023-12-21 03:33:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-21 03:33:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2023-12-21 03:33:56,612 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-21 03:33:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-12-21 03:33:56,613 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 26 [2023-12-21 03:33:56,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:33:56,620 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-12-21 03:33:56,620 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-21 03:33:56,621 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-12-21 03:33:56,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 03:33:56,621 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:33:56,621 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-21 03:33:56,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-21 03:33:56,828 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-21 03:33:56,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:33:56,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:33:56,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2125151189, now seen corresponding path program 1 times [2023-12-21 03:33:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:33:56,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782713141] [2023-12-21 03:33:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:33:56,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:33:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:58,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:33:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:33:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:58,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 03:33:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:59,098 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-21 03:33:59,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:33:59,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782713141] [2023-12-21 03:33:59,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782713141] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:33:59,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227774944] [2023-12-21 03:33:59,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:33:59,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:33:59,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:33:59,100 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-21 03:33:59,101 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-21 03:33:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:33:59,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 98 conjunts are in the unsatisfiable core [2023-12-21 03:33:59,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:33:59,563 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-21 03:33:59,795 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-21 03:33:59,797 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-21 03:33:59,828 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-21 03:33:59,839 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-21 03:33:59,841 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-21 03:33:59,858 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-21 03:33:59,858 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-21 03:33:59,873 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-21 03:33:59,875 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-21 03:33:59,894 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-21 03:33:59,896 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-21 03:33:59,947 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-21 03:33:59,948 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-21 03:33:59,958 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-21 03:33:59,974 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-21 03:34:00,000 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-21 03:34:00,002 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-21 03:34:00,015 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-21 03:34:00,034 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-21 03:34:00,037 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-21 03:34:00,060 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-21 03:34:00,062 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-21 03:34:00,089 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-21 03:34:00,092 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-21 03:34:00,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:00,141 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-21 03:34:00,184 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-21 03:34:00,187 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-21 03:34:00,249 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-21 03:34:00,252 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-21 03:34:00,293 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-21 03:34:00,297 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:00,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:00,309 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-21 03:34:00,343 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-21 03:34:00,348 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:00,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:00,361 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-21 03:34:00,372 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-21 03:34:00,375 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:00,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:00,386 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-21 03:34:00,400 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:00,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 431 treesize of output 343 [2023-12-21 03:34:00,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:00,438 INFO L349 Elim1Store]: treesize reduction 223, result has 4.7 percent of original size [2023-12-21 03:34:00,438 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-21 03:34:00,582 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-21 03:34:00,587 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-21 03:34:00,864 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-21 03:34:00,870 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-21 03:34:01,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:34:01,086 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-21 03:34:01,191 INFO L349 Elim1Store]: treesize reduction 104, result has 32.0 percent of original size [2023-12-21 03:34:01,192 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-21 03:34:01,214 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 03:34:01,214 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-21 03:34:01,684 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-21 03:34:01,687 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-21 03:34:01,723 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-21 03:34:01,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:34:01,832 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-21 03:34:23,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227774944] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:34:23,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:34:23,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2023-12-21 03:34:23,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013048512] [2023-12-21 03:34:23,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:34:23,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-21 03:34:23,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:34:23,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-21 03:34:23,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1107, Unknown=29, NotChecked=1014, Total=2256 [2023-12-21 03:34:23,126 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-21 03:34:23,418 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-21 03:34:23,420 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-21 03:34:23,424 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-21 03:34:23,426 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-21 03:34:23,429 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-21 03:34:23,431 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-21 03:34:23,435 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-21 03:34:23,437 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-21 03:34:23,445 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-21 03:34:23,448 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-21 03:34:23,478 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-21 03:34:23,480 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-21 03:34:23,485 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-21 03:34:23,487 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-21 03:34:23,494 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-21 03:34:23,497 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-21 03:34:23,514 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-21 03:34:23,517 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-21 03:34:23,544 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-21 03:34:23,552 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-21 03:34:23,677 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-21 03:34:23,681 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-21 03:34:23,816 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-21 03:34:23,820 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-21 03:34:23,858 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-21 03:34:23,860 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-21 03:34:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:34:23,962 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2023-12-21 03:34:23,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 03:34:23,962 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-21 03:34:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:34:23,965 INFO L225 Difference]: With dead ends: 61 [2023-12-21 03:34:23,965 INFO L226 Difference]: Without dead ends: 56 [2023-12-21 03:34:23,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=157, Invalid=1374, Unknown=55, NotChecked=2574, Total=4160 [2023-12-21 03:34:23,967 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2023-12-21 03:34:23,967 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.4s Time] [2023-12-21 03:34:23,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-21 03:34:23,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-21 03:34:23,983 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-21 03:34:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2023-12-21 03:34:23,985 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 29 [2023-12-21 03:34:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:34:23,985 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2023-12-21 03:34:23,985 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-21 03:34:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2023-12-21 03:34:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 03:34:23,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:34:23,987 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-21 03:34:24,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 03:34:24,194 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-21 03:34:24,195 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:34:24,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:34:24,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2125194899, now seen corresponding path program 1 times [2023-12-21 03:34:24,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:34:24,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556554669] [2023-12-21 03:34:24,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:34:24,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:34:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:26,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:34:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:26,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:34:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:26,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 03:34:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:26,650 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-21 03:34:26,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:34:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556554669] [2023-12-21 03:34:26,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556554669] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:34:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281010533] [2023-12-21 03:34:26,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:34:26,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:34:26,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:34:26,651 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-21 03:34:26,653 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-21 03:34:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:27,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 171 conjunts are in the unsatisfiable core [2023-12-21 03:34:27,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:34:27,103 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-21 03:34:27,108 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-21 03:34:27,336 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-21 03:34:27,339 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-21 03:34:27,356 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-21 03:34:27,363 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-21 03:34:27,399 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:34:27,400 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-21 03:34:27,417 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-21 03:34:27,420 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-21 03:34:27,457 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-21 03:34:27,457 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-21 03:34:27,472 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-12-21 03:34:27,472 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-21 03:34:27,496 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-21 03:34:27,504 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-21 03:34:27,506 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-21 03:34:27,541 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-21 03:34:27,543 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-21 03:34:27,626 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-21 03:34:27,626 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-21 03:34:27,633 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-21 03:34:27,646 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-21 03:34:27,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:27,656 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-21 03:34:27,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:27,665 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-21 03:34:27,677 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-21 03:34:27,746 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-21 03:34:27,748 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-21 03:34:27,762 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-21 03:34:27,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:27,769 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-21 03:34:27,775 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-21 03:34:27,797 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-21 03:34:27,799 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-21 03:34:27,832 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-21 03:34:27,834 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-21 03:34:27,865 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-21 03:34:27,867 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-21 03:34:27,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:27,904 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-21 03:34:27,935 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2023-12-21 03:34:27,935 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-21 03:34:28,032 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-21 03:34:28,032 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-21 03:34:28,062 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-21 03:34:28,065 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-21 03:34:28,182 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-21 03:34:28,185 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-21 03:34:28,288 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-21 03:34:28,294 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-21 03:34:28,307 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-21 03:34:28,334 INFO L349 Elim1Store]: treesize reduction 178, result has 0.6 percent of original size [2023-12-21 03:34:28,334 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-21 03:34:28,349 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-21 03:34:28,352 WARN L200 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:28,368 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:28,373 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:28,378 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:28,384 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:28,411 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-21 03:34:28,427 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-21 03:34:28,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:28,437 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-21 03:34:28,450 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-21 03:34:28,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:28,472 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-21 03:34:28,478 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-21 03:34:28,496 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-21 03:34:28,512 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:28,517 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:28,522 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:28,527 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:28,593 INFO L349 Elim1Store]: treesize reduction 355, result has 3.0 percent of original size [2023-12-21 03:34:28,594 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-21 03:34:28,617 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-21 03:34:28,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:28,623 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-21 03:34:28,629 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-21 03:34:28,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:28,634 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-21 03:34:28,650 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-21 03:34:28,658 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-21 03:34:28,672 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:34:28,673 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:34:28,673 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-21 03:34:28,691 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:34:28,717 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-21 03:34:28,720 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-21 03:34:28,810 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-21 03:34:28,813 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-21 03:34:28,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:34:28,929 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-21 03:34:28,938 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 03:34:28,939 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-21 03:34:28,950 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-21 03:34:28,961 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 03:34:28,961 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-21 03:34:28,986 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-21 03:34:28,988 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-21 03:34:29,010 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-21 03:34:29,013 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-21 03:34:29,049 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-21 03:34:29,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:34:29,300 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-21 03:34:29,354 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-21 03:34:30,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281010533] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:34:30,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:34:30,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 42 [2023-12-21 03:34:30,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349329764] [2023-12-21 03:34:30,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:34:30,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-21 03:34:30,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:34:30,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-21 03:34:30,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=916, Unknown=30, NotChecked=1200, Total=2256 [2023-12-21 03:34:30,037 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-21 03:34:30,403 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-21 03:34:30,406 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-21 03:34:30,411 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-21 03:34:30,414 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-21 03:34:30,417 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-21 03:34:30,419 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-21 03:34:30,422 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-21 03:34:30,425 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-21 03:34:30,432 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-21 03:34:30,435 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-21 03:34:30,464 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-21 03:34:30,466 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-21 03:34:30,474 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-21 03:34:30,476 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-21 03:34:30,490 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-21 03:34:30,495 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-21 03:34:30,508 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-21 03:34:30,512 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-21 03:34:30,544 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-21 03:34:30,547 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-21 03:34:30,561 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-21 03:34:30,564 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-21 03:34:30,692 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-21 03:34:30,695 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-21 03:34:30,711 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-21 03:34:30,713 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-21 03:34:30,727 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-21 03:34:30,729 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-21 03:34:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:34:30,786 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2023-12-21 03:34:30,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 03:34:30,786 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-21 03:34:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:34:30,787 INFO L225 Difference]: With dead ends: 60 [2023-12-21 03:34:30,787 INFO L226 Difference]: Without dead ends: 58 [2023-12-21 03:34:30,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=161, Invalid=1161, Unknown=58, NotChecked=2910, Total=4290 [2023-12-21 03:34:30,789 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-21 03:34:30,789 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-21 03:34:30,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-21 03:34:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2023-12-21 03:34:30,795 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-21 03:34:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2023-12-21 03:34:30,795 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 29 [2023-12-21 03:34:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:34:30,795 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2023-12-21 03:34:30,795 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-21 03:34:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2023-12-21 03:34:30,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 03:34:30,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:34:30,796 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-21 03:34:30,806 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-21 03:34:31,007 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-21 03:34:31,008 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:34:31,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:34:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash 536803287, now seen corresponding path program 1 times [2023-12-21 03:34:31,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:34:31,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753868507] [2023-12-21 03:34:31,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:34:31,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:34:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:34:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:31,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:34:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:31,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 03:34:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:31,113 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-21 03:34:31,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:34:31,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753868507] [2023-12-21 03:34:31,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753868507] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:34:31,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976826987] [2023-12-21 03:34:31,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:34:31,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:34:31,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:34:31,129 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-21 03:34:31,206 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-21 03:34:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:31,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 03:34:31,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:34:31,403 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-21 03:34:31,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:34:31,423 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-21 03:34:31,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976826987] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:34:31,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:34:31,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-12-21 03:34:31,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594303452] [2023-12-21 03:34:31,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:34:31,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 03:34:31,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:34:31,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 03:34:31,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:34:31,426 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-21 03:34:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:34:31,510 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2023-12-21 03:34:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 03:34:31,510 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-21 03:34:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:34:31,510 INFO L225 Difference]: With dead ends: 82 [2023-12-21 03:34:31,510 INFO L226 Difference]: Without dead ends: 46 [2023-12-21 03:34:31,511 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-21 03:34:31,512 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:34:31,512 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.1s Time] [2023-12-21 03:34:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-21 03:34:31,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-21 03:34:31,522 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-21 03:34:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-12-21 03:34:31,522 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 29 [2023-12-21 03:34:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:34:31,522 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-12-21 03:34:31,522 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-21 03:34:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-12-21 03:34:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 03:34:31,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:34:31,523 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-21 03:34:31,531 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-21 03:34:31,729 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-21 03:34:31,729 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:34:31,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:34:31,730 INFO L85 PathProgramCache]: Analyzing trace with hash -370873652, now seen corresponding path program 1 times [2023-12-21 03:34:31,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:34:31,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281241576] [2023-12-21 03:34:31,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:34:31,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:34:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:33,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:34:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:33,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:34:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:34,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 03:34:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:34,195 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-21 03:34:34,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:34:34,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281241576] [2023-12-21 03:34:34,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281241576] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:34:34,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184086321] [2023-12-21 03:34:34,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:34:34,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:34:34,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:34:34,198 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-21 03:34:34,203 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-21 03:34:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:34:34,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 167 conjunts are in the unsatisfiable core [2023-12-21 03:34:34,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:34:34,478 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-21 03:34:34,846 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:34:34,846 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-21 03:34:34,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:34:34,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:34:34,987 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-21 03:34:34,987 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 57 treesize of output 50 [2023-12-21 03:34:34,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-21 03:34:35,150 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-21 03:34:35,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 85 [2023-12-21 03:34:35,160 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 79 treesize of output 41 [2023-12-21 03:34:35,255 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-21 03:34:35,256 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 83 treesize of output 34 [2023-12-21 03:34:35,260 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-21 03:34:35,264 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-21 03:34:35,386 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-21 03:34:35,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:34:35,480 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-21 03:34:35,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 62 [2023-12-21 03:34:35,504 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2023-12-21 03:34:35,505 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 2 case distinctions, treesize of input 46 treesize of output 58 [2023-12-21 03:34:35,535 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-21 03:34:35,536 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-21 03:34:35,917 INFO L349 Elim1Store]: treesize reduction 320, result has 25.4 percent of original size [2023-12-21 03:34:35,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 663 treesize of output 401 [2023-12-21 03:34:35,988 INFO L349 Elim1Store]: treesize reduction 395, result has 16.3 percent of original size [2023-12-21 03:34:35,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 439 treesize of output 247 [2023-12-21 03:34:36,001 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:34:36,016 INFO L349 Elim1Store]: treesize reduction 54, result has 43.2 percent of original size [2023-12-21 03:34:36,016 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 1 case distinctions, treesize of input 149 treesize of output 147 [2023-12-21 03:34:36,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 89 [2023-12-21 03:34:36,063 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 29 treesize of output 41 [2023-12-21 03:34:36,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 72 treesize of output 80 [2023-12-21 03:34:36,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 30 [2023-12-21 03:34:36,937 INFO L349 Elim1Store]: treesize reduction 945, result has 27.3 percent of original size [2023-12-21 03:34:36,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 1025 treesize of output 742 [2023-12-21 03:34:37,158 INFO L349 Elim1Store]: treesize reduction 602, result has 27.5 percent of original size [2023-12-21 03:34:37,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 492 treesize of output 422 [2023-12-21 03:34:37,316 INFO L349 Elim1Store]: treesize reduction 399, result has 37.6 percent of original size [2023-12-21 03:34:37,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 430 treesize of output 689 [2023-12-21 03:34:37,353 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 32 treesize of output 31 [2023-12-21 03:34:38,029 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-21 03:34:38,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-21 03:34:38,243 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-21 03:34:38,244 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-21 03:34:38,249 INFO L158 Benchmark]: Toolchain (without parser) took 82901.76ms. Allocated memory was 261.1MB in the beginning and 461.4MB in the end (delta: 200.3MB). Free memory was 214.5MB in the beginning and 419.1MB in the end (delta: -204.6MB). Peak memory consumption was 224.2MB. Max. memory is 8.0GB. [2023-12-21 03:34:38,249 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 196.1MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:34:38,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.95ms. Allocated memory is still 261.1MB. Free memory was 214.3MB in the beginning and 195.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-21 03:34:38,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.39ms. Allocated memory is still 261.1MB. Free memory was 195.9MB in the beginning and 193.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:34:38,250 INFO L158 Benchmark]: Boogie Preprocessor took 38.74ms. Allocated memory is still 261.1MB. Free memory was 193.5MB in the beginning and 190.2MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 03:34:38,250 INFO L158 Benchmark]: RCFGBuilder took 451.23ms. Allocated memory is still 261.1MB. Free memory was 190.2MB in the beginning and 224.6MB in the end (delta: -34.4MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. [2023-12-21 03:34:38,250 INFO L158 Benchmark]: TraceAbstraction took 82025.39ms. Allocated memory was 261.1MB in the beginning and 461.4MB in the end (delta: 200.3MB). Free memory was 223.5MB in the beginning and 419.1MB in the end (delta: -195.6MB). Peak memory consumption was 232.4MB. Max. memory is 8.0GB. [2023-12-21 03:34:38,251 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.09ms. Allocated memory is still 196.1MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 329.95ms. Allocated memory is still 261.1MB. Free memory was 214.3MB in the beginning and 195.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.39ms. Allocated memory is still 261.1MB. Free memory was 195.9MB in the beginning and 193.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.74ms. Allocated memory is still 261.1MB. Free memory was 193.5MB in the beginning and 190.2MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 451.23ms. Allocated memory is still 261.1MB. Free memory was 190.2MB in the beginning and 224.6MB in the end (delta: -34.4MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. * TraceAbstraction took 82025.39ms. Allocated memory was 261.1MB in the beginning and 461.4MB in the end (delta: 200.3MB). Free memory was 223.5MB in the beginning and 419.1MB in the end (delta: -195.6MB). Peak memory consumption was 232.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-12-21 03:34:38,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...