java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 10:07:15,184 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 10:07:15,186 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 10:07:15,197 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 10:07:15,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 10:07:15,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 10:07:15,200 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 10:07:15,201 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 10:07:15,203 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 10:07:15,204 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 10:07:15,205 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 10:07:15,205 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 10:07:15,206 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 10:07:15,207 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 10:07:15,208 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 10:07:15,209 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 10:07:15,209 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 10:07:15,211 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 10:07:15,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 10:07:15,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 10:07:15,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 10:07:15,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 10:07:15,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 10:07:15,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 10:07:15,220 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 10:07:15,221 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 10:07:15,222 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 10:07:15,222 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 10:07:15,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 10:07:15,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 10:07:15,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 10:07:15,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 10:07:15,225 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 10:07:15,225 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 10:07:15,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 10:07:15,227 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 10:07:15,227 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-18 10:07:15,239 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 10:07:15,240 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 10:07:15,241 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 10:07:15,241 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 10:07:15,241 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 10:07:15,241 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 10:07:15,241 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 10:07:15,242 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 10:07:15,242 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 10:07:15,242 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 10:07:15,242 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 10:07:15,242 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 10:07:15,243 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 10:07:15,243 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 10:07:15,243 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 10:07:15,244 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 10:07:15,244 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 10:07:15,244 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 10:07:15,244 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 10:07:15,244 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 10:07:15,245 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 10:07:15,245 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 10:07:15,245 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 10:07:15,245 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 10:07:15,245 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 10:07:15,246 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 10:07:15,246 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 10:07:15,246 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 10:07:15,246 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 10:07:15,246 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 10:07:15,247 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 10:07:15,247 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 10:07:15,247 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 10:07:15,247 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 10:07:15,247 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 10:07:15,248 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 10:07:15,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 10:07:15,248 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 10:07:15,248 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 10:07:15,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 10:07:15,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 10:07:15,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 10:07:15,304 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 10:07:15,305 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 10:07:15,305 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl [2019-02-18 10:07:15,306 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2019-02-18 10:07:15,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 10:07:15,345 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 10:07:15,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 10:07:15,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 10:07:15,346 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 10:07:15,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:15" (1/1) ... [2019-02-18 10:07:15,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:15" (1/1) ... [2019-02-18 10:07:15,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 10:07:15,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 10:07:15,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 10:07:15,399 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 10:07:15,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:15" (1/1) ... [2019-02-18 10:07:15,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:15" (1/1) ... [2019-02-18 10:07:15,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:15" (1/1) ... [2019-02-18 10:07:15,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:15" (1/1) ... [2019-02-18 10:07:15,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:15" (1/1) ... [2019-02-18 10:07:15,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:15" (1/1) ... [2019-02-18 10:07:15,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:15" (1/1) ... [2019-02-18 10:07:15,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 10:07:15,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 10:07:15,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 10:07:15,422 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 10:07:15,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 10:07:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 10:07:15,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 10:07:15,881 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 10:07:15,881 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-02-18 10:07:15,882 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:07:15 BoogieIcfgContainer [2019-02-18 10:07:15,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 10:07:15,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 10:07:15,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 10:07:15,888 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 10:07:15,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:15" (1/2) ... [2019-02-18 10:07:15,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d99e736 and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 10:07:15, skipping insertion in model container [2019-02-18 10:07:15,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:07:15" (2/2) ... [2019-02-18 10:07:15,891 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2019-02-18 10:07:15,902 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 10:07:15,913 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-02-18 10:07:15,931 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-02-18 10:07:15,957 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 10:07:15,957 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 10:07:15,957 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 10:07:15,957 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 10:07:15,958 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 10:07:15,958 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 10:07:15,958 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 10:07:15,958 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 10:07:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-02-18 10:07:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 10:07:15,979 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:15,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 10:07:15,983 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:15,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:15,989 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-02-18 10:07:15,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:16,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:16,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:16,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:16,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:16,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:07:16,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 10:07:16,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:16,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:07:16,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:07:16,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:16,173 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-02-18 10:07:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:16,438 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-02-18 10:07:16,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:16,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 10:07:16,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:16,456 INFO L225 Difference]: With dead ends: 25 [2019-02-18 10:07:16,457 INFO L226 Difference]: Without dead ends: 20 [2019-02-18 10:07:16,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-18 10:07:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-02-18 10:07:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 10:07:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-02-18 10:07:16,497 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-02-18 10:07:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:16,498 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-02-18 10:07:16,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:07:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-02-18 10:07:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:07:16,499 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:16,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:07:16,500 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:16,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:16,500 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-02-18 10:07:16,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:16,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:16,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:16,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:16,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:16,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:16,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:16,683 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:07:16,685 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-02-18 10:07:16,755 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:16,756 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:28,103 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:07:28,104 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 10:07:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:28,110 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:07:28,617 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:07:39,811 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-18 10:07:39,812 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:07:39,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:07:39,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-18 10:07:39,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:39,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:07:39,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:07:39,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:39,817 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 3 states. [2019-02-18 10:08:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:58,331 INFO L93 Difference]: Finished difference Result 22 states and 35 transitions. [2019-02-18 10:08:58,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:08:58,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:08:58,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:58,333 INFO L225 Difference]: With dead ends: 22 [2019-02-18 10:08:58,334 INFO L226 Difference]: Without dead ends: 13 [2019-02-18 10:08:58,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:08:58,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-18 10:08:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-18 10:08:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 10:08:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2019-02-18 10:08:58,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 3 [2019-02-18 10:08:58,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:58,344 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 20 transitions. [2019-02-18 10:08:58,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:08:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 20 transitions. [2019-02-18 10:08:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:08:58,345 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:58,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:08:58,346 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:58,347 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-02-18 10:08:58,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:58,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:58,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:58,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:58,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:58,657 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-18 10:08:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:58,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:58,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:58,668 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:08:58,668 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-02-18 10:08:58,673 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:58,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:09:05,998 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:09:05,999 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 10:09:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:05,999 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:09:06,300 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:09:09,785 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-18 10:09:09,785 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:09:09,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:09:09,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-18 10:09:09,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:09:09,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:09:09,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:09:09,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:09:09,787 INFO L87 Difference]: Start difference. First operand 12 states and 20 transitions. Second operand 3 states. [2019-02-18 10:09:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:09:37,346 INFO L93 Difference]: Finished difference Result 23 states and 39 transitions. [2019-02-18 10:09:37,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:09:37,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:09:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:09:37,348 INFO L225 Difference]: With dead ends: 23 [2019-02-18 10:09:37,348 INFO L226 Difference]: Without dead ends: 14 [2019-02-18 10:09:37,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:09:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-18 10:09:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-18 10:09:37,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-18 10:09:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2019-02-18 10:09:37,355 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 30 transitions. Word has length 3 [2019-02-18 10:09:37,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:09:37,355 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 30 transitions. [2019-02-18 10:09:37,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:09:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 30 transitions. [2019-02-18 10:09:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:09:37,356 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:09:37,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:09:37,357 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:09:37,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 1 times [2019-02-18 10:09:37,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:09:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:37,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:37,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:09:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:37,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:37,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:09:37,405 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:09:37,405 INFO L207 CegarAbsIntRunner]: [0], [6], [23] [2019-02-18 10:09:37,406 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:09:37,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:09:45,430 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:09:45,430 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 10:09:45,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:45,431 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:09:45,831 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:09:56,360 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-18 10:09:56,360 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:09:56,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:09:56,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-18 10:09:56,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:09:56,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:09:56,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:09:56,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:09:56,362 INFO L87 Difference]: Start difference. First operand 14 states and 30 transitions. Second operand 3 states. [2019-02-18 10:11:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:11:28,517 INFO L93 Difference]: Finished difference Result 24 states and 44 transitions. [2019-02-18 10:11:28,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:11:28,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:11:28,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:11:28,518 INFO L225 Difference]: With dead ends: 24 [2019-02-18 10:11:28,518 INFO L226 Difference]: Without dead ends: 15 [2019-02-18 10:11:28,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:11:28,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-18 10:11:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-18 10:11:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-18 10:11:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 35 transitions. [2019-02-18 10:11:28,525 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 35 transitions. Word has length 3 [2019-02-18 10:11:28,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:11:28,525 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 35 transitions. [2019-02-18 10:11:28,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:11:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 35 transitions. [2019-02-18 10:11:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:11:28,525 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:11:28,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:11:28,526 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:11:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:11:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-02-18 10:11:28,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:11:28,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:11:28,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:11:28,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:11:28,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:11:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:11:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:11:28,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:11:28,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:11:28,590 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:11:28,590 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-02-18 10:11:28,592 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:11:28,593 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:11:35,052 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:11:35,053 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 10:11:35,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:11:35,053 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:11:35,331 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:11:45,468 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-18 10:11:45,468 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:11:45,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:11:45,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-18 10:11:45,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:11:45,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:11:45,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:11:45,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:11:45,470 INFO L87 Difference]: Start difference. First operand 15 states and 35 transitions. Second operand 3 states. [2019-02-18 10:13:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:13:07,412 INFO L93 Difference]: Finished difference Result 25 states and 49 transitions. [2019-02-18 10:13:07,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:13:07,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:13:07,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:13:07,413 INFO L225 Difference]: With dead ends: 25 [2019-02-18 10:13:07,413 INFO L226 Difference]: Without dead ends: 16 [2019-02-18 10:13:07,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:13:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-18 10:13:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-02-18 10:13:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 10:13:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-02-18 10:13:07,420 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-02-18 10:13:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:13:07,420 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-02-18 10:13:07,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:13:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-02-18 10:13:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:13:07,421 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:13:07,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:13:07,422 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:13:07,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash 30248, now seen corresponding path program 1 times [2019-02-18 10:13:07,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:13:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:07,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:13:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:07,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:13:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:07,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:07,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:13:07,498 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:13:07,498 INFO L207 CegarAbsIntRunner]: [0], [14], [23] [2019-02-18 10:13:07,499 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:13:07,499 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:13:13,561 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:13:13,562 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 10:13:13,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:13,562 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:13:13,869 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:13:24,687 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-18 10:13:24,688 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:13:24,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:13:24,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-18 10:13:24,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:13:24,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:13:24,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:13:24,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:13:24,689 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 3 states. [2019-02-18 10:14:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:14:45,103 INFO L93 Difference]: Finished difference Result 26 states and 54 transitions. [2019-02-18 10:14:45,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:14:45,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:14:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:14:45,104 INFO L225 Difference]: With dead ends: 26 [2019-02-18 10:14:45,104 INFO L226 Difference]: Without dead ends: 17 [2019-02-18 10:14:45,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:14:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-18 10:14:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-18 10:14:45,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 10:14:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 45 transitions. [2019-02-18 10:14:45,112 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 45 transitions. Word has length 3 [2019-02-18 10:14:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:14:45,113 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 45 transitions. [2019-02-18 10:14:45,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:14:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 45 transitions. [2019-02-18 10:14:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:14:45,113 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:14:45,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:14:45,114 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:14:45,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:14:45,114 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-02-18 10:14:45,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:14:45,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:14:45,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:14:45,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:14:45,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:14:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:14:45,458 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-02-18 10:14:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:14:45,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:14:45,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:14:45,485 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:14:45,486 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-02-18 10:14:45,487 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:14:45,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:15:04,894 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:15:04,894 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:15:04,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:15:04,895 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:15:05,428 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:15:20,421 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-18 10:15:20,422 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:15:20,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:15:20,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2019-02-18 10:15:20,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:15:20,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:15:20,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:15:20,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:15:20,423 INFO L87 Difference]: Start difference. First operand 17 states and 45 transitions. Second operand 3 states. [2019-02-18 10:16:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:16:29,008 INFO L93 Difference]: Finished difference Result 27 states and 59 transitions. [2019-02-18 10:16:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:16:29,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 10:16:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:16:29,009 INFO L225 Difference]: With dead ends: 27 [2019-02-18 10:16:29,010 INFO L226 Difference]: Without dead ends: 18 [2019-02-18 10:16:29,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:16:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-18 10:16:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-02-18 10:16:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 10:16:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-02-18 10:16:29,019 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 4 [2019-02-18 10:16:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:16:29,019 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-02-18 10:16:29,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:16:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-02-18 10:16:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:16:29,020 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:16:29,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:16:29,020 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:16:29,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:16:29,022 INFO L82 PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times [2019-02-18 10:16:29,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:16:29,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:16:29,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:16:29,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:16:29,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:16:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:16:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:16:29,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:16:29,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:16:29,129 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:16:29,130 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-02-18 10:16:29,131 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:16:29,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:16:48,980 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:16:48,981 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:16:48,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:16:48,981 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:16:49,443 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:16:54,577 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_501 Int) (v_idx_498 Int) (v_idx_505 Int) (v_idx_503 Int) (v_idx_509 Int) (v_idx_507 Int) (v_idx_495 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p4 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 1)) (.cse11 (+ c_ULTIMATE.start_main_p1 4)) (.cse12 (+ c_ULTIMATE.start_main_p2 3)) (.cse13 (+ c_ULTIMATE.start_main_p3 1)) (.cse10 (+ c_ULTIMATE.start_main_p1 1)) (.cse14 (+ c_ULTIMATE.start_main_p3 2)) (.cse1 (+ c_ULTIMATE.start_malloc_ptr 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_#memory_int| v_idx_509)) (<= .cse1 v_idx_509) (< v_idx_509 c_ULTIMATE.start_main_p5)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p5) (or (< v_idx_503 c_ULTIMATE.start_main_p2) (<= .cse2 v_idx_503) (= 0 (select |c_#memory_int| v_idx_503))) (or (< v_idx_495 c_ULTIMATE.start_main_p5) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_495)) (<= .cse1 v_idx_495)) (<= .cse0 c_ULTIMATE.start_main_p5) (let ((.cse5 (select |c_#memory_int| v_idx_501))) (let ((.cse7 (<= .cse10 v_idx_501)) (.cse4 (<= 0 (* 2 .cse5))) (.cse6 (<= 0 .cse5)) (.cse8 (< v_idx_501 c_ULTIMATE.start_main_p1))) (let ((.cse9 (or .cse7 (and .cse4 .cse6) .cse8))) (or (let ((.cse3 (select |c_#memory_int| v_idx_507))) (and (<= .cse3 0) (<= (* 2 .cse3) 0) (or (and .cse4 (<= .cse3 .cse5) .cse6) .cse7 .cse8))) (and .cse9 (< v_idx_507 c_ULTIMATE.start_main_p4)) (and .cse9 (<= .cse0 v_idx_507)))))) (<= .cse2 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= .cse11 c_ULTIMATE.start_main_p5) (<= .cse12 c_ULTIMATE.start_main_p5) (<= .cse13 c_ULTIMATE.start_main_p4) (<= .cse11 c_ULTIMATE.start_malloc_ptr) (<= .cse14 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p5 c_ULTIMATE.start_malloc_ptr) (<= .cse12 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_#memory_int| v_idx_505)) (<= .cse13 v_idx_505) (< v_idx_505 c_ULTIMATE.start_main_p3)) (<= .cse10 c_ULTIMATE.start_main_p2) (<= .cse14 c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (or (< v_idx_498 c_ULTIMATE.start_main_p5) (= 1 (select |c_#valid| v_idx_498)) (<= .cse1 v_idx_498))))) is different from false [2019-02-18 10:17:00,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_522 Int) (v_idx_512 Int) (v_idx_520 Int) (v_idx_515 Int) (v_idx_526 Int) (v_idx_524 Int) (v_idx_518 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p4 1)) (.cse11 (+ c_ULTIMATE.start_main_p2 1)) (.cse2 (+ c_ULTIMATE.start_main_p3 1)) (.cse12 (+ c_ULTIMATE.start_main_p1 4)) (.cse13 (+ c_ULTIMATE.start_main_p2 3)) (.cse0 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse10 (+ c_ULTIMATE.start_main_p1 1)) (.cse14 (+ c_ULTIMATE.start_main_p3 2))) (and (or (< v_idx_512 c_ULTIMATE.start_main_p5) (<= .cse0 v_idx_512) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_512) 0)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p5) (or (= (select |c_#memory_int| v_idx_522) 0) (< v_idx_522 c_ULTIMATE.start_main_p3) (<= .cse2 v_idx_522)) (<= .cse1 c_ULTIMATE.start_main_p5) (let ((.cse7 (select |c_#memory_int| v_idx_524))) (let ((.cse3 (<= .cse1 v_idx_524)) (.cse5 (<= .cse7 0)) (.cse6 (<= (* 2 .cse7) 0)) (.cse4 (< v_idx_524 c_ULTIMATE.start_main_p4))) (let ((.cse9 (or .cse3 (and .cse5 .cse6) .cse4))) (or (let ((.cse8 (select |c_#memory_int| v_idx_518))) (and (or .cse3 .cse4 (and .cse5 .cse6 (<= .cse7 .cse8))) (<= 0 .cse8) (<= 0 (* 2 .cse8)))) (and .cse9 (< v_idx_518 c_ULTIMATE.start_main_p1)) (and (<= .cse10 v_idx_518) .cse9))))) (<= .cse11 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (or (<= .cse0 v_idx_515) (= 1 (select |c_#valid| v_idx_515)) (< v_idx_515 c_ULTIMATE.start_main_p5)) (or (< v_idx_520 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_520) 0) (<= .cse11 v_idx_520)) (<= .cse12 c_ULTIMATE.start_main_p5) (<= .cse13 c_ULTIMATE.start_main_p5) (<= .cse2 c_ULTIMATE.start_main_p4) (<= .cse12 c_ULTIMATE.start_malloc_ptr) (<= .cse14 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p5 c_ULTIMATE.start_malloc_ptr) (<= .cse13 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_526 c_ULTIMATE.start_main_p5) (= (select |c_#memory_int| v_idx_526) 0) (<= .cse0 v_idx_526)) (<= .cse10 c_ULTIMATE.start_main_p2) (<= .cse14 c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4)))) is different from false [2019-02-18 10:17:06,112 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-18 10:17:06,113 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:17:06,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:17:06,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-02-18 10:17:06,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:17:06,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 10:17:06,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 10:17:06,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-18 10:17:06,114 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 5 states. [2019-02-18 10:17:21,004 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_522 Int) (v_idx_512 Int) (v_idx_520 Int) (v_idx_515 Int) (v_idx_526 Int) (v_idx_524 Int) (v_idx_518 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p4 1)) (.cse11 (+ c_ULTIMATE.start_main_p2 1)) (.cse2 (+ c_ULTIMATE.start_main_p3 1)) (.cse12 (+ c_ULTIMATE.start_main_p1 4)) (.cse13 (+ c_ULTIMATE.start_main_p2 3)) (.cse0 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse10 (+ c_ULTIMATE.start_main_p1 1)) (.cse14 (+ c_ULTIMATE.start_main_p3 2))) (and (or (< v_idx_512 c_ULTIMATE.start_main_p5) (<= .cse0 v_idx_512) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_512) 0)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p5) (or (= (select |c_#memory_int| v_idx_522) 0) (< v_idx_522 c_ULTIMATE.start_main_p3) (<= .cse2 v_idx_522)) (<= .cse1 c_ULTIMATE.start_main_p5) (let ((.cse7 (select |c_#memory_int| v_idx_524))) (let ((.cse3 (<= .cse1 v_idx_524)) (.cse5 (<= .cse7 0)) (.cse6 (<= (* 2 .cse7) 0)) (.cse4 (< v_idx_524 c_ULTIMATE.start_main_p4))) (let ((.cse9 (or .cse3 (and .cse5 .cse6) .cse4))) (or (let ((.cse8 (select |c_#memory_int| v_idx_518))) (and (or .cse3 .cse4 (and .cse5 .cse6 (<= .cse7 .cse8))) (<= 0 .cse8) (<= 0 (* 2 .cse8)))) (and .cse9 (< v_idx_518 c_ULTIMATE.start_main_p1)) (and (<= .cse10 v_idx_518) .cse9))))) (<= .cse11 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (or (<= .cse0 v_idx_515) (= 1 (select |c_#valid| v_idx_515)) (< v_idx_515 c_ULTIMATE.start_main_p5)) (or (< v_idx_520 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_520) 0) (<= .cse11 v_idx_520)) (<= .cse12 c_ULTIMATE.start_main_p5) (<= .cse13 c_ULTIMATE.start_main_p5) (<= .cse2 c_ULTIMATE.start_main_p4) (<= .cse12 c_ULTIMATE.start_malloc_ptr) (<= .cse14 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p5 c_ULTIMATE.start_malloc_ptr) (<= .cse13 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_526 c_ULTIMATE.start_main_p5) (= (select |c_#memory_int| v_idx_526) 0) (<= .cse0 v_idx_526)) (<= .cse10 c_ULTIMATE.start_main_p2) (<= .cse14 c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4)))) (forall ((v_idx_532 Int) (v_idx_543 Int) (v_idx_537 Int) (v_idx_535 Int) (v_idx_539 Int) (v_idx_529 Int) (v_idx_541 Int)) (let ((.cse22 (+ c_ULTIMATE.start_main_p4 1)) (.cse25 (+ c_ULTIMATE.start_main_p2 1)) (.cse26 (+ c_ULTIMATE.start_main_p1 4)) (.cse28 (+ c_ULTIMATE.start_main_p3 1)) (.cse27 (+ c_ULTIMATE.start_main_p2 3)) (.cse23 (+ c_ULTIMATE.start_main_p1 1)) (.cse24 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse29 (+ c_ULTIMATE.start_main_p3 2))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (let ((.cse17 (select |c_#memory_int| v_idx_535))) (let ((.cse18 (<= 0 .cse17)) (.cse19 (<= 0 (* 2 .cse17))) (.cse20 (< v_idx_535 c_ULTIMATE.start_main_p1)) (.cse21 (<= .cse23 v_idx_535))) (let ((.cse15 (or (and .cse18 .cse19) .cse20 .cse21))) (or (and (< v_idx_541 c_ULTIMATE.start_main_p4) .cse15) (let ((.cse16 (select |c_#memory_int| v_idx_541))) (and (<= (* 2 .cse16) 0) (<= .cse16 0) (or (and (<= .cse16 .cse17) .cse18 .cse19) .cse20 .cse21))) (and .cse15 (<= .cse22 v_idx_541)))))) (<= .cse22 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p5) (or (< v_idx_532 c_ULTIMATE.start_main_p5) (= 1 (select |c_#valid| v_idx_532)) (<= .cse24 v_idx_532)) (or (= (select |c_#memory_int| v_idx_537) 0) (< v_idx_537 c_ULTIMATE.start_main_p2) (<= .cse25 v_idx_537)) (<= .cse22 c_ULTIMATE.start_main_p5) (<= .cse25 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= .cse26 c_ULTIMATE.start_main_p5) (<= .cse27 c_ULTIMATE.start_main_p5) (<= .cse28 c_ULTIMATE.start_main_p4) (<= .cse26 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_539 c_ULTIMATE.start_main_p3) (<= .cse28 v_idx_539) (= (select |c_#memory_int| v_idx_539) 0)) (or (<= .cse24 v_idx_543) (< v_idx_543 c_ULTIMATE.start_main_p5) (= 0 (select |c_#memory_int| v_idx_543))) (<= .cse29 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p5 c_ULTIMATE.start_malloc_ptr) (<= .cse27 c_ULTIMATE.start_malloc_ptr) (<= .cse23 c_ULTIMATE.start_main_p2) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_529) 0) (< v_idx_529 c_ULTIMATE.start_main_p5) (<= .cse24 v_idx_529)) (<= .cse29 c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4)))) (forall ((v_idx_501 Int) (v_idx_498 Int) (v_idx_505 Int) (v_idx_503 Int) (v_idx_509 Int) (v_idx_507 Int) (v_idx_495 Int)) (let ((.cse30 (+ c_ULTIMATE.start_main_p4 1)) (.cse32 (+ c_ULTIMATE.start_main_p2 1)) (.cse41 (+ c_ULTIMATE.start_main_p1 4)) (.cse42 (+ c_ULTIMATE.start_main_p2 3)) (.cse43 (+ c_ULTIMATE.start_main_p3 1)) (.cse40 (+ c_ULTIMATE.start_main_p1 1)) (.cse44 (+ c_ULTIMATE.start_main_p3 2)) (.cse31 (+ c_ULTIMATE.start_malloc_ptr 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse30 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_#memory_int| v_idx_509)) (<= .cse31 v_idx_509) (< v_idx_509 c_ULTIMATE.start_main_p5)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p5) (or (< v_idx_503 c_ULTIMATE.start_main_p2) (<= .cse32 v_idx_503) (= 0 (select |c_#memory_int| v_idx_503))) (or (< v_idx_495 c_ULTIMATE.start_main_p5) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_495)) (<= .cse31 v_idx_495)) (<= .cse30 c_ULTIMATE.start_main_p5) (let ((.cse35 (select |c_#memory_int| v_idx_501))) (let ((.cse37 (<= .cse40 v_idx_501)) (.cse34 (<= 0 (* 2 .cse35))) (.cse36 (<= 0 .cse35)) (.cse38 (< v_idx_501 c_ULTIMATE.start_main_p1))) (let ((.cse39 (or .cse37 (and .cse34 .cse36) .cse38))) (or (let ((.cse33 (select |c_#memory_int| v_idx_507))) (and (<= .cse33 0) (<= (* 2 .cse33) 0) (or (and .cse34 (<= .cse33 .cse35) .cse36) .cse37 .cse38))) (and .cse39 (< v_idx_507 c_ULTIMATE.start_main_p4)) (and .cse39 (<= .cse30 v_idx_507)))))) (<= .cse32 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= .cse41 c_ULTIMATE.start_main_p5) (<= .cse42 c_ULTIMATE.start_main_p5) (<= .cse43 c_ULTIMATE.start_main_p4) (<= .cse41 c_ULTIMATE.start_malloc_ptr) (<= .cse44 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_main_p5 c_ULTIMATE.start_malloc_ptr) (<= .cse42 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_#memory_int| v_idx_505)) (<= .cse43 v_idx_505) (< v_idx_505 c_ULTIMATE.start_main_p3)) (<= .cse40 c_ULTIMATE.start_main_p2) (<= .cse44 c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (or (< v_idx_498 c_ULTIMATE.start_main_p5) (= 1 (select |c_#valid| v_idx_498)) (<= .cse31 v_idx_498)))))) is different from false