/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/sll2c_append_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:42:39,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:42:39,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:42:39,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:42:39,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:42:39,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:42:39,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:42:39,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:42:39,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:42:39,251 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:42:39,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:42:39,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:42:39,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:42:39,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:42:39,253 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:42:39,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:42:39,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:42:39,254 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:42:39,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:42:39,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:42:39,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:42:39,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:42:39,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:42:39,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:42:39,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:42:39,255 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:42:39,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:42:39,255 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:42:39,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:42:39,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:42:39,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:42:39,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:42:39,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:42:39,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:42:39,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:42:39,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:42:39,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:42:39,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:42:39,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:42:39,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:42:39,257 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:42:39,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:42:39,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:42:39,258 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:42:39,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:42:39,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:42:39,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:42:39,444 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:42:39,444 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:42:39,445 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-16 04:42:40,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:42:40,613 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:42:40,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_append_equal.i [2023-12-16 04:42:40,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2801871aa/f04b7db43e4644618482ed3c885e0dd0/FLAG6b30c106b [2023-12-16 04:42:40,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2801871aa/f04b7db43e4644618482ed3c885e0dd0 [2023-12-16 04:42:40,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:42:40,637 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:42:40,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:42:40,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:42:40,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:42:40,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:42:40" (1/1) ... [2023-12-16 04:42:40,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ddb2352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40, skipping insertion in model container [2023-12-16 04:42:40,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:42:40" (1/1) ... [2023-12-16 04:42:40,684 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:42:40,886 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-16 04:42:40,890 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:42:40,900 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:42:40,927 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-16 04:42:40,927 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:42:40,945 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:42:40,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40 WrapperNode [2023-12-16 04:42:40,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:42:40,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:42:40,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:42:40,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:42:40,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40" (1/1) ... [2023-12-16 04:42:40,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40" (1/1) ... [2023-12-16 04:42:41,013 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2023-12-16 04:42:41,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:42:41,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:42:41,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:42:41,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:42:41,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40" (1/1) ... [2023-12-16 04:42:41,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40" (1/1) ... [2023-12-16 04:42:41,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40" (1/1) ... [2023-12-16 04:42:41,061 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-16 04:42:41,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40" (1/1) ... [2023-12-16 04:42:41,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40" (1/1) ... [2023-12-16 04:42:41,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40" (1/1) ... [2023-12-16 04:42:41,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40" (1/1) ... [2023-12-16 04:42:41,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40" (1/1) ... [2023-12-16 04:42:41,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40" (1/1) ... [2023-12-16 04:42:41,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:42:41,080 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:42:41,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:42:41,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:42:41,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40" (1/1) ... [2023-12-16 04:42:41,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:42:41,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:42:41,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 04:42:41,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 04:42:41,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:42:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:42:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:42:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:42:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:42:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:42:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-16 04:42:41,147 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-16 04:42:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 04:42:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:42:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 04:42:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 04:42:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 04:42:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-16 04:42:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 04:42:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 04:42:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-16 04:42:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 04:42:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-16 04:42:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-16 04:42:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-16 04:42:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:42:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:42:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:42:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:42:41,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:42:41,260 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:42:41,262 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:42:41,399 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:42:41,432 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:42:41,432 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-16 04:42:41,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:42:41 BoogieIcfgContainer [2023-12-16 04:42:41,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:42:41,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:42:41,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:42:41,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:42:41,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:42:40" (1/3) ... [2023-12-16 04:42:41,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdffd2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:42:41, skipping insertion in model container [2023-12-16 04:42:41,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:42:40" (2/3) ... [2023-12-16 04:42:41,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdffd2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:42:41, skipping insertion in model container [2023-12-16 04:42:41,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:42:41" (3/3) ... [2023-12-16 04:42:41,438 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-12-16 04:42:41,450 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:42:41,451 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:42:41,484 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:42:41,488 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;@161267a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:42:41,488 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:42:41,490 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-16 04:42:41,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 04:42:41,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:41,496 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:41,496 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:41,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash 383461057, now seen corresponding path program 1 times [2023-12-16 04:42:41,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:41,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13180463] [2023-12-16 04:42:41,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:41,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:41,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:42:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:41,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:42:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:41,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:42:41,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:41,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13180463] [2023-12-16 04:42:41,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13180463] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:42:41,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:42:41,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:42:41,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386761718] [2023-12-16 04:42:41,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:42:41,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:42:41,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:41,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:42:41,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:42:41,824 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-16 04:42:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:41,881 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2023-12-16 04:42:41,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:42:41,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-12-16 04:42:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:41,887 INFO L225 Difference]: With dead ends: 54 [2023-12-16 04:42:41,887 INFO L226 Difference]: Without dead ends: 23 [2023-12-16 04:42:41,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:42:41,892 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-16 04:42:41,893 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-16 04:42:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-16 04:42:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-16 04:42:41,922 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-16 04:42:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-16 04:42:41,924 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2023-12-16 04:42:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:41,925 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-16 04:42:41,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:42:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-16 04:42:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 04:42:41,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:41,927 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:42:41,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:42:41,929 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:41,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:41,930 INFO L85 PathProgramCache]: Analyzing trace with hash -391035257, now seen corresponding path program 1 times [2023-12-16 04:42:41,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:41,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612089463] [2023-12-16 04:42:41,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:41,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:42,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:42:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:42,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:42:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:42:42,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:42,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612089463] [2023-12-16 04:42:42,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612089463] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:42:42,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:42:42,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:42:42,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079872931] [2023-12-16 04:42:42,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:42:42,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:42:42,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:42,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:42:42,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:42:42,130 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-16 04:42:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:42:42,164 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2023-12-16 04:42:42,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:42:42,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-12-16 04:42:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:42:42,166 INFO L225 Difference]: With dead ends: 43 [2023-12-16 04:42:42,166 INFO L226 Difference]: Without dead ends: 26 [2023-12-16 04:42:42,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:42:42,168 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-16 04:42:42,168 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-16 04:42:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-16 04:42:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-12-16 04:42:42,176 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-16 04:42:42,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-12-16 04:42:42,177 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 18 [2023-12-16 04:42:42,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:42:42,177 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-12-16 04:42:42,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:42:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-12-16 04:42:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 04:42:42,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:42:42,179 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-16 04:42:42,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:42:42,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:42:42,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:42:42,180 INFO L85 PathProgramCache]: Analyzing trace with hash 620466046, now seen corresponding path program 1 times [2023-12-16 04:42:42,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:42:42,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499394683] [2023-12-16 04:42:42,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:42,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:42:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:42,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:42:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:42,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:42:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:42,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:42:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 04:42:42,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:42:42,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499394683] [2023-12-16 04:42:42,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499394683] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:42:42,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623175312] [2023-12-16 04:42:42,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:42:42,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:42:42,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:42:42,532 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:42:42,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:42:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:42:42,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 04:42:42,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:42:42,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-16 04:42:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:42:42,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:42:42,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-16 04:42:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 04:42:42,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623175312] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:42:42,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:42:42,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2023-12-16 04:42:42,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238427722] [2023-12-16 04:42:42,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:42:42,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 04:42:42,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:42:42,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 04:42:42,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-12-16 04:42:42,966 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-16 04:42:46,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:42:50,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:42:55,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:42:59,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:43:03,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:43:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:03,231 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-12-16 04:43:03,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 04:43:03,232 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-16 04:43:03,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:03,232 INFO L225 Difference]: With dead ends: 36 [2023-12-16 04:43:03,233 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 04:43:03,233 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-16 04:43:03,234 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-16 04:43:03,234 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-16 04:43:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 04:43:03,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-12-16 04:43:03,237 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-16 04:43:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-12-16 04:43:03,238 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 24 [2023-12-16 04:43:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:03,238 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-12-16 04:43:03,238 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-16 04:43:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-12-16 04:43:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 04:43:03,239 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:03,239 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-16 04:43:03,248 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-16 04:43:03,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:03,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:03,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash 724565085, now seen corresponding path program 1 times [2023-12-16 04:43:03,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:03,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404862789] [2023-12-16 04:43:03,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:03,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:04,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:04,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:04,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:43:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:43:04,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:04,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404862789] [2023-12-16 04:43:04,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404862789] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:04,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393635712] [2023-12-16 04:43:04,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:04,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:04,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:04,206 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:43:04,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:43:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:04,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 105 conjunts are in the unsatisfiable core [2023-12-16 04:43:04,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:04,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-16 04:43:04,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:04,682 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-16 04:43:04,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-16 04:43:04,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 04:43:04,794 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-16 04:43:04,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:43:04,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-16 04:43:05,002 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-16 04:43:05,002 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-16 04:43:05,012 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-16 04:43:05,219 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-16 04:43:05,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-16 04:43:05,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 04:43:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:43:05,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:05,460 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-16 04:43:05,487 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-16 04:43:05,496 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-16 04:43:05,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393635712] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:05,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:43:05,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 37 [2023-12-16 04:43:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993429495] [2023-12-16 04:43:05,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:05,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-16 04:43:05,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:05,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-16 04:43:05,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1533, Unknown=3, NotChecked=240, Total=1892 [2023-12-16 04:43:05,590 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-16 04:43:06,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:06,466 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2023-12-16 04:43:06,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 04:43:06,467 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-16 04:43:06,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:06,467 INFO L225 Difference]: With dead ends: 39 [2023-12-16 04:43:06,467 INFO L226 Difference]: Without dead ends: 31 [2023-12-16 04:43:06,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=251, Invalid=2728, Unknown=3, NotChecked=324, Total=3306 [2023-12-16 04:43:06,469 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-16 04:43:06,469 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-16 04:43:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-16 04:43:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-12-16 04:43:06,473 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-16 04:43:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-12-16 04:43:06,474 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 27 [2023-12-16 04:43:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:06,474 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-12-16 04:43:06,474 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-16 04:43:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-12-16 04:43:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 04:43:06,475 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:06,475 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:06,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:43:06,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-16 04:43:06,683 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:06,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:06,684 INFO L85 PathProgramCache]: Analyzing trace with hash 80578008, now seen corresponding path program 1 times [2023-12-16 04:43:06,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:06,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364991100] [2023-12-16 04:43:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:06,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:07,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:07,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:07,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:43:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:07,959 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-16 04:43:07,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:07,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364991100] [2023-12-16 04:43:07,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364991100] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:07,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353641337] [2023-12-16 04:43:07,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:07,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:07,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:07,962 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:43:07,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 04:43:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:08,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 125 conjunts are in the unsatisfiable core [2023-12-16 04:43:08,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:08,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-16 04:43:08,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:08,482 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-16 04:43:08,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-16 04:43:08,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:08,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 04:43:08,632 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-16 04:43:08,638 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-16 04:43:08,729 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-16 04:43:08,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:43:08,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-16 04:43:08,883 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-16 04:43:08,883 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-16 04:43:08,890 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-16 04:43:08,897 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-16 04:43:09,212 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-16 04:43:09,223 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-16 04:43:09,327 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-16 04:43:09,338 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-16 04:43:09,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 04:43:09,472 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-16 04:43:09,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:09,864 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-16 04:43:09,885 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-16 04:43:09,903 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-16 04:43:09,918 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-16 04:43:10,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353641337] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:10,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:43:10,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2023-12-16 04:43:10,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403969104] [2023-12-16 04:43:10,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:10,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-16 04:43:10,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:10,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-16 04:43:10,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2090, Unknown=8, NotChecked=282, Total=2550 [2023-12-16 04:43:10,062 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-16 04:43:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:11,000 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2023-12-16 04:43:11,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 04:43:11,001 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2023-12-16 04:43:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:11,001 INFO L225 Difference]: With dead ends: 45 [2023-12-16 04:43:11,001 INFO L226 Difference]: Without dead ends: 43 [2023-12-16 04:43:11,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=320, Invalid=3590, Unknown=8, NotChecked=372, Total=4290 [2023-12-16 04:43:11,003 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-16 04:43:11,003 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-16 04:43:11,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-16 04:43:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2023-12-16 04:43:11,008 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-16 04:43:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-12-16 04:43:11,008 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 29 [2023-12-16 04:43:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:11,008 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-12-16 04:43:11,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 04:43:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-12-16 04:43:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 04:43:11,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:11,009 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-16 04:43:11,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 04:43:11,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:11,229 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:11,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:11,230 INFO L85 PathProgramCache]: Analyzing trace with hash 127932368, now seen corresponding path program 1 times [2023-12-16 04:43:11,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:11,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871568629] [2023-12-16 04:43:11,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:11,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:12,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:12,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:43:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:12,323 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-16 04:43:12,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:12,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871568629] [2023-12-16 04:43:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871568629] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:12,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191508900] [2023-12-16 04:43:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:12,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:12,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:43:12,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 04:43:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:12,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-16 04:43:12,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:12,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-16 04:43:12,653 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-16 04:43:12,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-16 04:43:12,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:12,745 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-16 04:43:12,746 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-16 04:43:12,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-16 04:43:12,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:43:12,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:43:12,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-12-16 04:43:12,943 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-16 04:43:12,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-16 04:43:13,091 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-12-16 04:43:13,091 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-16 04:43:13,110 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-12-16 04:43:13,111 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-16 04:43:13,123 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-16 04:43:13,180 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-16 04:43:13,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:43:13,220 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-16 04:43:13,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-16 04:43:13,226 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-16 04:43:13,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:13,424 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-16 04:43:13,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191508900] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:13,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:43:13,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2023-12-16 04:43:13,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53161014] [2023-12-16 04:43:13,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:13,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-16 04:43:13,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:13,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-16 04:43:13,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1498, Unknown=27, NotChecked=78, Total=1722 [2023-12-16 04:43:13,427 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-16 04:43:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:14,487 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2023-12-16 04:43:14,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-16 04:43:14,487 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-16 04:43:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:14,488 INFO L225 Difference]: With dead ends: 80 [2023-12-16 04:43:14,488 INFO L226 Difference]: Without dead ends: 77 [2023-12-16 04:43:14,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=264, Invalid=3019, Unknown=27, NotChecked=112, Total=3422 [2023-12-16 04:43:14,489 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-16 04:43:14,489 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-16 04:43:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-16 04:43:14,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2023-12-16 04:43:14,498 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-16 04:43:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2023-12-16 04:43:14,499 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 31 [2023-12-16 04:43:14,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:14,499 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2023-12-16 04:43:14,499 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-16 04:43:14,499 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2023-12-16 04:43:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 04:43:14,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:14,500 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-16 04:43:14,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 04:43:14,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:14,705 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:14,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:14,706 INFO L85 PathProgramCache]: Analyzing trace with hash -315712365, now seen corresponding path program 2 times [2023-12-16 04:43:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:14,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687158375] [2023-12-16 04:43:14,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:14,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:15,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:15,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:15,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:43:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:15,608 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-16 04:43:15,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:15,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687158375] [2023-12-16 04:43:15,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687158375] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:15,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230371454] [2023-12-16 04:43:15,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:43:15,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:15,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:15,610 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:43:15,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 04:43:15,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:43:15,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:43:15,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 141 conjunts are in the unsatisfiable core [2023-12-16 04:43:15,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:15,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-16 04:43:15,890 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-16 04:43:16,070 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-16 04:43:16,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-16 04:43:16,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 04:43:16,129 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-16 04:43:16,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:16,235 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-16 04:43:16,235 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-16 04:43:16,247 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-16 04:43:16,303 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-16 04:43:16,303 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-16 04:43:16,311 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-16 04:43:16,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:43:16,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:43:16,456 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-16 04:43:16,457 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-16 04:43:16,473 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-16 04:43:16,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-16 04:43:16,480 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-16 04:43:16,927 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-16 04:43:16,928 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-16 04:43:16,947 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-16 04:43:16,954 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:43:16,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:43:16,995 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-16 04:43:16,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:17,236 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-16 04:43:17,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230371454] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:17,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:43:17,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 37 [2023-12-16 04:43:17,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290596442] [2023-12-16 04:43:17,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:17,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-16 04:43:17,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:17,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-16 04:43:17,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1588, Unknown=1, NotChecked=80, Total=1806 [2023-12-16 04:43:17,240 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-16 04:43:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:18,007 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2023-12-16 04:43:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 04:43:18,007 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-16 04:43:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:18,008 INFO L225 Difference]: With dead ends: 69 [2023-12-16 04:43:18,008 INFO L226 Difference]: Without dead ends: 56 [2023-12-16 04:43:18,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=254, Invalid=2505, Unknown=1, NotChecked=102, Total=2862 [2023-12-16 04:43:18,009 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-16 04:43:18,009 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-16 04:43:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-16 04:43:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2023-12-16 04:43:18,015 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-16 04:43:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2023-12-16 04:43:18,016 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 31 [2023-12-16 04:43:18,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:18,016 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2023-12-16 04:43:18,016 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-16 04:43:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2023-12-16 04:43:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 04:43:18,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:18,017 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:18,025 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-16 04:43:18,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:18,223 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:18,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:18,223 INFO L85 PathProgramCache]: Analyzing trace with hash -329022723, now seen corresponding path program 1 times [2023-12-16 04:43:18,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:18,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53522105] [2023-12-16 04:43:18,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:18,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:19,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:19,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:19,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:43:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:20,126 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-16 04:43:20,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:20,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53522105] [2023-12-16 04:43:20,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53522105] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:20,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872160065] [2023-12-16 04:43:20,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:20,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:20,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:20,128 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-16 04:43:20,130 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-16 04:43:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:20,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 160 conjunts are in the unsatisfiable core [2023-12-16 04:43:20,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:20,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-16 04:43:20,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:20,734 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-16 04:43:20,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-16 04:43:20,767 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-16 04:43:20,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-16 04:43:20,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:20,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:20,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 04:43:20,939 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-16 04:43:20,940 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-16 04:43:20,949 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-16 04:43:20,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:43:20,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2023-12-16 04:43:21,014 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-16 04:43:21,018 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-16 04:43:21,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-16 04:43:21,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:43:21,131 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-16 04:43:21,232 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 04:43:21,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-16 04:43:21,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:43:21,251 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-16 04:43:21,267 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-16 04:43:21,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2023-12-16 04:43:21,293 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-16 04:43:21,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-16 04:43:21,810 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-12-16 04:43:21,811 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-16 04:43:21,834 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-12-16 04:43:21,835 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-16 04:43:21,850 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-16 04:43:21,850 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-16 04:43:21,867 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-16 04:43:21,867 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-16 04:43:21,874 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-16 04:43:21,919 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-16 04:43:21,924 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-16 04:43:21,928 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-16 04:43:22,090 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-16 04:43:22,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:43:22,346 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-16 04:43:22,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:43:22,354 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-16 04:43:22,593 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-16 04:43:22,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:22,720 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-16 04:43:22,753 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-16 04:43:22,772 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-16 04:43:22,784 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-16 04:43:22,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:43:22,886 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-16 04:43:22,907 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-16 04:43:22,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872160065] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:22,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:43:22,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2023-12-16 04:43:22,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469503154] [2023-12-16 04:43:22,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:22,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-16 04:43:22,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:22,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-16 04:43:22,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2124, Unknown=5, NotChecked=480, Total=2756 [2023-12-16 04:43:22,911 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-16 04:43:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:24,739 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2023-12-16 04:43:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 04:43:24,740 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-16 04:43:24,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:24,741 INFO L225 Difference]: With dead ends: 66 [2023-12-16 04:43:24,741 INFO L226 Difference]: Without dead ends: 64 [2023-12-16 04:43:24,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=288, Invalid=3887, Unknown=5, NotChecked=650, Total=4830 [2023-12-16 04:43:24,742 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.7s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:24,742 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.7s Time] [2023-12-16 04:43:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-16 04:43:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2023-12-16 04:43:24,752 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-16 04:43:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2023-12-16 04:43:24,753 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 32 [2023-12-16 04:43:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:24,753 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2023-12-16 04:43:24,753 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-16 04:43:24,753 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2023-12-16 04:43:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 04:43:24,754 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:24,754 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-16 04:43:24,760 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-16 04:43:24,962 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-16 04:43:24,962 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:24,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:24,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1638621109, now seen corresponding path program 1 times [2023-12-16 04:43:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:24,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814013121] [2023-12-16 04:43:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:26,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:26,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:26,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:43:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:26,338 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-16 04:43:26,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:26,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814013121] [2023-12-16 04:43:26,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814013121] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:26,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995326970] [2023-12-16 04:43:26,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:26,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:26,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:26,340 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-16 04:43:26,362 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-16 04:43:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:26,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-16 04:43:26,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:26,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-16 04:43:26,877 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-16 04:43:26,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-16 04:43:26,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:26,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:27,004 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-16 04:43:27,005 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-16 04:43:27,009 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-16 04:43:27,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-16 04:43:27,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:43:27,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-16 04:43:27,231 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 04:43:27,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-16 04:43:27,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:43:27,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-12-16 04:43:27,267 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-16 04:43:27,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-16 04:43:27,609 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-16 04:43:27,609 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-16 04:43:27,628 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-12-16 04:43:27,629 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-16 04:43:27,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:43:27,634 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-16 04:43:27,715 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:43:27,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:43:27,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-16 04:43:27,873 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-16 04:43:27,879 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-16 04:43:27,879 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-16 04:43:27,892 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-16 04:43:27,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:27,927 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 ((.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| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (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| |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| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| 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-16 04:43:27,951 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-16 04:43:27,960 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-16 04:43:27,966 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-16 04:43:28,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995326970] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:28,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:43:28,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 44 [2023-12-16 04:43:28,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861974843] [2023-12-16 04:43:28,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:28,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-16 04:43:28,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:28,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-16 04:43:28,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1862, Unknown=4, NotChecked=356, Total=2352 [2023-12-16 04:43:28,115 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-16 04:43:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:29,714 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2023-12-16 04:43:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-16 04:43:29,715 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-16 04:43:29,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:29,716 INFO L225 Difference]: With dead ends: 72 [2023-12-16 04:43:29,716 INFO L226 Difference]: Without dead ends: 69 [2023-12-16 04:43:29,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=349, Invalid=4633, Unknown=4, NotChecked=564, Total=5550 [2023-12-16 04:43:29,718 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 102 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:29,718 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.6s Time] [2023-12-16 04:43:29,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-16 04:43:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2023-12-16 04:43:29,727 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-16 04:43:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2023-12-16 04:43:29,728 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 34 [2023-12-16 04:43:29,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:29,728 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2023-12-16 04:43:29,728 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-16 04:43:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2023-12-16 04:43:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 04:43:29,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:29,729 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-16 04:43:29,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-16 04:43:29,935 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-16 04:43:29,936 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:29,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:29,936 INFO L85 PathProgramCache]: Analyzing trace with hash -742312008, now seen corresponding path program 2 times [2023-12-16 04:43:29,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:29,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161353856] [2023-12-16 04:43:29,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:29,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:31,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:31,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:31,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:43:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:32,013 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-16 04:43:32,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:32,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161353856] [2023-12-16 04:43:32,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161353856] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:32,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951638105] [2023-12-16 04:43:32,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:43:32,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:32,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:32,015 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-16 04:43:32,015 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-16 04:43:32,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:43:32,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:43:32,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 176 conjunts are in the unsatisfiable core [2023-12-16 04:43:32,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:32,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-16 04:43:32,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:32,515 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-16 04:43:32,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-16 04:43:32,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 04:43:32,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 04:43:32,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:32,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:32,688 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-16 04:43:32,689 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-16 04:43:32,692 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-16 04:43:32,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2023-12-16 04:43:32,796 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-16 04:43:32,796 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-16 04:43:32,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:43:32,806 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-16 04:43:32,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-16 04:43:32,939 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-16 04:43:33,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:43:33,041 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-16 04:43:33,042 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-16 04:43:33,065 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2023-12-16 04:43:33,065 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-16 04:43:33,089 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-16 04:43:33,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-16 04:43:33,099 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-16 04:43:33,701 INFO L349 Elim1Store]: treesize reduction 108, result has 43.2 percent of original size [2023-12-16 04:43:33,701 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-16 04:43:33,773 INFO L349 Elim1Store]: treesize reduction 118, result has 36.2 percent of original size [2023-12-16 04:43:33,774 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-16 04:43:33,813 INFO L349 Elim1Store]: treesize reduction 79, result has 31.3 percent of original size [2023-12-16 04:43:33,813 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-16 04:43:33,823 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-16 04:43:33,872 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:43:33,872 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-16 04:43:33,884 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:43:33,886 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-16 04:43:33,893 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-16 04:43:36,107 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2023-12-16 04:43:36,107 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-16 04:43:36,115 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-16 04:43:36,119 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-16 04:43:36,123 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 Received shutdown request... [2023-12-16 04:43:43,941 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-16 04:43:43,968 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 04:43:44,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:43:44,747 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-16 04:43:44,945 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-16 04:43:44,945 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 36 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. [2023-12-16 04:43:44,948 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:44,950 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:43:44,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:43:44 BoogieIcfgContainer [2023-12-16 04:43:44,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:43:44,953 INFO L158 Benchmark]: Toolchain (without parser) took 64315.49ms. Allocated memory was 209.7MB in the beginning and 631.2MB in the end (delta: 421.5MB). Free memory was 152.8MB in the beginning and 560.1MB in the end (delta: -407.3MB). Peak memory consumption was 357.1MB. Max. memory is 8.0GB. [2023-12-16 04:43:44,953 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 156.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:43:44,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.79ms. Allocated memory is still 209.7MB. Free memory was 152.6MB in the beginning and 134.3MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 04:43:44,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.63ms. Allocated memory is still 209.7MB. Free memory was 134.3MB in the beginning and 178.6MB in the end (delta: -44.3MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. [2023-12-16 04:43:44,953 INFO L158 Benchmark]: Boogie Preprocessor took 65.74ms. Allocated memory is still 209.7MB. Free memory was 178.6MB in the beginning and 175.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:43:44,953 INFO L158 Benchmark]: RCFGBuilder took 352.69ms. Allocated memory is still 209.7MB. Free memory was 175.4MB in the beginning and 156.0MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 04:43:44,954 INFO L158 Benchmark]: TraceAbstraction took 63518.02ms. Allocated memory was 209.7MB in the beginning and 631.2MB in the end (delta: 421.5MB). Free memory was 155.0MB in the beginning and 560.1MB in the end (delta: -405.1MB). Peak memory consumption was 358.2MB. Max. memory is 8.0GB. [2023-12-16 04:43:44,958 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 156.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.79ms. Allocated memory is still 209.7MB. Free memory was 152.6MB in the beginning and 134.3MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.63ms. Allocated memory is still 209.7MB. Free memory was 134.3MB in the beginning and 178.6MB in the end (delta: -44.3MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.74ms. Allocated memory is still 209.7MB. Free memory was 178.6MB in the beginning and 175.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 352.69ms. Allocated memory is still 209.7MB. Free memory was 175.4MB in the beginning and 156.0MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 63518.02ms. Allocated memory was 209.7MB in the beginning and 631.2MB in the end (delta: 421.5MB). Free memory was 155.0MB in the beginning and 560.1MB in the end (delta: -405.1MB). Peak memory consumption was 358.2MB. 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.5s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 414 SdHoareTripleChecker+Valid, 22.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 408 mSDsluCounter, 1928 SdHoareTripleChecker+Invalid, 22.5s 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, 17 IntricatePredicates, 0 DeprecatedPredicates, 4026 ImplicationChecksByTransitivity, 11.7s 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, 1.0s SatisfiabilityAnalysisTime, 17.3s 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