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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/underapprox2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:46:16,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:46:16,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:46:16,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:46:16,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:46:16,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:46:16,138 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:46:16,140 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:46:16,141 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:46:16,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:46:16,144 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:46:16,144 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:46:16,145 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:46:16,146 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:46:16,149 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:46:16,150 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:46:16,151 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:46:16,158 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:46:16,160 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:46:16,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:46:16,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:46:16,164 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:46:16,167 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:46:16,167 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:46:16,167 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:46:16,168 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:46:16,169 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:46:16,170 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:46:16,173 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:46:16,174 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:46:16,174 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:46:16,175 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:46:16,175 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:46:16,176 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:46:16,176 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:46:16,177 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:46:16,177 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:46:16,195 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:46:16,195 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:46:16,196 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:46:16,196 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:46:16,196 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:46:16,196 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:46:16,197 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:46:16,197 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:46:16,197 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:46:16,197 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:46:16,197 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:46:16,198 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:46:16,198 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:46:16,198 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:46:16,198 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:46:16,199 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:46:16,199 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:46:16,200 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:46:16,200 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:46:16,200 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:46:16,200 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:46:16,201 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:46:16,201 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:46:16,201 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:46:16,201 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:46:16,201 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:46:16,202 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:46:16,202 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:46:16,202 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:46:16,202 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:46:16,203 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:46:16,203 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:46:16,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:46:16,203 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:46:16,203 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:46:16,204 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:46:16,204 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:46:16,204 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:46:16,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:46:16,204 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:46:16,205 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:46:16,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:46:16,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:46:16,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:46:16,282 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:46:16,283 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:46:16,283 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/underapprox2.i_3.bpl [2018-12-03 16:46:16,284 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/underapprox2.i_3.bpl' [2018-12-03 16:46:16,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:46:16,323 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:46:16,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:46:16,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:46:16,324 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:46:16,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:16" (1/1) ... [2018-12-03 16:46:16,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:16" (1/1) ... [2018-12-03 16:46:16,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:46:16,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:46:16,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:46:16,361 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:46:16,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:16" (1/1) ... [2018-12-03 16:46:16,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:16" (1/1) ... [2018-12-03 16:46:16,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:16" (1/1) ... [2018-12-03 16:46:16,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:16" (1/1) ... [2018-12-03 16:46:16,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:16" (1/1) ... [2018-12-03 16:46:16,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:16" (1/1) ... [2018-12-03 16:46:16,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:16" (1/1) ... [2018-12-03 16:46:16,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:46:16,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:46:16,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:46:16,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:46:16,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:16" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:46:16,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:46:16,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:46:16,703 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:46:16,703 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:46:16,705 INFO L202 PluginConnector]: Adding new model underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:46:16 BoogieIcfgContainer [2018-12-03 16:46:16,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:46:16,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:46:16,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:46:16,710 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:46:16,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:16" (1/2) ... [2018-12-03 16:46:16,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2622de03 and model type underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:46:16, skipping insertion in model container [2018-12-03 16:46:16,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:46:16" (2/2) ... [2018-12-03 16:46:16,713 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox2.i_3.bpl [2018-12-03 16:46:16,723 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:46:16,733 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:46:16,750 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:46:16,781 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:46:16,782 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:46:16,782 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:46:16,782 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:46:16,782 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:46:16,783 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:46:16,783 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:46:16,783 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:46:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:46:16,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:46:16,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:16,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:46:16,811 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:16,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 16:46:16,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:16,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:16,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:16,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:16,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:17,135 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-03 16:46:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:17,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:46:17,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:46:17,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:17,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:17,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:17,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:17,167 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:46:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:17,209 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 16:46:17,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:17,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:46:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:17,223 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:46:17,223 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:46:17,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:46:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:46:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:46:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 16:46:17,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 16:46:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:17,261 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 16:46:17,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 16:46:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:46:17,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:17,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:46:17,262 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:17,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:17,262 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 16:46:17,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:17,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:17,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:17,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:17,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:17,634 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-03 16:46:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:17,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:17,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:17,636 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:46:17,638 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 16:46:17,678 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:46:17,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:46:17,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:46:17,862 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:46:17,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:17,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:46:17,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:17,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:46:17,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:17,913 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:46:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:17,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:17,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:18,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:18,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 16:46:18,097 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:18,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:46:18,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:46:18,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:46:18,100 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 16:46:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:18,152 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 16:46:18,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:46:18,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 16:46:18,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:18,153 INFO L225 Difference]: With dead ends: 8 [2018-12-03 16:46:18,153 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:46:18,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:46:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:46:18,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:46:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:46:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:46:18,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 16:46:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:18,158 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:46:18,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:46:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:46:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:46:18,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:18,159 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:46:18,160 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:18,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 16:46:18,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:18,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:18,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:18,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:18,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:18,481 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 16:46:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:18,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:18,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:18,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:18,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:46:18,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:18,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:46:18,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:46:18,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:46:18,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:46:18,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:46:18,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:18,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:18,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:18,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-03 16:46:18,744 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:18,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:46:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:46:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:46:18,746 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 16:46:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:18,782 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 16:46:18,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:46:18,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 16:46:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:18,783 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:46:18,784 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:46:18,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:46:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:46:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:46:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:46:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 16:46:18,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 16:46:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:18,789 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 16:46:18,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:46:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 16:46:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:46:18,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:18,790 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 16:46:18,790 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:18,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:18,791 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 16:46:18,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:18,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:18,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:46:18,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:18,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:19,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:19,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:19,042 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:19,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:46:19,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:19,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:46:19,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:46:19,054 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:46:19,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:46:19,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:46:19,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:19,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:19,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:19,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 16:46:19,345 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:19,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:46:19,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:46:19,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:46:19,347 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 16:46:19,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:19,386 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 16:46:19,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:46:19,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 16:46:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:19,387 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:46:19,387 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:46:19,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:46:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:46:19,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:46:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:46:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 16:46:19,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 16:46:19,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:19,392 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 16:46:19,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:46:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 16:46:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:46:19,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:19,392 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 16:46:19,393 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:19,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:19,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 16:46:19,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:19,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:19,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:46:19,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:19,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:19,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:19,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:19,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:19,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:46:19,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:19,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:46:19,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:19,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:46:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:19,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:19,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:20,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:20,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 16:46:20,032 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:20,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:46:20,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:46:20,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:46:20,033 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 16:46:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:20,102 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 16:46:20,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:46:20,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 16:46:20,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:20,105 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:46:20,105 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:46:20,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:46:20,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:46:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:46:20,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:46:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 16:46:20,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 16:46:20,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:20,109 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 16:46:20,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:46:20,110 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 16:46:20,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:46:20,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:20,110 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 16:46:20,111 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:20,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:20,111 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 16:46:20,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:20,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:20,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:20,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:20,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:20,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:20,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:20,265 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:20,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:46:20,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:20,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:46:20,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:46:20,280 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:46:20,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:46:20,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:46:20,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:20,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:20,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:20,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 16:46:20,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:20,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:46:20,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:46:20,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:46:20,511 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 16:46:20,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:20,580 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 16:46:20,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:46:20,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 16:46:20,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:20,582 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:46:20,582 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:46:20,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:46:20,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:46:20,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:46:20,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:46:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 16:46:20,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 16:46:20,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:20,586 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 16:46:20,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:46:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 16:46:20,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:46:20,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:20,587 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 16:46:20,587 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:20,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:20,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 16:46:20,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:20,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:20,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:46:20,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:20,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 16:46:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 16:46:20,710 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 16:46:20,739 INFO L202 PluginConnector]: Adding new model underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:46:20 BoogieIcfgContainer [2018-12-03 16:46:20,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:46:20,741 INFO L168 Benchmark]: Toolchain (without parser) took 4419.38 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.3 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -723.2 MB). Peak memory consumption was 241.3 MB. Max. memory is 7.1 GB. [2018-12-03 16:46:20,742 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:46:20,743 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:46:20,744 INFO L168 Benchmark]: Boogie Preprocessor took 21.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:46:20,744 INFO L168 Benchmark]: RCFGBuilder took 323.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 16:46:20,746 INFO L168 Benchmark]: TraceAbstraction took 4033.78 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -744.4 MB). Peak memory consumption was 220.2 MB. Max. memory is 7.1 GB. [2018-12-03 16:46:20,755 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 323.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4033.78 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -744.4 MB). Peak memory consumption was 220.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 36]: assertion can be violated assertion can be violated We found a FailurePath: [L10] havoc main_#res; [L11] havoc main_#t~post0, main_~x~4, main_~y~4; [L12] main_~x~4 := 0; [L13] main_~y~4 := 1; VAL [main_~x~4=0, main_~y~4=1] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=1, main_~y~4=2] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=2, main_~y~4=4] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=3, main_~y~4=8] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=4, main_~y~4=16] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=5, main_~y~4=32] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=6, main_~y~4=64] [L21] assume !(main_~x~4 % 4294967296 < 6); [L22] __VERIFIER_assert_#in~cond := (if main_~x~4 % 4294967296 != 6 then 1 else 0); [L23] havoc __VERIFIER_assert_~cond; [L24] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L25] assume __VERIFIER_assert_~cond == 0; [L26] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~4=6, main_~y~4=64] [L36] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~4=6, main_~y~4=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 3.9s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 0 SDslu, 15 SDs, 0 SdLazy, 121 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 2569 SizeOfPredicates, 15 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/105 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...