/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-16 04:41:18,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:41:18,791 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-16 04:41:18,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:41:18,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:41:18,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:41:18,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:41:18,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:41:18,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:41:18,831 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:41:18,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:41:18,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:41:18,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:41:18,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:41:18,833 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:41:18,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:41:18,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:41:18,833 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:41:18,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:41:18,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:41:18,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:41:18,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:41:18,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:41:18,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:41:18,835 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:41:18,835 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:41:18,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:41:18,836 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:41:18,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:41:18,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:41:18,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:41:18,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:41:18,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:41:18,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:41:18,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:41:18,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:41:18,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:41:18,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:41:18,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:41:18,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:41:18,838 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:41:18,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:41:18,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:41:18,839 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-16 04:41:19,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:41:19,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:41:19,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:41:19,048 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:41:19,049 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:41:19,050 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-16 04:41:20,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:41:20,239 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:41:20,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal.i [2023-12-16 04:41:20,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26ac55284/a3ea86242bff4075b44833e1e65362c6/FLAGf597249a4 [2023-12-16 04:41:20,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26ac55284/a3ea86242bff4075b44833e1e65362c6 [2023-12-16 04:41:20,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:41:20,262 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:41:20,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:41:20,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:41:20,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:41:20,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:41:20" (1/1) ... [2023-12-16 04:41:20,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5515ecd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20, skipping insertion in model container [2023-12-16 04:41:20,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:41:20" (1/1) ... [2023-12-16 04:41:20,312 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:41:20,544 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-16 04:41:20,549 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:41:20,560 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:41:20,589 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-16 04:41:20,589 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:41:20,621 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:41:20,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20 WrapperNode [2023-12-16 04:41:20,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:41:20,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:41:20,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:41:20,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:41:20,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20" (1/1) ... [2023-12-16 04:41:20,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20" (1/1) ... [2023-12-16 04:41:20,664 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2023-12-16 04:41:20,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:41:20,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:41:20,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:41:20,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:41:20,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20" (1/1) ... [2023-12-16 04:41:20,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20" (1/1) ... [2023-12-16 04:41:20,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20" (1/1) ... [2023-12-16 04:41:20,690 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 9, 20]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2023-12-16 04:41:20,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20" (1/1) ... [2023-12-16 04:41:20,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20" (1/1) ... [2023-12-16 04:41:20,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20" (1/1) ... [2023-12-16 04:41:20,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20" (1/1) ... [2023-12-16 04:41:20,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20" (1/1) ... [2023-12-16 04:41:20,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20" (1/1) ... [2023-12-16 04:41:20,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:41:20,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:41:20,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:41:20,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:41:20,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20" (1/1) ... [2023-12-16 04:41:20,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:41:20,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:41:20,733 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-16 04:41:20,752 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-16 04:41:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:41:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:41:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:41:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:41:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:41:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:41:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-16 04:41:20,763 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-16 04:41:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 04:41:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:41:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 04:41:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 04:41:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 04:41:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-16 04:41:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 04:41:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 04:41:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-16 04:41:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 04:41:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-16 04:41:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-16 04:41:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-16 04:41:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:41:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:41:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:41:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:41:20,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:41:20,896 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:41:20,897 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:41:21,053 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:41:21,075 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:41:21,075 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-16 04:41:21,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:41:21 BoogieIcfgContainer [2023-12-16 04:41:21,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:41:21,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:41:21,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:41:21,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:41:21,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:41:20" (1/3) ... [2023-12-16 04:41:21,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796657d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:41:21, skipping insertion in model container [2023-12-16 04:41:21,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:41:20" (2/3) ... [2023-12-16 04:41:21,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796657d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:41:21, skipping insertion in model container [2023-12-16 04:41:21,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:41:21" (3/3) ... [2023-12-16 04:41:21,081 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2023-12-16 04:41:21,092 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:41:21,093 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:41:21,124 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:41:21,128 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;@4cc84714, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:41:21,128 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:41:21,132 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-16 04:41:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 04:41:21,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:41:21,139 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:41:21,140 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:41:21,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:41:21,143 INFO L85 PathProgramCache]: Analyzing trace with hash -977421440, now seen corresponding path program 1 times [2023-12-16 04:41:21,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:41:21,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578529767] [2023-12-16 04:41:21,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:41:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:41:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:21,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:41:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:21,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:41:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:21,389 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-16 04:41:21,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:41:21,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578529767] [2023-12-16 04:41:21,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578529767] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:41:21,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:41:21,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:41:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246513224] [2023-12-16 04:41:21,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:41:21,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:41:21,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:41:21,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:41:21,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:41:21,422 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-16 04:41:21,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:41:21,475 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2023-12-16 04:41:21,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:41:21,477 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-16 04:41:21,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:41:21,482 INFO L225 Difference]: With dead ends: 54 [2023-12-16 04:41:21,482 INFO L226 Difference]: Without dead ends: 24 [2023-12-16 04:41:21,484 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-16 04:41:21,487 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-16 04:41:21,488 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-16 04:41:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-16 04:41:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-16 04:41:21,516 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-16 04:41:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-16 04:41:21,517 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 18 [2023-12-16 04:41:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:41:21,518 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-16 04:41:21,518 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-16 04:41:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-16 04:41:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 04:41:21,519 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:41:21,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:41:21,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:41:21,519 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:41:21,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:41:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1639470509, now seen corresponding path program 1 times [2023-12-16 04:41:21,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:41:21,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732009359] [2023-12-16 04:41:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:41:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:41:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:21,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:41:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:21,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:41:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:21,724 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-16 04:41:21,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:41:21,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732009359] [2023-12-16 04:41:21,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732009359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:41:21,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:41:21,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:41:21,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911376139] [2023-12-16 04:41:21,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:41:21,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:41:21,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:41:21,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:41:21,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:41:21,727 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-16 04:41:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:41:21,780 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-12-16 04:41:21,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:41:21,780 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-16 04:41:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:41:21,781 INFO L225 Difference]: With dead ends: 45 [2023-12-16 04:41:21,781 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 04:41:21,782 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-16 04:41:21,784 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-16 04:41:21,784 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-16 04:41:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 04:41:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2023-12-16 04:41:21,794 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-16 04:41:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-12-16 04:41:21,795 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 18 [2023-12-16 04:41:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:41:21,795 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-12-16 04:41:21,796 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-16 04:41:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-12-16 04:41:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 04:41:21,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:41:21,797 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-16 04:41:21,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:41:21,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:41:21,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:41:21,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2143999192, now seen corresponding path program 1 times [2023-12-16 04:41:21,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:41:21,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567808304] [2023-12-16 04:41:21,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:41:21,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:41:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:22,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:41:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:22,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:41:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:22,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-16 04:41:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:22,273 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-16 04:41:22,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:41:22,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567808304] [2023-12-16 04:41:22,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567808304] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:41:22,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969623543] [2023-12-16 04:41:22,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:41:22,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:41:22,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:41:22,290 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-16 04:41:22,316 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-16 04:41:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:22,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-16 04:41:22,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:41:22,678 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-16 04:41:22,691 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-16 04:41:22,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:41:22,731 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-16 04:41:22,757 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-16 04:41:22,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969623543] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:41:22,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:41:22,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 18 [2023-12-16 04:41:22,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513067956] [2023-12-16 04:41:22,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:41:22,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 04:41:22,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:41:22,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 04:41:22,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-12-16 04:41:22,763 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-16 04:41:26,776 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-16 04:41:30,800 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-16 04:41:34,820 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-16 04:41:38,866 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-16 04:41:42,878 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-16 04:41:47,234 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-16 04:41:51,257 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-16 04:41:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:41:51,269 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2023-12-16 04:41:51,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 04:41:51,270 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-16 04:41:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:41:51,270 INFO L225 Difference]: With dead ends: 53 [2023-12-16 04:41:51,271 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 04:41:51,271 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-16 04:41:51,272 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.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:41:51,272 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.3s Time] [2023-12-16 04:41:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 04:41:51,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-12-16 04:41:51,275 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-16 04:41:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-12-16 04:41:51,276 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 26 [2023-12-16 04:41:51,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:41:51,276 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-12-16 04:41:51,276 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-16 04:41:51,276 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-12-16 04:41:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 04:41:51,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:41:51,277 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-16 04:41:51,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:41:51,482 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-16 04:41:51,484 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:41:51,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:41:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2142152150, now seen corresponding path program 1 times [2023-12-16 04:41:51,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:41:51,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423013109] [2023-12-16 04:41:51,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:41:51,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:41:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:52,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:41:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:52,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:41:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:53,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-16 04:41:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:53,219 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-16 04:41:53,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:41:53,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423013109] [2023-12-16 04:41:53,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423013109] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:41:53,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073414878] [2023-12-16 04:41:53,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:41:53,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:41:53,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:41:53,221 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-16 04:41:53,223 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-16 04:41:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:53,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 112 conjunts are in the unsatisfiable core [2023-12-16 04:41:53,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:41:53,731 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-16 04:41:53,882 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-16 04:41:53,945 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-16 04:41:53,945 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-16 04:41:54,000 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-16 04:41:54,056 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-16 04:41:54,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:41:54,196 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-16 04:41:54,199 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-16 04:41:54,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:41:54,211 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-16 04:41:54,215 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-16 04:41:54,269 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-16 04:41:54,273 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-16 04:41:54,275 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-16 04:41:54,424 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 04:41:54,425 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-16 04:41:54,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:41:54,444 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-16 04:41:54,458 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-16 04:41:54,458 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-16 04:41:54,616 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-16 04:41:54,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:41:54,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:41:54,624 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-16 04:41:54,627 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-16 04:41:54,676 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-16 04:41:54,735 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-16 04:41:54,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:41:54,801 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_673 (Array Int Int)) (v_ArrVal_676 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.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$#1.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#2| (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2) v_ArrVal_676) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_673))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_675) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_675 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_675 .cse2)))))))) is different from false [2023-12-16 04:41:54,812 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_673 (Array Int Int)) (v_ArrVal_676 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.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$#1.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#2| (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2) v_ArrVal_676) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_673))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_675) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_675 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_675 .cse2)))))))) is different from false [2023-12-16 04:41:54,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073414878] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:41:54,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:41:54,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2023-12-16 04:41:54,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373752073] [2023-12-16 04:41:54,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:41:54,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-16 04:41:54,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:41:54,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-16 04:41:54,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1756, Unknown=2, NotChecked=170, Total=2070 [2023-12-16 04:41:54,933 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-16 04:41:55,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:41:55,948 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2023-12-16 04:41:55,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 04:41:55,949 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-16 04:41:55,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:41:55,949 INFO L225 Difference]: With dead ends: 55 [2023-12-16 04:41:55,949 INFO L226 Difference]: Without dead ends: 53 [2023-12-16 04:41:55,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=253, Invalid=2945, Unknown=2, NotChecked=222, Total=3422 [2023-12-16 04:41:55,951 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:41:55,951 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.6s Time] [2023-12-16 04:41:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-16 04:41:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2023-12-16 04:41:55,956 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-16 04:41:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-12-16 04:41:55,957 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 26 [2023-12-16 04:41:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:41:55,957 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-12-16 04:41:55,957 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-16 04:41:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-12-16 04:41:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 04:41:55,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:41:55,958 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-16 04:41:55,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:41:56,168 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-16 04:41:56,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:41:56,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:41:56,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2125151189, now seen corresponding path program 1 times [2023-12-16 04:41:56,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:41:56,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70288898] [2023-12-16 04:41:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:41:56,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:41:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:57,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:41:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:57,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:41:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:57,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-16 04:41:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:57,337 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-16 04:41:57,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:41:57,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70288898] [2023-12-16 04:41:57,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70288898] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:41:57,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938554353] [2023-12-16 04:41:57,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:41:57,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:41:57,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:41:57,339 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-16 04:41:57,341 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-16 04:41:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:41:57,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 97 conjunts are in the unsatisfiable core [2023-12-16 04:41:57,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:41:57,680 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-16 04:41:57,793 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-16 04:41:57,794 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-16 04:41:57,808 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-16 04:41:57,816 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) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~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_~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-16 04:41:57,818 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) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~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_~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-16 04:41:57,832 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 04:41:57,832 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-16 04:41:57,844 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |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| .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_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-16 04:41:57,846 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |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| .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_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-16 04:41:57,861 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (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 ((.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| .cse1) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2023-12-16 04:41:57,862 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (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 ((.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| .cse1) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from true [2023-12-16 04:41:57,902 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-16 04:41:57,902 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-16 04:41:57,907 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-16 04:41:57,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:41:57,920 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-16 04:41:57,937 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse1 (select .cse0 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 4) .cse1) (= (select |c_#valid| .cse2) 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|) (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| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2023-12-16 04:41:57,938 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse1 (select .cse0 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 4) .cse1) (= (select |c_#valid| .cse2) 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|) (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| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2023-12-16 04:41:57,946 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-16 04:41:57,958 WARN L854 $PredicateComparison]: unable to prove that (and (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$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-16 04:41:57,960 WARN L876 $PredicateComparison]: unable to prove that (and (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$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-16 04:41:58,012 WARN L854 $PredicateComparison]: unable to prove that (and (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$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-16 04:41:58,014 WARN L876 $PredicateComparison]: unable to prove that (and (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$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-16 04:41:58,029 WARN L854 $PredicateComparison]: unable to prove that (and (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$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-16 04:41:58,030 WARN L876 $PredicateComparison]: unable to prove that (and (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$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-16 04:41:58,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:41:58,055 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-16 04:41:58,080 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse3 (select .cse2 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= (select .cse2 4) .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2023-12-16 04:41:58,082 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse3 (select .cse2 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= (select .cse2 4) .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2023-12-16 04:41:58,125 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse3 (select .cse2 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= (select .cse2 4) .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2023-12-16 04:41:58,128 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse3 (select .cse2 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= (select .cse2 4) .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2023-12-16 04:41:58,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:41:58,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:41:58,254 INFO L349 Elim1Store]: treesize reduction 364, result has 5.5 percent of original size [2023-12-16 04:41:58,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 459 treesize of output 622 [2023-12-16 04:41:58,267 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 646 treesize of output 581 [2023-12-16 04:41:58,285 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 83 treesize of output 76 [2023-12-16 04:41:58,752 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:41:58,753 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-16 04:41:58,792 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse4 (select .cse16 4)) (.cse2 (select .cse16 0))) (and (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$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse11 (select |c_#memory_$Pointer$#2.base| .cse4))) (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_4) .cse4 v_DerPreprocessor_5) .cse5 v_DerPreprocessor_6))) (let ((.cse7 (select .cse14 .cse2))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_7) .cse4 v_DerPreprocessor_8) .cse5 .cse16)) (.cse15 (store .cse7 4 .cse4))) (and (= .cse6 .cse7) (= .cse7 (select .cse8 .cse2)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) .cse5 .cse15))) (let ((.cse10 (select .cse9 .cse4))) (and (= (select .cse9 .cse2) .cse7) (= .cse10 .cse11) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse12 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4))) (let ((.cse13 (store (store .cse7 .cse12 .cse2) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select .cse11 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (and (= (select .cse10 .cse12) .cse2) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse13 (select .cse8 .cse4)) (= (select .cse14 .cse4) .cse13))))))))) (= v_DerPreprocessor_6 .cse15)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_4) .cse4 v_DerPreprocessor_5) .cse5 v_DerPreprocessor_6))) (let ((.cse17 (select .cse18 .cse2))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_7) .cse4 v_DerPreprocessor_8) .cse5 .cse16)) (.cse24 (store .cse17 4 .cse4))) (and (= .cse6 .cse17) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) .cse5 .cse24))) (let ((.cse21 (select .cse23 .cse4))) (and (exists ((v_prenex_1 Int)) (let ((.cse22 (+ v_prenex_1 4))) (let ((.cse19 (store (store .cse17 .cse22 .cse2) v_prenex_1 (select .cse11 v_prenex_1)))) (and (= (select .cse18 .cse4) .cse19) (= .cse19 (select .cse20 .cse4)) (= .cse2 (select .cse21 .cse22)))))) (= (select .cse23 .cse2) .cse17) (= .cse21 .cse11))))) (= .cse17 (select .cse20 .cse2)) (= v_DerPreprocessor_6 .cse24)))))))))))) is different from false [2023-12-16 04:41:58,797 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse4 (select .cse16 4)) (.cse2 (select .cse16 0))) (and (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$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_old(#valid)_AFTER_CALL_9| .cse3))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse5) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse11 (select |c_#memory_$Pointer$#2.base| .cse4))) (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_4) .cse4 v_DerPreprocessor_5) .cse5 v_DerPreprocessor_6))) (let ((.cse7 (select .cse14 .cse2))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_7) .cse4 v_DerPreprocessor_8) .cse5 .cse16)) (.cse15 (store .cse7 4 .cse4))) (and (= .cse6 .cse7) (= .cse7 (select .cse8 .cse2)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) .cse5 .cse15))) (let ((.cse10 (select .cse9 .cse4))) (and (= (select .cse9 .cse2) .cse7) (= .cse10 .cse11) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse12 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4))) (let ((.cse13 (store (store .cse7 .cse12 .cse2) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select .cse11 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (and (= (select .cse10 .cse12) .cse2) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse13 (select .cse8 .cse4)) (= (select .cse14 .cse4) .cse13))))))))) (= v_DerPreprocessor_6 .cse15)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_4) .cse4 v_DerPreprocessor_5) .cse5 v_DerPreprocessor_6))) (let ((.cse17 (select .cse18 .cse2))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_7) .cse4 v_DerPreprocessor_8) .cse5 .cse16)) (.cse24 (store .cse17 4 .cse4))) (and (= .cse6 .cse17) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) .cse5 .cse24))) (let ((.cse21 (select .cse23 .cse4))) (and (exists ((v_prenex_1 Int)) (let ((.cse22 (+ v_prenex_1 4))) (let ((.cse19 (store (store .cse17 .cse22 .cse2) v_prenex_1 (select .cse11 v_prenex_1)))) (and (= (select .cse18 .cse4) .cse19) (= .cse19 (select .cse20 .cse4)) (= .cse2 (select .cse21 .cse22)))))) (= (select .cse23 .cse2) .cse17) (= .cse21 .cse11))))) (= .cse17 (select .cse20 .cse2)) (= v_DerPreprocessor_6 .cse24)))))))))))) is different from true [2023-12-16 04:41:58,927 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse5 (select .cse16 4)) (.cse3 (select .cse16 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (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 ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse11 (select |c_#memory_$Pointer$#2.base| .cse5))) (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_4) .cse5 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse7 (select .cse14 .cse3))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_7) .cse5 v_DerPreprocessor_8) .cse0 .cse16)) (.cse15 (store .cse7 4 .cse5))) (and (= .cse6 .cse7) (= .cse7 (select .cse8 .cse3)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse0 .cse15))) (let ((.cse10 (select .cse9 .cse5))) (and (= (select .cse9 .cse3) .cse7) (= .cse10 .cse11) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse12 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4))) (let ((.cse13 (store (store .cse7 .cse12 .cse3) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select .cse11 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (and (= (select .cse10 .cse12) .cse3) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse13 (select .cse8 .cse5)) (= (select .cse14 .cse5) .cse13))))))))) (= v_DerPreprocessor_6 .cse15)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_4) .cse5 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse17 (select .cse18 .cse3))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_7) .cse5 v_DerPreprocessor_8) .cse0 .cse16)) (.cse24 (store .cse17 4 .cse5))) (and (= .cse6 .cse17) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse0 .cse24))) (let ((.cse21 (select .cse23 .cse5))) (and (exists ((v_prenex_1 Int)) (let ((.cse22 (+ v_prenex_1 4))) (let ((.cse19 (store (store .cse17 .cse22 .cse3) v_prenex_1 (select .cse11 v_prenex_1)))) (and (= (select .cse18 .cse5) .cse19) (= .cse19 (select .cse20 .cse5)) (= .cse3 (select .cse21 .cse22)))))) (= (select .cse23 .cse3) .cse17) (= .cse21 .cse11))))) (= .cse17 (select .cse20 .cse3)) (= v_DerPreprocessor_6 .cse24)))))))))))) is different from false [2023-12-16 04:41:58,931 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse5 (select .cse16 4)) (.cse3 (select .cse16 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (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 ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse11 (select |c_#memory_$Pointer$#2.base| .cse5))) (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_4) .cse5 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse7 (select .cse14 .cse3))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_7) .cse5 v_DerPreprocessor_8) .cse0 .cse16)) (.cse15 (store .cse7 4 .cse5))) (and (= .cse6 .cse7) (= .cse7 (select .cse8 .cse3)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse0 .cse15))) (let ((.cse10 (select .cse9 .cse5))) (and (= (select .cse9 .cse3) .cse7) (= .cse10 .cse11) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse12 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4))) (let ((.cse13 (store (store .cse7 .cse12 .cse3) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select .cse11 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (and (= (select .cse10 .cse12) .cse3) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse13 (select .cse8 .cse5)) (= (select .cse14 .cse5) .cse13))))))))) (= v_DerPreprocessor_6 .cse15)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_4) .cse5 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse17 (select .cse18 .cse3))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_7) .cse5 v_DerPreprocessor_8) .cse0 .cse16)) (.cse24 (store .cse17 4 .cse5))) (and (= .cse6 .cse17) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse0 .cse24))) (let ((.cse21 (select .cse23 .cse5))) (and (exists ((v_prenex_1 Int)) (let ((.cse22 (+ v_prenex_1 4))) (let ((.cse19 (store (store .cse17 .cse22 .cse3) v_prenex_1 (select .cse11 v_prenex_1)))) (and (= (select .cse18 .cse5) .cse19) (= .cse19 (select .cse20 .cse5)) (= .cse3 (select .cse21 .cse22)))))) (= (select .cse23 .cse3) .cse17) (= .cse21 .cse11))))) (= .cse17 (select .cse20 .cse3)) (= v_DerPreprocessor_6 .cse24)))))))))))) is different from true [2023-12-16 04:41:59,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:41:59,106 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 1598 treesize of output 990 [2023-12-16 04:41:59,147 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-16 04:41:59,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 10952 treesize of output 7834 [2023-12-16 04:41:59,324 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:41:59,324 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-16 04:41:59,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:41:59,588 INFO L349 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2023-12-16 04:41:59,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 236 treesize of output 277 [2023-12-16 04:41:59,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 103 [2023-12-16 04:41:59,636 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-12-16 04:41:59,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 5 [2023-12-16 04:41:59,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:41:59,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2023-12-16 04:41:59,655 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 25 treesize of output 17 [2023-12-16 04:41:59,666 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_35) 0) (= (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_35) 1))) is different from false [2023-12-16 04:42:03,705 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_35) 0) (= (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_35) 1))) is different from true [2023-12-16 04:42:03,721 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-16 04:42:03,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:42:04,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938554353] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:42:04,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:42:04,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 38 [2023-12-16 04:42:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000177034] [2023-12-16 04:42:04,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:42:04,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-16 04:42:04,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:04,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-16 04:42:04,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=782, Unknown=42, NotChecked=884, Total=1806 [2023-12-16 04:42:04,554 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 38 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 29 states have internal predecessors, (41), 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-16 04:42:04,791 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))) (= |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) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from false [2023-12-16 04:42:04,794 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))) (= |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) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from true [2023-12-16 04:42:04,798 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.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) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (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) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from false [2023-12-16 04:42:04,801 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.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) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (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) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from true [2023-12-16 04:42:04,804 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |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| .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_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) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~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-16 04:42:04,807 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |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| .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_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) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~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-16 04:42:04,811 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (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 ((.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| .cse1) 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|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2023-12-16 04:42:04,814 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (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 ((.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| .cse1) 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|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from true [2023-12-16 04:42:04,832 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse5 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse2 (select .cse5 4)) (.cse1 (select .cse0 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 4) .cse1) (not (= .cse2 .cse3)) (= (select |c_#valid| .cse4) 1) (= (select .cse5 0) .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|) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2023-12-16 04:42:04,836 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse5 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse2 (select .cse5 4)) (.cse1 (select .cse0 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select .cse0 4) .cse1) (not (= .cse2 .cse3)) (= (select |c_#valid| .cse4) 1) (= (select .cse5 0) .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|) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= (select |c_#valid| .cse3) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2023-12-16 04:42:04,877 WARN L854 $PredicateComparison]: unable to prove that (and (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$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-16 04:42:04,880 WARN L876 $PredicateComparison]: unable to prove that (and (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$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-16 04:42:04,888 WARN L854 $PredicateComparison]: unable to prove that (and (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$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= |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_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-16 04:42:04,891 WARN L876 $PredicateComparison]: unable to prove that (and (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$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= |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_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-16 04:42:04,901 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (or (= .cse2 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))) is different from false [2023-12-16 04:42:04,905 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (or (= .cse2 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))) is different from true [2023-12-16 04:42:04,921 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.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$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse6 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse4 (select .cse6 4)) (.cse3 (select .cse2 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= (select .cse2 4) .cse3) (not (= .cse4 .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (= (select .cse6 0) .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (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|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 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_#t~ret9#1.base| .cse5)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2023-12-16 04:42:04,924 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.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$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse6 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse4 (select .cse6 4)) (.cse3 (select .cse2 0))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#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 ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= (select .cse2 4) .cse3) (not (= .cse4 .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (= (select .cse6 0) .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (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|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 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_#t~ret9#1.base| .cse5)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2023-12-16 04:42:04,956 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.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$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse6 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse0 (select .cse6 4)) (.cse4 (select .cse3 0))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_append_~head#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 ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (= (select .cse3 4) .cse4) (not (= .cse0 .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= (select .cse6 0) .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (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|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2023-12-16 04:42:04,961 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.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$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse6 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse0 (select .cse6 4)) (.cse4 (select .cse3 0))) (and (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_append_~head#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 ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (= (select .cse3 4) .cse4) (not (= .cse0 .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= (select .cse6 0) .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (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|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2023-12-16 04:42:05,003 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse3 0))) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| .cse7))) (let ((.cse6 (select .cse19 4)) (.cse4 (select .cse19 0)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (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$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (let ((.cse2 (select |c_#memory_$Pointer$#2.base| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= (select .cse2 4) (select .cse2 0)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (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_old(#valid)_AFTER_CALL_9| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse7) 0))) (= (select .cse8 0) 0) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse14 (select |c_#memory_$Pointer$#2.base| .cse6))) (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_4) .cse6 v_DerPreprocessor_5) .cse7 v_DerPreprocessor_6))) (let ((.cse10 (select .cse17 .cse4))) (let ((.cse11 (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_7) .cse6 v_DerPreprocessor_8) .cse7 .cse19)) (.cse18 (store .cse10 4 .cse6))) (and (= .cse9 .cse10) (= .cse10 (select .cse11 .cse4)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) .cse7 .cse18))) (let ((.cse13 (select .cse12 .cse6))) (and (= (select .cse12 .cse4) .cse10) (= .cse13 .cse14) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse15 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4))) (let ((.cse16 (store (store .cse10 .cse15 .cse4) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select .cse14 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (and (= (select .cse13 .cse15) .cse4) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse16 (select .cse11 .cse6)) (= (select .cse17 .cse6) .cse16))))))))) (= v_DerPreprocessor_6 .cse18)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_4) .cse6 v_DerPreprocessor_5) .cse7 v_DerPreprocessor_6))) (let ((.cse20 (select .cse21 .cse4))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_7) .cse6 v_DerPreprocessor_8) .cse7 .cse19)) (.cse27 (store .cse20 4 .cse6))) (and (= .cse9 .cse20) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) .cse7 .cse27))) (let ((.cse24 (select .cse26 .cse6))) (and (exists ((v_prenex_1 Int)) (let ((.cse25 (+ v_prenex_1 4))) (let ((.cse22 (store (store .cse20 .cse25 .cse4) v_prenex_1 (select .cse14 v_prenex_1)))) (and (= (select .cse21 .cse6) .cse22) (= .cse22 (select .cse23 .cse6)) (= .cse4 (select .cse24 .cse25)))))) (= (select .cse26 .cse4) .cse20) (= .cse24 .cse14))))) (= .cse20 (select .cse23 .cse4)) (= v_DerPreprocessor_6 .cse27)))))))) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2023-12-16 04:42:05,010 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse3 0))) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| .cse7))) (let ((.cse6 (select .cse19 4)) (.cse4 (select .cse19 0)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (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$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |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))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (let ((.cse2 (select |c_#memory_$Pointer$#2.base| (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= (select .cse2 4) (select .cse2 0)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (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_old(#valid)_AFTER_CALL_9| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse7) 0))) (= (select .cse8 0) 0) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse14 (select |c_#memory_$Pointer$#2.base| .cse6))) (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_4) .cse6 v_DerPreprocessor_5) .cse7 v_DerPreprocessor_6))) (let ((.cse10 (select .cse17 .cse4))) (let ((.cse11 (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_7) .cse6 v_DerPreprocessor_8) .cse7 .cse19)) (.cse18 (store .cse10 4 .cse6))) (and (= .cse9 .cse10) (= .cse10 (select .cse11 .cse4)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) .cse7 .cse18))) (let ((.cse13 (select .cse12 .cse6))) (and (= (select .cse12 .cse4) .cse10) (= .cse13 .cse14) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse15 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4))) (let ((.cse16 (store (store .cse10 .cse15 .cse4) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select .cse14 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (and (= (select .cse13 .cse15) .cse4) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse16 (select .cse11 .cse6)) (= (select .cse17 .cse6) .cse16))))))))) (= v_DerPreprocessor_6 .cse18)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_4) .cse6 v_DerPreprocessor_5) .cse7 v_DerPreprocessor_6))) (let ((.cse20 (select .cse21 .cse4))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_7) .cse6 v_DerPreprocessor_8) .cse7 .cse19)) (.cse27 (store .cse20 4 .cse6))) (and (= .cse9 .cse20) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) .cse7 .cse27))) (let ((.cse24 (select .cse26 .cse6))) (and (exists ((v_prenex_1 Int)) (let ((.cse25 (+ v_prenex_1 4))) (let ((.cse22 (store (store .cse20 .cse25 .cse4) v_prenex_1 (select .cse14 v_prenex_1)))) (and (= (select .cse21 .cse6) .cse22) (= .cse22 (select .cse23 .cse6)) (= .cse4 (select .cse24 .cse25)))))) (= (select .cse26 .cse4) .cse20) (= .cse24 .cse14))))) (= .cse20 (select .cse23 .cse4)) (= v_DerPreprocessor_6 .cse27)))))))) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2023-12-16 04:42:05,109 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse26 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse26 0))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse5 (select .cse17 4)) (.cse3 (select .cse17 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (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 ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0))) (= (select .cse6 0) 0) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse12 (select |c_#memory_$Pointer$#2.base| .cse5))) (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_4) .cse5 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse8 (select .cse15 .cse3))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_7) .cse5 v_DerPreprocessor_8) .cse0 .cse17)) (.cse16 (store .cse8 4 .cse5))) (and (= .cse7 .cse8) (= .cse8 (select .cse9 .cse3)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse0 .cse16))) (let ((.cse11 (select .cse10 .cse5))) (and (= (select .cse10 .cse3) .cse8) (= .cse11 .cse12) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse13 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4))) (let ((.cse14 (store (store .cse8 .cse13 .cse3) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select .cse12 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (and (= (select .cse11 .cse13) .cse3) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse14 (select .cse9 .cse5)) (= (select .cse15 .cse5) .cse14))))))))) (= v_DerPreprocessor_6 .cse16)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_4) .cse5 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse18 (select .cse19 .cse3))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_7) .cse5 v_DerPreprocessor_8) .cse0 .cse17)) (.cse25 (store .cse18 4 .cse5))) (and (= .cse7 .cse18) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse0 .cse25))) (let ((.cse22 (select .cse24 .cse5))) (and (exists ((v_prenex_1 Int)) (let ((.cse23 (+ v_prenex_1 4))) (let ((.cse20 (store (store .cse18 .cse23 .cse3) v_prenex_1 (select .cse12 v_prenex_1)))) (and (= (select .cse19 .cse5) .cse20) (= .cse20 (select .cse21 .cse5)) (= .cse3 (select .cse22 .cse23)))))) (= (select .cse24 .cse3) .cse18) (= .cse22 .cse12))))) (= .cse18 (select .cse21 .cse3)) (= v_DerPreprocessor_6 .cse25)))))))) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (select (select |c_#memory_$Pointer$#2.base| (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2023-12-16 04:42:05,114 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse26 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse26 0))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse5 (select .cse17 4)) (.cse3 (select .cse17 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (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 ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0))) (= (select .cse6 0) 0) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse12 (select |c_#memory_$Pointer$#2.base| .cse5))) (or (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_4) .cse5 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse8 (select .cse15 .cse3))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_7) .cse5 v_DerPreprocessor_8) .cse0 .cse17)) (.cse16 (store .cse8 4 .cse5))) (and (= .cse7 .cse8) (= .cse8 (select .cse9 .cse3)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse0 .cse16))) (let ((.cse11 (select .cse10 .cse5))) (and (= (select .cse10 .cse3) .cse8) (= .cse11 .cse12) (exists ((|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int)) (let ((.cse13 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4))) (let ((.cse14 (store (store .cse8 .cse13 .cse3) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select .cse12 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (and (= (select .cse11 .cse13) .cse3) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (= .cse14 (select .cse9 .cse5)) (= (select .cse15 .cse5) .cse14))))))))) (= v_DerPreprocessor_6 .cse16)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_4) .cse5 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse18 (select .cse19 .cse3))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_7) .cse5 v_DerPreprocessor_8) .cse0 .cse17)) (.cse25 (store .cse18 4 .cse5))) (and (= .cse7 .cse18) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse0 .cse25))) (let ((.cse22 (select .cse24 .cse5))) (and (exists ((v_prenex_1 Int)) (let ((.cse23 (+ v_prenex_1 4))) (let ((.cse20 (store (store .cse18 .cse23 .cse3) v_prenex_1 (select .cse12 v_prenex_1)))) (and (= (select .cse19 .cse5) .cse20) (= .cse20 (select .cse21 .cse5)) (= .cse3 (select .cse22 .cse23)))))) (= (select .cse24 .cse3) .cse18) (= .cse22 .cse12))))) (= .cse18 (select .cse21 .cse3)) (= v_DerPreprocessor_6 .cse25)))))))) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (select (select |c_#memory_$Pointer$#2.base| (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2023-12-16 04:42:05,129 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_35) 0) (= (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_35) 1)))) is different from false [2023-12-16 04:42:05,131 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_#t~mem18#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_35) 0) (= (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_35) 1)))) is different from true [2023-12-16 04:42:05,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:05,175 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2023-12-16 04:42:05,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 04:42:05,176 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 29 states have internal predecessors, (41), 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-16 04:42:05,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:05,177 INFO L225 Difference]: With dead ends: 61 [2023-12-16 04:42:05,177 INFO L226 Difference]: Without dead ends: 56 [2023-12-16 04:42:05,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=136, Invalid=892, Unknown=68, NotChecked=2210, Total=3306 [2023-12-16 04:42:05,178 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1012 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:42:05,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 321 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 1012 Unchecked, 0.3s Time] [2023-12-16 04:42:05,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-16 04:42:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-16 04:42:05,184 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-16 04:42:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2023-12-16 04:42:05,185 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 29 [2023-12-16 04:42:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:05,185 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2023-12-16 04:42:05,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 29 states have internal predecessors, (41), 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-16 04:42:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2023-12-16 04:42:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 04:42:05,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:05,186 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-16 04:42:05,193 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-16 04:42:05,393 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-16 04:42:05,396 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:05,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:05,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2125194899, now seen corresponding path program 1 times [2023-12-16 04:42:05,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:05,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025273430] [2023-12-16 04:42:05,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:05,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:07,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:42:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:07,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:42:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:07,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-16 04:42:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:07,648 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-16 04:42:07,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:07,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025273430] [2023-12-16 04:42:07,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025273430] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:42:07,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135381578] [2023-12-16 04:42:07,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:07,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:42:07,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:42:07,650 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-16 04:42:07,650 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-16 04:42:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:08,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 168 conjunts are in the unsatisfiable core [2023-12-16 04:42:08,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:42:08,161 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-16 04:42:08,169 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-16 04:42:08,423 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-16 04:42:08,423 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-16 04:42:08,452 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-16 04:42:08,452 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-16 04:42:08,523 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-16 04:42:08,528 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-16 04:42:08,537 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-16 04:42:08,628 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-16 04:42:08,636 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-16 04:42:08,642 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-16 04:42:08,850 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-12-16 04:42:08,851 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 229 treesize of output 173 [2023-12-16 04:42:08,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:08,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2023-12-16 04:42:08,863 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 18 treesize of output 26 [2023-12-16 04:42:08,874 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 116 treesize of output 100 [2023-12-16 04:42:08,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2023-12-16 04:42:08,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2023-12-16 04:42:08,903 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-16 04:42:09,001 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 64 treesize of output 24 [2023-12-16 04:42:09,006 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-16 04:42:09,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-12-16 04:42:09,016 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 7 treesize of output 3 [2023-12-16 04:42:09,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:09,264 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 72 treesize of output 43 [2023-12-16 04:42:09,279 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-16 04:42:09,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2023-12-16 04:42:09,304 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-16 04:42:09,304 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-16 04:42:09,321 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 31 treesize of output 20 [2023-12-16 04:42:09,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:09,708 INFO L349 Elim1Store]: treesize reduction 356, result has 5.6 percent of original size [2023-12-16 04:42:09,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 613 treesize of output 740 [2023-12-16 04:42:09,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:09,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:09,732 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 58 treesize of output 43 [2023-12-16 04:42:09,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2023-12-16 04:42:09,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2023-12-16 04:42:09,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:09,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:09,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:09,791 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:42:09,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 251 treesize of output 185 [2023-12-16 04:42:09,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 328 treesize of output 265 [2023-12-16 04:42:09,831 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 57 treesize of output 23 [2023-12-16 04:42:09,839 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-16 04:42:10,206 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 297 treesize of output 197 [2023-12-16 04:42:10,215 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-16 04:42:10,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 489 treesize of output 229 [2023-12-16 04:42:10,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2023-12-16 04:42:10,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:42:10,235 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 45 treesize of output 33 [2023-12-16 04:42:10,246 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 35 treesize of output 23 [2023-12-16 04:42:10,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-16 04:42:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:42:10,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:42:10,722 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse8))) (let ((.cse4 (select |c_#memory_int#2| .cse3)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse8)) (.cse1 (+ .cse12 4)) (.cse10 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1219 Int)) (let ((.cse0 (select (let ((.cse13 (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_1215) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1213))) (store .cse13 .cse6 (store (select .cse13 .cse6) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse11))) (let ((.cse2 (select .cse0 .cse12))) (or (= (select .cse0 .cse1) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse3 (store .cse4 .cse5 v_ArrVal_1219)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1211) .cse6 v_ArrVal_1217) (select (select (let ((.cse7 (let ((.cse9 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1218))) (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 .cse3) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1221))))) (store .cse7 .cse6 (store (select .cse7 .cse6) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse11) .cse12)) (+ .cse2 8))))))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1219 Int)) (let ((.cse16 (select (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_1218))) (store .cse18 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse10 .cse3) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1221))))) (store .cse17 .cse6 (store (select .cse17 .cse6) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse11))) (let ((.cse14 (select .cse16 .cse12))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse3 (store .cse4 .cse5 v_ArrVal_1219)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1211) .cse6 v_ArrVal_1217) .cse14) (+ (select (select (let ((.cse15 (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_1215) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1213))) (store .cse15 .cse6 (store (select .cse15 .cse6) .cse8 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse11) .cse12) 8))) (= (select .cse16 .cse1) .cse14))))))))) is different from false [2023-12-16 04:42:10,773 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse6))) (let ((.cse1 (select |c_#memory_int#2| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse6)) (.cse13 (+ 4 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)) (.cse10 (+ .cse8 4)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1219 Int)) (let ((.cse9 (select (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1218))) (store .cse12 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse13 .cse0) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| v_ArrVal_1221))))) (store .cse11 .cse3 (store (select .cse11 .cse3) .cse6 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) .cse7))) (let ((.cse4 (select .cse9 .cse8))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 (store .cse1 .cse2 v_ArrVal_1219)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1211) .cse3 v_ArrVal_1217) .cse4) (+ (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1215) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1213))) (store .cse5 .cse3 (store (select .cse5 .cse3) .cse6 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) .cse7) .cse8) 8))) (= (select .cse9 .cse10) .cse4))))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1221 Int) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1219 Int)) (let ((.cse17 (select (let ((.cse18 (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1215) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1213))) (store .cse18 .cse3 (store (select .cse18 .cse3) .cse6 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) .cse7))) (let ((.cse16 (select .cse17 .cse8))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 (store .cse1 .cse2 v_ArrVal_1219)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1211) .cse3 v_ArrVal_1217) (select (select (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1218))) (store .cse15 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse13 .cse0) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| v_ArrVal_1221))))) (store .cse14 .cse3 (store (select .cse14 .cse3) .cse6 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) .cse7) .cse8)) (+ .cse16 8))) (= .cse16 (select .cse17 .cse10)))))))))) is different from false [2023-12-16 04:42:11,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135381578] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:42:11,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:42:11,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 43 [2023-12-16 04:42:11,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563584762] [2023-12-16 04:42:11,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:42:11,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-16 04:42:11,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:11,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-16 04:42:11,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2108, Unknown=3, NotChecked=186, Total=2450 [2023-12-16 04:42:11,306 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 43 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-16 04:42:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:13,174 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2023-12-16 04:42:13,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 04:42:13,175 INFO L78 Accepts]: Start accepts. Automaton has has 43 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-16 04:42:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:13,176 INFO L225 Difference]: With dead ends: 74 [2023-12-16 04:42:13,176 INFO L226 Difference]: Without dead ends: 69 [2023-12-16 04:42:13,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=271, Invalid=3640, Unknown=3, NotChecked=246, Total=4160 [2023-12-16 04:42:13,178 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:42:13,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 242 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 737 Invalid, 2 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 04:42:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-16 04:42:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2023-12-16 04:42:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 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-16 04:42:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-12-16 04:42:13,185 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 29 [2023-12-16 04:42:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:13,185 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-12-16 04:42:13,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 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-16 04:42:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2023-12-16 04:42:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 04:42:13,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:13,186 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-16 04:42:13,193 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-16 04:42:13,393 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-16 04:42:13,394 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:13,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash -370873652, now seen corresponding path program 1 times [2023-12-16 04:42:13,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:13,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849450857] [2023-12-16 04:42:13,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:13,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:15,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:42:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:15,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:42:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:15,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-16 04:42:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:42:15,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:15,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849450857] [2023-12-16 04:42:15,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849450857] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:42:15,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580163967] [2023-12-16 04:42:15,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:15,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:42:15,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:42:15,461 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-16 04:42:15,480 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-16 04:42:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:15,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 169 conjunts are in the unsatisfiable core [2023-12-16 04:42:15,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:42:15,699 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-16 04:42:15,882 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_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2023-12-16 04:42:15,884 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_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2023-12-16 04:42:15,895 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-16 04:42:15,911 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-16 04:42:15,935 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_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |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) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0)) is different from false [2023-12-16 04:42:15,937 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_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |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) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0)) is different from true [2023-12-16 04:42:15,962 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 04:42:15,962 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 49 treesize of output 44 [2023-12-16 04:42:15,982 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-12-16 04:42:15,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2023-12-16 04:42:15,993 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.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_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from false [2023-12-16 04:42:15,995 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.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_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from true [2023-12-16 04:42:16,033 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2023-12-16 04:42:16,035 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0)) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from true [2023-12-16 04:42:16,083 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-16 04:42:16,083 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 191 treesize of output 96 [2023-12-16 04:42:16,100 INFO L349 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2023-12-16 04:42:16,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 73 [2023-12-16 04:42:16,132 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse1))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse1)) (.cse2 (select .cse4 0))) (and (= (select .cse0 4) 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_append_~data#1|) (= (select .cse4 4) .cse2) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-12-16 04:42:16,139 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse1))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse1)) (.cse2 (select .cse4 0))) (and (= (select .cse0 4) 0) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_append_~data#1|) (= (select .cse4 4) .cse2) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-12-16 04:42:16,156 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-16 04:42:16,156 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 67 treesize of output 26 [2023-12-16 04:42:16,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:16,164 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-16 04:42:16,186 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (v_arrayElimCell_105 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_105) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-16 04:42:16,189 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (v_arrayElimCell_105 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_105) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-16 04:42:16,220 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (v_arrayElimCell_105 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_105) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) 0)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-16 04:42:16,223 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (v_arrayElimCell_105 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_105) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) 0)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-16 04:42:16,252 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-16 04:42:16,258 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) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (v_arrayElimCell_105 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_105) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2023-12-16 04:42:16,261 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) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (v_arrayElimCell_105 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_105) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2023-12-16 04:42:16,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:16,297 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-16 04:42:16,297 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 75 treesize of output 52 [2023-12-16 04:42:16,348 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2023-12-16 04:42:16,348 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-16 04:42:16,457 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse8 0))) (and (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| .cse2))) (let ((.cse1 (or (and (= (select .cse3 4) 0) (= (select .cse3 0) 0)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)))) (or (and (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse0) .cse1) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| .cse0))) (and (or (and .cse1 (not (= .cse2 .cse0))) (and (= .cse3 .cse4) (= (select .cse4 4) 0))) (= (select .cse4 0) 0)))))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (v_arrayElimCell_105 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_105) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (exists ((|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= |v_#valid_BEFORE_CALL_17| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_16| .cse7 (select |v_#valid_BEFORE_CALL_17| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0))) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse8 4) .cse0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8)) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-12-16 04:42:16,461 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse8 0))) (and (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| .cse2))) (let ((.cse1 (or (and (= (select .cse3 4) 0) (= (select .cse3 0) 0)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)))) (or (and (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse0) .cse1) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| .cse0))) (and (or (and .cse1 (not (= .cse2 .cse0))) (and (= .cse3 .cse4) (= (select .cse4 4) 0))) (= (select .cse4 0) 0)))))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (v_arrayElimCell_105 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_105) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (exists ((|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= |v_#valid_BEFORE_CALL_17| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_16| .cse7 (select |v_#valid_BEFORE_CALL_17| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0))) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse8 4) .cse0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8)) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-12-16 04:42:16,597 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse2 (select .cse8 0))) (and (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| .cse5))) (let ((.cse0 (and (= (select .cse3 4) 0) (= (select .cse3 0) 0))) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5))) (or (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse2)) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (or .cse0 (and (= .cse3 .cse4) (= (select .cse4 4) 0)) .cse1) (= (select .cse4 0) 0)))))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (v_arrayElimCell_105 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_105) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse5 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse8 4) .cse2) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_17| .cse5) 1) (= |v_#valid_BEFORE_CALL_17| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_16| .cse9 (select |v_#valid_BEFORE_CALL_17| .cse9)))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse5) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2023-12-16 04:42:16,601 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse2 (select .cse8 0))) (and (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| .cse5))) (let ((.cse0 (and (= (select .cse3 4) 0) (= (select .cse3 0) 0))) (.cse1 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5))) (or (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse2)) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (or .cse0 (and (= .cse3 .cse4) (= (select .cse4 4) 0)) .cse1) (= (select .cse4 0) 0)))))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (v_arrayElimCell_105 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_105) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0) (= |v_#valid_BEFORE_CALL_16| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_16|))) (store |v_old(#valid)_AFTER_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_16| .cse7)))) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) 0)))) (<= 5 |c_ULTIMATE.start_main_~uneq~0#1|) (= .cse5 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (<= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse8 4) .cse2) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_17| .cse5) 1) (= |v_#valid_BEFORE_CALL_17| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_17|))) (store |v_old(#valid)_AFTER_CALL_16| .cse9 (select |v_#valid_BEFORE_CALL_17| .cse9)))) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse5) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2023-12-16 04:42:16,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:17,159 INFO L349 Elim1Store]: treesize reduction 985, result has 25.9 percent of original size [2023-12-16 04:42:17,159 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 968 treesize of output 700 [2023-12-16 04:42:17,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:17,259 INFO L349 Elim1Store]: treesize reduction 78, result has 37.6 percent of original size [2023-12-16 04:42:17,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 439 treesize of output 406 [2023-12-16 04:42:17,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:17,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:17,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:17,458 INFO L349 Elim1Store]: treesize reduction 264, result has 35.5 percent of original size [2023-12-16 04:42:17,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 372 treesize of output 499 [2023-12-16 04:42:17,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:17,511 INFO L349 Elim1Store]: treesize reduction 49, result has 47.3 percent of original size [2023-12-16 04:42:17,511 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 2 case distinctions, treesize of input 87 treesize of output 58 [2023-12-16 04:42:17,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-16 04:42:17,553 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2023-12-16 04:42:17,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-16 04:42:17,701 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 33 treesize of output 23 [2023-12-16 04:42:17,770 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 18 treesize of output 17 [2023-12-16 04:42:18,015 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2023-12-16 04:42:18,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-12-16 04:42:18,029 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-16 04:42:18,164 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2023-12-16 04:42:18,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2023-12-16 04:42:18,197 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2023-12-16 04:42:18,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2023-12-16 04:42:18,316 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2023-12-16 04:42:18,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2023-12-16 04:42:18,328 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:42:18,338 INFO L349 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2023-12-16 04:42:18,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2023-12-16 04:42:18,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:42:18,453 INFO L349 Elim1Store]: treesize reduction 20, result has 56.5 percent of original size [2023-12-16 04:42:18,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 291 treesize of output 241 [2023-12-16 04:42:18,823 INFO L349 Elim1Store]: treesize reduction 30, result has 64.7 percent of original size [2023-12-16 04:42:18,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 614 treesize of output 564 Received shutdown request... [2023-12-16 04:42:25,093 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 04:42:25,102 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 04:42:25,104 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:42:25,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-16 04:42:25,310 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-16 04:42:25,312 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 33 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-19-9-2-1 context. [2023-12-16 04:42:25,316 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:25,318 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:42:25,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:42:25 BoogieIcfgContainer [2023-12-16 04:42:25,321 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:42:25,321 INFO L158 Benchmark]: Toolchain (without parser) took 65059.38ms. Allocated memory was 331.4MB in the beginning and 715.1MB in the end (delta: 383.8MB). Free memory was 278.9MB in the beginning and 622.8MB in the end (delta: -343.9MB). Peak memory consumption was 416.6MB. Max. memory is 8.0GB. [2023-12-16 04:42:25,322 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 220.2MB. Free memory is still 170.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:42:25,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.80ms. Allocated memory is still 331.4MB. Free memory was 278.9MB in the beginning and 260.3MB in the end (delta: 18.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 04:42:25,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.93ms. Allocated memory is still 331.4MB. Free memory was 260.3MB in the beginning and 257.9MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:42:25,323 INFO L158 Benchmark]: Boogie Preprocessor took 38.41ms. Allocated memory is still 331.4MB. Free memory was 257.9MB in the beginning and 254.5MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:42:25,323 INFO L158 Benchmark]: RCFGBuilder took 371.71ms. Allocated memory is still 331.4MB. Free memory was 254.5MB in the beginning and 285.8MB in the end (delta: -31.3MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. [2023-12-16 04:42:25,323 INFO L158 Benchmark]: TraceAbstraction took 64244.28ms. Allocated memory was 331.4MB in the beginning and 715.1MB in the end (delta: 383.8MB). Free memory was 285.3MB in the beginning and 622.8MB in the end (delta: -337.5MB). Peak memory consumption was 422.1MB. Max. memory is 8.0GB. [2023-12-16 04:42:25,324 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 220.2MB. Free memory is still 170.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 359.80ms. Allocated memory is still 331.4MB. Free memory was 278.9MB in the beginning and 260.3MB in the end (delta: 18.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.93ms. Allocated memory is still 331.4MB. Free memory was 260.3MB in the beginning and 257.9MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.41ms. Allocated memory is still 331.4MB. Free memory was 257.9MB in the beginning and 254.5MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 371.71ms. Allocated memory is still 331.4MB. Free memory was 254.5MB in the beginning and 285.8MB in the end (delta: -31.3MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. * TraceAbstraction took 64244.28ms. Allocated memory was 331.4MB in the beginning and 715.1MB in the end (delta: 383.8MB). Free memory was 285.3MB in the beginning and 622.8MB in the end (delta: -337.5MB). Peak memory consumption was 422.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 650). Cancelled while NwaCegarLoop was analyzing trace of length 33 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-19-9-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.2s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 32.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 30.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 1213 SdHoareTripleChecker+Invalid, 30.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1012 IncrementalHoareTripleChecker+Unchecked, 1086 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1891 IncrementalHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 127 mSDtfsCounter, 1891 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 204 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 1778 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=5, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 271 ConstructedInterpolants, 32 QuantifiedInterpolants, 11072 SizeOfPredicates, 89 NumberOfNonLiveVariables, 1548 ConjunctsInSsa, 404 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 55/100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown