/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/sll2c_append_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 17:06:43,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 17:06:43,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 17:06:43,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 17:06:43,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 17:06:43,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 17:06:43,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 17:06:43,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 17:06:43,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 17:06:43,300 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 17:06:43,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 17:06:43,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 17:06:43,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 17:06:43,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 17:06:43,302 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 17:06:43,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 17:06:43,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 17:06:43,302 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 17:06:43,303 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 17:06:43,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 17:06:43,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 17:06:43,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 17:06:43,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 17:06:43,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 17:06:43,304 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 17:06:43,304 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 17:06:43,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 17:06:43,305 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 17:06:43,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 17:06:43,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 17:06:43,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 17:06:43,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 17:06:43,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 17:06:43,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 17:06:43,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 17:06:43,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 17:06:43,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 17:06:43,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 17:06:43,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 17:06:43,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 17:06:43,307 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 17:06:43,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 17:06:43,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 17:06:43,308 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 17:06:43,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 17:06:43,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 17:06:43,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 17:06:43,518 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 17:06:43,518 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 17:06:43,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_append_equal.i [2023-12-19 17:06:44,501 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 17:06:44,717 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 17:06:44,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_append_equal.i [2023-12-19 17:06:44,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e55e03c9/c202ce4eb52243aaa937ae88d8685025/FLAG5cff1aba6 [2023-12-19 17:06:44,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e55e03c9/c202ce4eb52243aaa937ae88d8685025 [2023-12-19 17:06:44,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 17:06:44,748 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 17:06:44,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 17:06:44,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 17:06:44,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 17:06:44,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:06:44" (1/1) ... [2023-12-19 17:06:44,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e52ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:44, skipping insertion in model container [2023-12-19 17:06:44,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:06:44" (1/1) ... [2023-12-19 17:06:44,792 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 17:06:45,014 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/sll2c_append_equal.i[24433,24446] [2023-12-19 17:06:45,017 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 17:06:45,023 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 17:06:45,051 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/sll2c_append_equal.i[24433,24446] [2023-12-19 17:06:45,051 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 17:06:45,069 INFO L206 MainTranslator]: Completed translation [2023-12-19 17:06:45,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:45 WrapperNode [2023-12-19 17:06:45,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 17:06:45,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 17:06:45,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 17:06:45,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 17:06:45,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:45" (1/1) ... [2023-12-19 17:06:45,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:45" (1/1) ... [2023-12-19 17:06:45,127 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2023-12-19 17:06:45,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 17:06:45,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 17:06:45,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 17:06:45,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 17:06:45,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:45" (1/1) ... [2023-12-19 17:06:45,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:45" (1/1) ... [2023-12-19 17:06:45,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:45" (1/1) ... [2023-12-19 17:06:45,161 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 13, 9]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 7, 1]. [2023-12-19 17:06:45,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:45" (1/1) ... [2023-12-19 17:06:45,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:45" (1/1) ... [2023-12-19 17:06:45,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:45" (1/1) ... [2023-12-19 17:06:45,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:45" (1/1) ... [2023-12-19 17:06:45,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:45" (1/1) ... [2023-12-19 17:06:45,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:45" (1/1) ... [2023-12-19 17:06:45,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 17:06:45,175 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 17:06:45,175 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 17:06:45,175 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 17:06:45,176 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:45" (1/1) ... [2023-12-19 17:06:45,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 17:06:45,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:06:45,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 17:06:45,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 17:06:45,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 17:06:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 17:06:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 17:06:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 17:06:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 17:06:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 17:06:45,230 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-19 17:06:45,231 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-19 17:06:45,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-19 17:06:45,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 17:06:45,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-19 17:06:45,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-19 17:06:45,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-19 17:06:45,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-19 17:06:45,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-19 17:06:45,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-19 17:06:45,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-19 17:06:45,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-19 17:06:45,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-19 17:06:45,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-19 17:06:45,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-19 17:06:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 17:06:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 17:06:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 17:06:45,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 17:06:45,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 17:06:45,358 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 17:06:45,360 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 17:06:45,545 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 17:06:45,581 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 17:06:45,581 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-19 17:06:45,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:06:45 BoogieIcfgContainer [2023-12-19 17:06:45,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 17:06:45,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 17:06:45,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 17:06:45,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 17:06:45,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:06:44" (1/3) ... [2023-12-19 17:06:45,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf8d2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:06:45, skipping insertion in model container [2023-12-19 17:06:45,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:06:45" (2/3) ... [2023-12-19 17:06:45,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf8d2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:06:45, skipping insertion in model container [2023-12-19 17:06:45,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:06:45" (3/3) ... [2023-12-19 17:06:45,586 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-12-19 17:06:45,597 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 17:06:45,597 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 17:06:45,624 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 17:06:45,628 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;@58e5bf8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 17:06:45,628 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 17:06:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:06:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-19 17:06:45,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:06:45,635 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:06:45,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:06:45,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:06:45,638 INFO L85 PathProgramCache]: Analyzing trace with hash 383461057, now seen corresponding path program 1 times [2023-12-19 17:06:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:06:45,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739186427] [2023-12-19 17:06:45,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:06:45,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:06:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:06:45,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:06:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:06:45,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:06:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:06:45,847 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-19 17:06:45,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:06:45,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739186427] [2023-12-19 17:06:45,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739186427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:06:45,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:06:45,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 17:06:45,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318025269] [2023-12-19 17:06:45,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:06:45,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 17:06:45,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:06:45,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 17:06:45,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 17:06:45,869 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 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-19 17:06:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:06:45,924 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2023-12-19 17:06:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 17:06:45,926 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-19 17:06:45,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:06:45,930 INFO L225 Difference]: With dead ends: 54 [2023-12-19 17:06:45,930 INFO L226 Difference]: Without dead ends: 23 [2023-12-19 17:06:45,932 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-19 17:06:45,935 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 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-19 17:06:45,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:06:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-19 17:06:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-19 17:06:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:06:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-19 17:06:45,962 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2023-12-19 17:06:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:06:45,963 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-19 17:06:45,964 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-19 17:06:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-19 17:06:45,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-19 17:06:45,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:06:45,968 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:06:45,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 17:06:45,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:06:45,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:06:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash -391035257, now seen corresponding path program 1 times [2023-12-19 17:06:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:06:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807769030] [2023-12-19 17:06:45,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:06:45,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:06:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:06:46,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:06:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:06:46,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 17:06:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:06:46,173 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-19 17:06:46,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:06:46,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807769030] [2023-12-19 17:06:46,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807769030] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:06:46,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:06:46,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 17:06:46,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206905974] [2023-12-19 17:06:46,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:06:46,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 17:06:46,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:06:46,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 17:06:46,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 17:06:46,176 INFO L87 Difference]: Start difference. First operand 23 states and 29 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-19 17:06:46,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:06:46,211 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2023-12-19 17:06:46,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 17:06:46,211 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-19 17:06:46,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:06:46,212 INFO L225 Difference]: With dead ends: 43 [2023-12-19 17:06:46,212 INFO L226 Difference]: Without dead ends: 26 [2023-12-19 17:06:46,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 17:06:46,213 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:06:46,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:06:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-19 17:06:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-12-19 17:06:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:06:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-12-19 17:06:46,219 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 18 [2023-12-19 17:06:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:06:46,220 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-12-19 17:06:46,220 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-19 17:06:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-12-19 17:06:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-19 17:06:46,220 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:06:46,221 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] [2023-12-19 17:06:46,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 17:06:46,221 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:06:46,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:06:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash 620466046, now seen corresponding path program 1 times [2023-12-19 17:06:46,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:06:46,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830715612] [2023-12-19 17:06:46,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:06:46,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:06:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:06:46,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:06:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:06:46,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 17:06:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:06:46,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 17:06:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:06:46,599 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-19 17:06:46,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:06:46,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830715612] [2023-12-19 17:06:46,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830715612] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:06:46,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868109363] [2023-12-19 17:06:46,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:06:46,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:06:46,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:06:46,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:06:46,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 17:06:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:06:46,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-19 17:06:46,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:06:46,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-19 17:06:46,897 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-19 17:06:46,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:06:46,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-19 17:06:46,947 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-19 17:06:46,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868109363] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:06:46,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:06:46,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2023-12-19 17:06:46,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285220500] [2023-12-19 17:06:46,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:06:46,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-19 17:06:46,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:06:46,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-19 17:06:46,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-12-19 17:06:46,949 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 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-19 17:06:50,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:06:54,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:06:58,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:07:03,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:07:07,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-19 17:07:07,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:07:07,219 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-12-19 17:07:07,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 17:07:07,220 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 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 24 [2023-12-19 17:07:07,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:07:07,220 INFO L225 Difference]: With dead ends: 36 [2023-12-19 17:07:07,220 INFO L226 Difference]: Without dead ends: 29 [2023-12-19 17:07:07,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2023-12-19 17:07:07,221 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-12-19 17:07:07,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 202 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2023-12-19 17:07:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-19 17:07:07,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-12-19 17:07:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:07:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-12-19 17:07:07,226 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 24 [2023-12-19 17:07:07,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:07:07,226 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-12-19 17:07:07,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 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-19 17:07:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-12-19 17:07:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-19 17:07:07,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:07:07,227 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] [2023-12-19 17:07:07,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-19 17:07:07,432 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-19 17:07:07,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:07:07,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:07:07,433 INFO L85 PathProgramCache]: Analyzing trace with hash 724565085, now seen corresponding path program 1 times [2023-12-19 17:07:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:07:07,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117665263] [2023-12-19 17:07:07,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:07:07,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:07:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:08,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:07:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:08,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 17:07:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:08,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 17:07:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:08,180 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-19 17:07:08,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:07:08,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117665263] [2023-12-19 17:07:08,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117665263] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:07:08,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590967417] [2023-12-19 17:07:08,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:07:08,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:07:08,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:07:08,184 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:07:08,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 17:07:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:08,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 105 conjunts are in the unsatisfiable core [2023-12-19 17:07:08,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:07:08,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:07:08,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:07:08,634 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:07:08,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-19 17:07:08,676 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-19 17:07:08,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-19 17:07:08,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:07:08,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-19 17:07:08,964 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-19 17:07:08,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-12-19 17:07:08,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-19 17:07:09,178 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 59 treesize of output 26 [2023-12-19 17:07:09,180 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-19 17:07:09,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-19 17:07:09,288 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-19 17:07:09,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:07:09,388 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_465) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_466) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_465 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_465 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) is different from false [2023-12-19 17:07:09,415 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_465 .cse1))) v_ArrVal_465)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_465) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_466) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2023-12-19 17:07:09,425 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_465) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_466) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_465 .cse1))) v_ArrVal_465))))) is different from false [2023-12-19 17:07:09,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590967417] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:07:09,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:07:09,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 37 [2023-12-19 17:07:09,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691459633] [2023-12-19 17:07:09,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:07:09,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-19 17:07:09,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:07:09,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-19 17:07:09,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1533, Unknown=3, NotChecked=240, Total=1892 [2023-12-19 17:07:09,527 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 37 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:07:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:07:10,373 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2023-12-19 17:07:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-19 17:07:10,374 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2023-12-19 17:07:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:07:10,374 INFO L225 Difference]: With dead ends: 39 [2023-12-19 17:07:10,374 INFO L226 Difference]: Without dead ends: 31 [2023-12-19 17:07:10,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=251, Invalid=2728, Unknown=3, NotChecked=324, Total=3306 [2023-12-19 17:07:10,376 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 17:07:10,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 252 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 17:07:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-19 17:07:10,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-12-19 17:07:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:07:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-12-19 17:07:10,381 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 27 [2023-12-19 17:07:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:07:10,381 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-12-19 17:07:10,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:07:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-12-19 17:07:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-19 17:07:10,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:07:10,382 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-19 17:07:10,390 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-19 17:07:10,582 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-19 17:07:10,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:07:10,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:07:10,584 INFO L85 PathProgramCache]: Analyzing trace with hash 80578008, now seen corresponding path program 1 times [2023-12-19 17:07:10,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:07:10,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856458229] [2023-12-19 17:07:10,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:07:10,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:07:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:11,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:07:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:11,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 17:07:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:11,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 17:07:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:07:11,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:07:11,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856458229] [2023-12-19 17:07:11,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856458229] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:07:11,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653120907] [2023-12-19 17:07:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:07:11,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:07:11,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:07:11,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:07:11,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 17:07:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:11,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 125 conjunts are in the unsatisfiable core [2023-12-19 17:07:11,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:07:11,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:07:12,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:07:12,157 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:07:12,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-19 17:07:12,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:07:12,216 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-19 17:07:12,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-19 17:07:12,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-19 17:07:12,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-19 17:07:12,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:07:12,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-19 17:07:12,540 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-19 17:07:12,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-12-19 17:07:12,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-19 17:07:12,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-19 17:07:12,865 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 28 treesize of output 12 [2023-12-19 17:07:12,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-19 17:07:12,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-19 17:07:12,963 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 25 treesize of output 15 [2023-12-19 17:07:13,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-19 17:07:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:07:13,076 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:07:13,145 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_644) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_645) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-12-19 17:07:13,215 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 51 treesize of output 43 [2023-12-19 17:07:13,228 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_arrayElimCell_36 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_644) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_645) .cse0) .cse1)) (= v_arrayElimCell_36 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_arrayElimCell_36 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_644) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_645) .cse0) .cse1))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))))) is different from false [2023-12-19 17:07:13,242 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_arrayElimCell_36 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_644) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_645) .cse0) .cse1))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= .cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse2)))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_arrayElimCell_36 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_644) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_645) .cse0) .cse1)) (= v_arrayElimCell_36 .cse3))))) is different from false [2023-12-19 17:07:13,268 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_arrayElimCell_36 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_644) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_645) .cse0) .cse1))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= .cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse2)))) (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_arrayElimCell_36 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_644) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_645) .cse0) .cse1)) (= v_arrayElimCell_36 .cse3))))) is different from false [2023-12-19 17:07:13,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653120907] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:07:13,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:07:13,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2023-12-19 17:07:13,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313362061] [2023-12-19 17:07:13,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:07:13,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-19 17:07:13,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:07:13,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-19 17:07:13,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2006, Unknown=4, NotChecked=372, Total=2550 [2023-12-19 17:07:13,409 INFO L87 Difference]: Start difference. First operand 29 states and 33 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-19 17:07:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:07:14,325 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2023-12-19 17:07:14,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-19 17:07:14,326 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-19 17:07:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:07:14,326 INFO L225 Difference]: With dead ends: 45 [2023-12-19 17:07:14,327 INFO L226 Difference]: Without dead ends: 43 [2023-12-19 17:07:14,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=317, Invalid=3477, Unknown=4, NotChecked=492, Total=4290 [2023-12-19 17:07:14,328 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 17:07:14,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 262 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 17:07:14,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-19 17:07:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2023-12-19 17:07:14,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:07:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-12-19 17:07:14,353 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 29 [2023-12-19 17:07:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:07:14,353 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-12-19 17:07:14,354 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-19 17:07:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-12-19 17:07:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-19 17:07:14,355 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:07:14,355 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, 1, 1] [2023-12-19 17:07:14,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-19 17:07:14,564 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-19 17:07:14,567 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:07:14,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:07:14,567 INFO L85 PathProgramCache]: Analyzing trace with hash 127932368, now seen corresponding path program 1 times [2023-12-19 17:07:14,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:07:14,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827837874] [2023-12-19 17:07:14,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:07:14,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:07:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:15,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:07:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:15,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 17:07:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:15,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 17:07:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:07:15,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:07:15,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827837874] [2023-12-19 17:07:15,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827837874] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:07:15,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585642717] [2023-12-19 17:07:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:07:15,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:07:15,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:07:15,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:07:15,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 17:07:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:15,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-19 17:07:15,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:07:15,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:07:15,923 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:07:15,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-19 17:07:15,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:07:16,028 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-19 17:07:16,028 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 54 treesize of output 41 [2023-12-19 17:07:16,068 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-19 17:07:16,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:07:16,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:07:16,185 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-19 17:07:16,195 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-19 17:07:16,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-19 17:07:16,371 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-12-19 17:07:16,371 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 45 treesize of output 51 [2023-12-19 17:07:16,392 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-12-19 17:07:16,392 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 3 case distinctions, treesize of input 60 treesize of output 66 [2023-12-19 17:07:16,403 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 22 treesize of output 16 [2023-12-19 17:07:16,459 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-19 17:07:16,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:07:16,497 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 35 treesize of output 19 [2023-12-19 17:07:16,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-19 17:07:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-19 17:07:16,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:07:16,703 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_823 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (or (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_823) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_820) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|) 0)))) is different from false [2023-12-19 17:07:16,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585642717] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:07:16,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:07:16,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2023-12-19 17:07:16,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189745902] [2023-12-19 17:07:16,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:07:16,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-19 17:07:16,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:07:16,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-19 17:07:16,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1502, Unknown=21, NotChecked=78, Total=1722 [2023-12-19 17:07:16,706 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-19 17:07:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:07:17,677 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2023-12-19 17:07:17,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-19 17:07:17,678 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2023-12-19 17:07:17,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:07:17,681 INFO L225 Difference]: With dead ends: 80 [2023-12-19 17:07:17,681 INFO L226 Difference]: Without dead ends: 77 [2023-12-19 17:07:17,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=266, Invalid=3023, Unknown=21, NotChecked=112, Total=3422 [2023-12-19 17:07:17,684 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 98 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 17:07:17,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 272 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 17:07:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-19 17:07:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2023-12-19 17:07:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 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-19 17:07:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2023-12-19 17:07:17,706 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 31 [2023-12-19 17:07:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:07:17,707 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2023-12-19 17:07:17,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-19 17:07:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2023-12-19 17:07:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-19 17:07:17,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:07:17,708 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:07:17,715 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-19 17:07:17,914 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-19 17:07:17,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:07:17,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:07:17,914 INFO L85 PathProgramCache]: Analyzing trace with hash -315712365, now seen corresponding path program 2 times [2023-12-19 17:07:17,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:07:17,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720791705] [2023-12-19 17:07:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:07:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:07:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:18,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:07:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:18,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 17:07:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 17:07:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:07:18,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:07:18,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720791705] [2023-12-19 17:07:18,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720791705] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:07:18,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978207067] [2023-12-19 17:07:18,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:07:18,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:07:18,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:07:18,693 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:07:18,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-19 17:07:18,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 17:07:18,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:07:18,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 141 conjunts are in the unsatisfiable core [2023-12-19 17:07:18,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:07:18,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:07:18,957 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 18 treesize of output 7 [2023-12-19 17:07:19,133 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:07:19,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-19 17:07:19,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-19 17:07:19,191 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 19 treesize of output 18 [2023-12-19 17:07:19,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:07:19,281 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-19 17:07:19,281 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 103 treesize of output 57 [2023-12-19 17:07:19,290 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 54 treesize of output 33 [2023-12-19 17:07:19,341 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-19 17:07:19,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2023-12-19 17:07:19,345 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 19 treesize of output 7 [2023-12-19 17:07:19,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:07:19,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:07:19,478 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-19 17:07:19,478 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 72 treesize of output 55 [2023-12-19 17:07:19,493 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-19 17:07:19,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-19 17:07:19,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-12-19 17:07:19,904 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-19 17:07:19,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2023-12-19 17:07:19,907 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 19 treesize of output 7 [2023-12-19 17:07:19,914 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:07:19,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:07:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-19 17:07:19,948 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:07:20,211 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_28| Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_28| v_ArrVal_1003)) (.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_28| v_ArrVal_1004)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse6 (select (select .cse0 .cse3) .cse5)) (.cse7 (select (select .cse4 .cse3) .cse5))) (let ((.cse1 (select (select .cse0 .cse6) .cse7)) (.cse2 (select (select .cse4 .cse6) .cse7))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_28|) 0)) (not (= (select (select .cse0 .cse1) .cse2) .cse3)) (not (= (select (select .cse4 .cse1) .cse2) .cse5))))))) is different from false [2023-12-19 17:07:20,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978207067] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:07:20,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:07:20,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 37 [2023-12-19 17:07:20,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554811170] [2023-12-19 17:07:20,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:07:20,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-19 17:07:20,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:07:20,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-19 17:07:20,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1588, Unknown=1, NotChecked=80, Total=1806 [2023-12-19 17:07:20,214 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 37 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:07:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:07:20,919 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2023-12-19 17:07:20,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-19 17:07:20,920 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2023-12-19 17:07:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:07:20,921 INFO L225 Difference]: With dead ends: 69 [2023-12-19 17:07:20,921 INFO L226 Difference]: Without dead ends: 56 [2023-12-19 17:07:20,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=254, Invalid=2505, Unknown=1, NotChecked=102, Total=2862 [2023-12-19 17:07:20,922 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 17:07:20,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 214 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 17:07:20,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-19 17:07:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2023-12-19 17:07:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 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-19 17:07:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2023-12-19 17:07:20,928 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 31 [2023-12-19 17:07:20,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:07:20,929 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2023-12-19 17:07:20,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:07:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2023-12-19 17:07:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-19 17:07:20,929 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:07:20,929 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-19 17:07:20,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-19 17:07:21,138 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-19 17:07:21,139 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:07:21,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:07:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash -329022723, now seen corresponding path program 1 times [2023-12-19 17:07:21,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:07:21,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273261142] [2023-12-19 17:07:21,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:07:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:07:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:22,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:07:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:22,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 17:07:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:22,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 17:07:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:07:22,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:07:22,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273261142] [2023-12-19 17:07:22,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273261142] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:07:22,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222876590] [2023-12-19 17:07:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:07:22,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:07:22,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:07:22,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:07:23,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-19 17:07:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:23,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 160 conjunts are in the unsatisfiable core [2023-12-19 17:07:23,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:07:23,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:07:23,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:07:23,560 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-19 17:07:23,561 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-19 17:07:23,583 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:07:23,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-19 17:07:23,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:07:23,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:07:23,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-19 17:07:23,760 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-19 17:07:23,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 83 [2023-12-19 17:07:23,767 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 15 [2023-12-19 17:07:23,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:07:23,773 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-19 17:07:23,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2023-12-19 17:07:23,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-19 17:07:23,846 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-19 17:07:23,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:07:23,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-19 17:07:24,042 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-19 17:07:24,042 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-19 17:07:24,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:07:24,057 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 53 treesize of output 36 [2023-12-19 17:07:24,069 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-19 17:07:24,069 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-19 17:07:24,088 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-19 17:07:24,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-19 17:07:24,580 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-12-19 17:07:24,580 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 60 treesize of output 54 [2023-12-19 17:07:24,602 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-12-19 17:07:24,602 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 3 case distinctions, treesize of input 118 treesize of output 112 [2023-12-19 17:07:24,621 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-19 17:07:24,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2023-12-19 17:07:24,638 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-19 17:07:24,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-12-19 17:07:24,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 25 [2023-12-19 17:07:24,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2023-12-19 17:07:24,695 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 55 treesize of output 43 [2023-12-19 17:07:24,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-19 17:07:24,847 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 237 treesize of output 165 [2023-12-19 17:07:25,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:07:25,091 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 169 treesize of output 121 [2023-12-19 17:07:25,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:07:25,098 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 109 treesize of output 106 [2023-12-19 17:07:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:07:25,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:07:25,449 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (v_ArrVal_1184 Int) (v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (or (not (= (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_1186 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) v_ArrVal_1186)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1186))) (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_1184))) (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1187) .cse1) .cse2)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1190) .cse1) .cse2) 4)))))) is different from false [2023-12-19 17:07:25,474 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1184 Int) (v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (= (store (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34|) .cse0 (select v_ArrVal_1186 .cse0)) v_ArrVal_1186)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse1 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| v_ArrVal_1186))) (store .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_1184))) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34|) .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1187) .cse2) .cse3)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34|) .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1190) .cse2) .cse3) 4))))))) is different from false [2023-12-19 17:07:25,492 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1184 Int) (v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| v_ArrVal_1186))) (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_1184))) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34|) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1187) .cse2) .cse3)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34|) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1190) .cse2) .cse3) 4)))) (not (= (store (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34|) .cse1 (select v_ArrVal_1186 .cse1)) v_ArrVal_1186))))) is different from false [2023-12-19 17:07:25,504 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1184 Int) (v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (or (not (= (store (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34|) .cse0 (select v_ArrVal_1186 .cse0)) v_ArrVal_1186)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse1 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| v_ArrVal_1186))) (store .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| v_ArrVal_1184))) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34|) .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1187) .cse2) .cse3)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34|) .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1190) .cse2) .cse3) 4))))))) is different from false [2023-12-19 17:07:25,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:07:25,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 159 [2023-12-19 17:07:25,624 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1184 Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1202))) (let ((.cse0 (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_arrayElimArr_5)) (.cse1 (select (select .cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (or (not (= (select v_arrayElimArr_5 4) |c_ULTIMATE.start_sll_circular_append_~data#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| v_ArrVal_1186) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| (store (select (store .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| v_ArrVal_1186) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0 v_ArrVal_1184)) (select (select (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1200) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34|) .cse1 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1187) .cse2) .cse3)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34| (store (select .cse4 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34|) .cse1 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1190) .cse2) .cse3) 4)))) (not (= v_ArrVal_1186 (store (select .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_34|) .cse1 (select v_ArrVal_1186 .cse1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0)))))) is different from false [2023-12-19 17:07:25,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222876590] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:07:25,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:07:25,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2023-12-19 17:07:25,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058779104] [2023-12-19 17:07:25,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:07:25,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-19 17:07:25,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:07:25,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-19 17:07:25,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2124, Unknown=5, NotChecked=480, Total=2756 [2023-12-19 17:07:25,628 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 45 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:07:27,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:07:27,300 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2023-12-19 17:07:27,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-19 17:07:27,300 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2023-12-19 17:07:27,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:07:27,301 INFO L225 Difference]: With dead ends: 66 [2023-12-19 17:07:27,301 INFO L226 Difference]: Without dead ends: 64 [2023-12-19 17:07:27,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=288, Invalid=3887, Unknown=5, NotChecked=650, Total=4830 [2023-12-19 17:07:27,303 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 17:07:27,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 250 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 17:07:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-19 17:07:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2023-12-19 17:07:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 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-19 17:07:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2023-12-19 17:07:27,318 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 32 [2023-12-19 17:07:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:07:27,318 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2023-12-19 17:07:27,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:07:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2023-12-19 17:07:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-19 17:07:27,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:07:27,320 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:07:27,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 17:07:27,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:07:27,530 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:07:27,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:07:27,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1638621109, now seen corresponding path program 1 times [2023-12-19 17:07:27,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:07:27,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239885854] [2023-12-19 17:07:27,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:07:27,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:07:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:28,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:07:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:28,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 17:07:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:28,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 17:07:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:28,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:07:28,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:07:28,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239885854] [2023-12-19 17:07:28,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239885854] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:07:28,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039897790] [2023-12-19 17:07:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:07:28,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:07:28,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:07:28,893 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:07:28,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-19 17:07:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:29,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-19 17:07:29,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:07:29,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:07:29,376 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:07:29,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-19 17:07:29,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:07:29,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:07:29,502 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-19 17:07:29,502 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 78 treesize of output 53 [2023-12-19 17:07:29,506 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 15 [2023-12-19 17:07:29,559 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-19 17:07:29,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:07:29,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-19 17:07:29,700 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-19 17:07:29,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-19 17:07:29,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:07:29,716 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-19 17:07:29,729 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-19 17:07:29,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-19 17:07:30,055 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-19 17:07:30,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 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 55 [2023-12-19 17:07:30,073 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-12-19 17:07:30,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 83 [2023-12-19 17:07:30,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:07:30,078 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 65 treesize of output 15 [2023-12-19 17:07:30,151 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:07:30,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:07:30,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-19 17:07:30,274 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 67 treesize of output 43 [2023-12-19 17:07:30,281 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-19 17:07:30,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 19 [2023-12-19 17:07:30,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:07:30,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:07:30,386 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (not (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1375))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1373) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1376) .cse1) .cse2))) .cse1)))) is different from false [2023-12-19 17:07:30,396 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (not (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1375))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1373) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1376) .cse1) .cse2)))) .cse1)))) is different from false [2023-12-19 17:07:30,402 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (not (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1375))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1373) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1376) .cse1) .cse2)))) .cse1)))) is different from false [2023-12-19 17:07:30,441 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_ArrVal_1381 (Array Int Int))) (or (not (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1381)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select .cse4 .cse5) .cse6)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select .cse4 .cse3) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1382) .cse5) .cse6) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1375))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1373) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1376) .cse1) .cse2)))) .cse1))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|) 0)))) is different from false [2023-12-19 17:07:30,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039897790] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:07:30,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:07:30,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 44 [2023-12-19 17:07:30,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81832274] [2023-12-19 17:07:30,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:07:30,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-19 17:07:30,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:07:30,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-19 17:07:30,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1847, Unknown=18, NotChecked=356, Total=2352 [2023-12-19 17:07:30,444 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 44 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:07:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:07:31,915 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2023-12-19 17:07:31,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-19 17:07:31,916 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-12-19 17:07:31,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:07:31,917 INFO L225 Difference]: With dead ends: 72 [2023-12-19 17:07:31,917 INFO L226 Difference]: Without dead ends: 69 [2023-12-19 17:07:31,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=346, Invalid=4622, Unknown=18, NotChecked=564, Total=5550 [2023-12-19 17:07:31,919 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 102 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 17:07:31,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 368 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 17:07:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-19 17:07:31,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2023-12-19 17:07:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 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-19 17:07:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2023-12-19 17:07:31,931 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 34 [2023-12-19 17:07:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:07:31,931 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2023-12-19 17:07:31,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 17:07:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2023-12-19 17:07:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-19 17:07:31,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:07:31,932 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:07:31,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-19 17:07:32,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:07:32,142 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:07:32,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:07:32,142 INFO L85 PathProgramCache]: Analyzing trace with hash -742312008, now seen corresponding path program 2 times [2023-12-19 17:07:32,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:07:32,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962167684] [2023-12-19 17:07:32,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:07:32,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:07:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:33,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:07:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:33,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 17:07:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:33,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 17:07:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:07:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:07:34,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:07:34,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962167684] [2023-12-19 17:07:34,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962167684] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:07:34,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596194904] [2023-12-19 17:07:34,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:07:34,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:07:34,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:07:34,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:07:34,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-19 17:07:34,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 17:07:34,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:07:34,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 176 conjunts are in the unsatisfiable core [2023-12-19 17:07:34,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:07:34,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:07:34,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:07:34,643 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 17:07:34,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-19 17:07:34,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-19 17:07:34,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-19 17:07:34,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:07:34,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:07:34,795 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-19 17:07:34,796 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 142 treesize of output 72 [2023-12-19 17:07:34,798 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 39 treesize of output 30 [2023-12-19 17:07:34,808 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-19 17:07:34,878 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-19 17:07:34,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2023-12-19 17:07:34,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 17:07:34,887 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 19 treesize of output 7 [2023-12-19 17:07:34,893 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-19 17:07:35,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-19 17:07:35,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:07:35,107 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-19 17:07:35,107 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 87 treesize of output 64 [2023-12-19 17:07:35,128 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2023-12-19 17:07:35,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2023-12-19 17:07:35,148 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-19 17:07:35,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-19 17:07:35,157 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 24 treesize of output 19 [2023-12-19 17:07:35,738 INFO L349 Elim1Store]: treesize reduction 108, result has 43.2 percent of original size [2023-12-19 17:07:35,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 110 [2023-12-19 17:07:35,809 INFO L349 Elim1Store]: treesize reduction 118, result has 36.2 percent of original size [2023-12-19 17:07:35,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 case distinctions, treesize of input 164 treesize of output 145 [2023-12-19 17:07:35,852 INFO L349 Elim1Store]: treesize reduction 79, result has 31.3 percent of original size [2023-12-19 17:07:35,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 131 [2023-12-19 17:07:35,862 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 34 [2023-12-19 17:07:35,900 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:07:35,900 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 20 treesize of output 1 [2023-12-19 17:07:35,913 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:07:35,914 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 52 treesize of output 19 [2023-12-19 17:07:35,924 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 19 treesize of output 15 [2023-12-19 17:07:38,163 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2023-12-19 17:07:38,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 104 treesize of output 73 [2023-12-19 17:07:38,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2023-12-19 17:07:38,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2023-12-19 17:07:38,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-12-19 17:09:09,201 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification. DAG size of input: 304 DAG size of output: 302 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 17:10:06,799 WARN L293 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 305 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 17:10:43,249 WARN L293 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 309 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 17:10:53,763 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_19|) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.offset|) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse8 (select |c_#memory_int#1| .cse1)) (.cse19 (select .cse11 0)) (.cse10 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse3 (= (select .cse10 0) 0)) (.cse6 (= .cse19 .cse0)) (.cse5 (= (select .cse8 4) 1)) (.cse4 (= .cse2 0))) (or (and (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (not (= .cse1 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse0)))) .cse3 .cse4 .cse5 .cse6) (and (let ((.cse54 (and (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse86 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse86) 0) (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| 0)) (= .cse86 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) (not (= .cse1 .cse86)) (= (select (select |c_#memory_$Pointer$#1.base| .cse86) 0) (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= .cse86 .cse0))))) .cse5)) (.cse59 (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int)) (let ((.cse84 (select .cse11 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse85 (select |c_#memory_int#1| .cse84))) (and (not (= .cse84 .cse0)) (not (= .cse1 .cse84)) (= (select .cse85 4) 1) (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#1.base| .cse84) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse84) 0) (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (exists ((v_DerPreprocessor_2 (Array Int Int))) (= (select (store (store |c_#memory_int#1| .cse1 v_DerPreprocessor_2) .cse84 (store .cse8 0 (select .cse85 0))) .cse1) .cse8)) (= (select .cse10 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0)))))) (.cse62 (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse82 (select .cse11 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse83 (select |c_#memory_int#1| .cse82))) (and (= (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#1.base| .cse82) 0)) (not (= .cse82 .cse0)) (not (= .cse1 .cse82)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse82) 0) (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select (store (store |c_#memory_int#1| .cse1 v_DerPreprocessor_2) .cse82 (store .cse8 0 (select .cse83 0))) .cse1) .cse8) (= (select .cse83 4) 1) (= (select .cse10 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0))))))) (or (and (or (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (and (= 0 (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (exists ((v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int)) (let ((.cse7 (select .cse11 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse9 (select |c_#memory_int#1| .cse7))) (and (= (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#1.base| .cse7) 0)) (not (= .cse7 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 0) 0) (not (= .cse1 .cse7)) (= (select (store (store |c_#memory_int#1| .cse1 v_DerPreprocessor_2) .cse7 (store .cse8 0 (select .cse9 0))) .cse1) .cse8) (= (select .cse9 4) 1) (= (select .cse10 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0))))))) (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (and (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int)) (and (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| .cse0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse13 (select |c_#memory_int#1| .cse12))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (not (= .cse12 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select .cse13 4) 1) (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse14 (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|))) (let ((.cse15 (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| v_DerPreprocessor_2) .cse12 (store .cse14 0 (select .cse13 0))))) (and (= .cse14 (select .cse15 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select (select .cse15 .cse1) 4) 1))))) (not (= .cse1 .cse12)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse12) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse12) 0) (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= .cse12 .cse0)))))))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (and .cse5 (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| .cse0)) (= .cse16 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) (not (= .cse1 .cse16)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse16) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse16) 0) (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))))))) .cse3 .cse6) (and .cse3 .cse5 (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#1.base| .cse17) 0)) (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| .cse17) (= (select (select |c_#memory_$Pointer$#1.offset| .cse17) 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))))) .cse6) (let ((.cse21 (select |c_#memory_int#1| .cse19))) (and (let ((.cse20 (store .cse8 0 (select .cse21 0)))) (or (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int#1| .cse1 v_DerPreprocessor_2) .cse19 .cse20) .cse1))) (and (= .cse18 .cse8) (= (select .cse18 4) 1)))) (exists ((v_DerPreprocessor_2 (Array Int Int))) (= (select (store (store |c_#memory_int#1| .cse1 v_DerPreprocessor_2) .cse19 .cse20) .cse1) .cse8)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse19) 0) 0) (= (select .cse21 4) 1) (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse22 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse19) 0) .cse22) (= .cse22 .cse0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))))) .cse3 (not .cse6))) (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| .cse27))) (let ((.cse25 (select .cse23 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse24 (select |c_#memory_$Pointer$#1.offset| .cse27)) (.cse28 (select |c_#memory_int#1| .cse25))) (and (= (select .cse23 0) .cse0) (= (select .cse24 0) 0) (not (= .cse25 .cse0)) (let ((.cse26 (select |c_#memory_int#1| .cse27))) (= .cse26 (select (store (store |c_#memory_int#1| .cse27 v_DerPreprocessor_2) .cse25 (store .cse26 0 (select .cse28 0))) .cse27))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse25) 0) 0) (= (select .cse24 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (= (select .cse28 4) 1) (= .cse1 .cse27) (= .cse27 (select (select |c_#memory_$Pointer$#1.base| .cse25) 0)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)))))))) (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int)) (and (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| .cse0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int)) (let ((.cse29 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse30 (select |c_#memory_int#1| .cse29))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (not (= .cse29 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select .cse30 4) 1) (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse31 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse31) 0) .cse0) (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse32 (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|))) (let ((.cse33 (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| v_DerPreprocessor_2) .cse29 (store .cse32 0 (select .cse30 0))))) (and (= .cse32 (select .cse33 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select (select .cse33 .cse31) 4) 1))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse29) 0) (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse31) 0) 0) (= .cse1 .cse31) (= (select (select |c_#memory_$Pointer$#1.base| .cse29) 0) .cse31)))) (not (= .cse29 .cse0)))))))) (and .cse3 (or (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int)) (and (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| 0)) (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (and (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int)) (let ((.cse34 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse35 (select |c_#memory_int#1| .cse34))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (not (= .cse34 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select .cse35 4) 1) (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse36 (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|))) (let ((.cse37 (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| v_DerPreprocessor_2) .cse34 (store .cse36 0 (select .cse35 0))))) (and (= .cse36 (select .cse37 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select (select .cse37 .cse1) 4) 1))))) (not (= .cse1 .cse34)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse34) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse34) 0) (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= .cse34 .cse0)))))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int)) (let ((.cse38 (select .cse11 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse39 (select |c_#memory_int#1| .cse38))) (and (not (= .cse38 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse38) 0) 0) (not (= .cse1 .cse38)) (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#1.base| .cse38) 0)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= (select .cse39 4) 1) (exists ((v_DerPreprocessor_2 (Array Int Int))) (= (select (store (store |c_#memory_int#1| .cse1 v_DerPreprocessor_2) .cse38 (store .cse8 0 (select .cse39 0))) .cse1) .cse8)) (= (select .cse10 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0))))) (and (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse40 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| 0)) (= .cse40 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) (not (= .cse1 .cse40)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse40) 0) 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse40) 0) (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= .cse40 .cse0)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))))) .cse5)) .cse6) (and .cse3 (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse43 (select |c_#memory_int#1| .cse0))) (let ((.cse41 (store (store |c_#memory_int#1| .cse0 v_DerPreprocessor_2) .cse1 (store .cse43 0 (select .cse8 0)))) (.cse42 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= (select (select .cse41 .cse42) 4) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse42) 0) .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse42) 0) 0) (= (select .cse41 .cse0) .cse43) (= .cse42 .cse19) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) .cse5) (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int)) (and (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| 0)) (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int)) (let ((.cse44 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse45 (select |c_#memory_int#1| .cse44))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (not (= .cse44 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select .cse45 4) 1) (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse46 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse46) 0) .cse0) (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse47 (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|))) (let ((.cse48 (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| v_DerPreprocessor_2) .cse44 (store .cse47 0 (select .cse45 0))))) (and (= .cse47 (select .cse48 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select (select .cse48 .cse46) 4) 1))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse44) 0) (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse46) 0) 0) (= .cse1 .cse46) (= (select (select |c_#memory_$Pointer$#1.base| .cse44) 0) .cse46)))) (not (= .cse44 .cse0)))))))) (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int)) (let ((.cse49 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse50 (select |c_#memory_int#1| .cse49))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (not (= .cse49 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select .cse50 4) 1) (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse51 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse51) 0) .cse0) (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse52 (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|))) (let ((.cse53 (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| v_DerPreprocessor_2) .cse49 (store .cse52 0 (select .cse50 0))))) (and (= .cse52 (select .cse53 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select (select .cse53 .cse51) 4) 1))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse51) 0) 0) (= .cse1 .cse51) (= (select (select |c_#memory_$Pointer$#1.base| .cse49) 0) .cse51) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse49) 0) 0) (not (= .cse49 .cse0)))))) (and (or .cse54 (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int)) (and (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| 0)) (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse55 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse56 (select |c_#memory_int#1| .cse55))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse55) 0) (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= .cse55 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select .cse56 4) 1) (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse57 (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|))) (let ((.cse58 (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| v_DerPreprocessor_2) .cse55 (store .cse57 0 (select .cse56 0))))) (and (= .cse57 (select .cse58 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select (select .cse58 .cse1) 4) 1))))) (not (= .cse1 .cse55)) (= (select (select |c_#memory_$Pointer$#1.base| .cse55) 0) (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= .cse55 .cse0)))))))) .cse59) .cse3 .cse6) (and .cse3 .cse5 (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse60 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |c_#memory_$Pointer$#1.base| .cse60) 0)) (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| .cse60) (= (select (select |c_#memory_$Pointer$#1.offset| .cse60) 0) (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))))) .cse6) (and .cse3 (or (and (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse61 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse61) 0) (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| 0)) (= .cse61 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) (not (= .cse1 .cse61)) (= (select (select |c_#memory_$Pointer$#1.base| .cse61) 0) (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))))) .cse5) .cse62 (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int)) (and (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| .cse0)) (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse63 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse64 (select |c_#memory_int#1| .cse63))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse63) 0) (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= .cse63 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| 0)) (= (select .cse64 4) 1) (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse65 (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|))) (let ((.cse66 (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| v_DerPreprocessor_2) .cse63 (store .cse65 0 (select .cse64 0))))) (and (= .cse65 (select .cse66 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select (select .cse66 .cse1) 4) 1))))) (not (= .cse1 .cse63)) (= (select (select |c_#memory_$Pointer$#1.base| .cse63) 0) (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= .cse63 .cse0))))))))) .cse6) (and .cse3 (or .cse54 (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int)) (and (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| 0)) (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse67 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse68 (select |c_#memory_int#1| .cse67))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse67) 0) (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= .cse67 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select .cse68 4) 1) (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse69 (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|))) (let ((.cse70 (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| v_DerPreprocessor_2) .cse67 (store .cse69 0 (select .cse68 0))))) (and (= .cse69 (select .cse70 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select (select .cse70 .cse1) 4) 1))))) (not (= .cse1 .cse67)) (= (select (select |c_#memory_$Pointer$#1.base| .cse67) 0) (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= .cse67 .cse0)))))))) .cse59) .cse6) (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse75 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse71 (select |c_#memory_$Pointer$#1.base| .cse75))) (let ((.cse73 (select .cse71 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse72 (select |c_#memory_$Pointer$#1.offset| .cse75)) (.cse76 (select |c_#memory_int#1| .cse73))) (and (= (select .cse71 0) .cse0) (= (select .cse72 0) 0) (not (= .cse73 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse73) 0) (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (let ((.cse74 (select |c_#memory_int#1| .cse75))) (= .cse74 (select (store (store |c_#memory_int#1| .cse75 v_DerPreprocessor_2) .cse73 (store .cse74 0 (select .cse76 0))) .cse75))) (= (select .cse72 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (= (select .cse76 4) 1) (= .cse1 .cse75) (= .cse75 (select (select |c_#memory_$Pointer$#1.base| .cse73) 0)))))))) (and (or (and .cse5 (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse77 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse77) 0) (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= .cse77 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) (not (= .cse1 .cse77)) (= (select (select |c_#memory_$Pointer$#1.base| .cse77) 0) (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (exists ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| Int)) (and (not (= |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| .cse0)) (exists ((|ULTIMATE.start_sll_circular_append_~head#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| Int) (|ULTIMATE.start_sll_circular_append_~head#1.base| Int)) (let ((.cse78 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|))) (let ((.cse79 (select |c_#memory_int#1| .cse78))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse78) 0) (select (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= .cse78 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select .cse79 4) 1) (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse80 (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|))) (let ((.cse81 (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41| v_DerPreprocessor_2) .cse78 (store .cse80 0 (select .cse79 0))))) (and (= .cse80 (select .cse81 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_41|)) (= (select (select .cse81 .cse1) 4) 1))))) (not (= .cse1 .cse78)) (= (select (select |c_#memory_$Pointer$#1.base| .cse78) 0) (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= .cse78 .cse0)))))))) .cse62) .cse3 .cse6))) .cse4)))))))) is different from true [2023-12-19 17:12:42,105 WARN L293 SmtUtils]: Spent 1.68m on a formula simplification. DAG size of input: 2701 DAG size of output: 2695 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-19 17:12:42,106 INFO L349 Elim1Store]: treesize reduction 12, result has 99.8 percent of original size [2023-12-19 17:12:42,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 30 select indices, 30 select index equivalence classes, 0 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 435 case distinctions, treesize of input 4681 treesize of output 9769 [2023-12-19 17:12:43,667 INFO L224 Elim1Store]: Index analysis took 463 ms Received shutdown request... [2023-12-19 17:21:03,087 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-19 17:21:03,087 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-19 17:21:03,198 WARN L235 SmtUtils]: Removed 504 from assertion stack [2023-12-19 17:21:03,200 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 17:21:03,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-19 17:21:03,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-19 17:21:03,401 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 36 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7075 for 499491ms.. [2023-12-19 17:21:03,404 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-12-19 17:21:03,406 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 17:21:03,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:21:03 BoogieIcfgContainer [2023-12-19 17:21:03,407 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 17:21:03,407 INFO L158 Benchmark]: Toolchain (without parser) took 858659.94ms. Allocated memory was 248.5MB in the beginning and 621.8MB in the end (delta: 373.3MB). Free memory was 204.1MB in the beginning and 366.6MB in the end (delta: -162.5MB). Peak memory consumption was 376.8MB. Max. memory is 8.0GB. [2023-12-19 17:21:03,407 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 202.4MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 17:21:03,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.58ms. Allocated memory is still 248.5MB. Free memory was 204.1MB in the beginning and 185.9MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 17:21:03,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.59ms. Allocated memory is still 248.5MB. Free memory was 185.9MB in the beginning and 183.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 17:21:03,408 INFO L158 Benchmark]: Boogie Preprocessor took 46.50ms. Allocated memory is still 248.5MB. Free memory was 183.5MB in the beginning and 180.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 17:21:03,408 INFO L158 Benchmark]: RCFGBuilder took 406.02ms. Allocated memory is still 248.5MB. Free memory was 180.3MB in the beginning and 213.7MB in the end (delta: -33.4MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-19 17:21:03,408 INFO L158 Benchmark]: TraceAbstraction took 857824.59ms. Allocated memory was 248.5MB in the beginning and 621.8MB in the end (delta: 373.3MB). Free memory was 213.2MB in the beginning and 366.6MB in the end (delta: -153.4MB). Peak memory consumption was 385.3MB. Max. memory is 8.0GB. [2023-12-19 17:21:03,409 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.40ms. Allocated memory is still 202.4MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 320.58ms. Allocated memory is still 248.5MB. Free memory was 204.1MB in the beginning and 185.9MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.59ms. Allocated memory is still 248.5MB. Free memory was 185.9MB in the beginning and 183.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.50ms. Allocated memory is still 248.5MB. Free memory was 183.5MB in the beginning and 180.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 406.02ms. Allocated memory is still 248.5MB. Free memory was 180.3MB in the beginning and 213.7MB in the end (delta: -33.4MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 857824.59ms. Allocated memory was 248.5MB in the beginning and 621.8MB in the end (delta: 373.3MB). Free memory was 213.2MB in the beginning and 366.6MB in the end (delta: -153.4MB). Peak memory consumption was 385.3MB. 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: 639]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 639). Cancelled while NwaCegarLoop was analyzing trace of length 36 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7075 for 499491ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 857.8s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 414 SdHoareTripleChecker+Valid, 22.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 408 mSDsluCounter, 1928 SdHoareTripleChecker+Invalid, 22.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1772 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4283 IncrementalHoareTripleChecker+Invalid, 4369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 156 mSDtfsCounter, 4283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 581 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 395 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 4015 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=6, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 52 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 459 ConstructedInterpolants, 72 QuantifiedInterpolants, 11307 SizeOfPredicates, 151 NumberOfNonLiveVariables, 2390 ConjunctsInSsa, 741 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 92/194 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