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/sum02.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:44:45,395 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:44:45,398 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:44:45,410 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:44:45,410 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:44:45,411 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:44:45,413 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:44:45,415 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:44:45,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:44:45,418 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:44:45,419 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:44:45,420 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:44:45,421 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:44:45,424 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:44:45,426 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:44:45,429 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:44:45,430 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:44:45,435 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:44:45,443 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:44:45,445 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:44:45,448 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:44:45,453 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:44:45,459 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:44:45,459 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:44:45,459 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:44:45,460 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:44:45,461 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:44:45,462 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:44:45,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:44:45,467 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:44:45,467 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:44:45,469 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:44:45,469 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:44:45,470 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:44:45,471 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:44:45,471 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:44:45,471 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:44:45,496 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:44:45,496 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:44:45,497 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:44:45,497 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:44:45,497 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:44:45,498 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:44:45,498 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:44:45,498 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:44:45,498 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:44:45,498 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:44:45,499 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:44:45,499 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:44:45,500 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:44:45,500 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:44:45,500 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:44:45,501 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:44:45,501 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:44:45,501 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:44:45,501 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:44:45,501 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:44:45,503 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:44:45,503 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:44:45,504 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:44:45,504 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:44:45,504 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:44:45,504 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:44:45,504 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:44:45,505 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:44:45,505 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:44:45,505 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:44:45,505 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:44:45,505 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:44:45,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:44:45,506 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:44:45,506 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:44:45,506 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:44:45,506 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:44:45,506 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:44:45,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:44:45,508 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:44:45,508 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:44:45,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:44:45,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:44:45,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:44:45,572 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:44:45,573 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:44:45,574 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum02.i_3.bpl [2018-12-03 16:44:45,574 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum02.i_3.bpl' [2018-12-03 16:44:45,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:44:45,625 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:44:45,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:44:45,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:44:45,626 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:44:45,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:45" (1/1) ... [2018-12-03 16:44:45,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:45" (1/1) ... [2018-12-03 16:44:45,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:44:45,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:44:45,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:44:45,668 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:44:45,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:45" (1/1) ... [2018-12-03 16:44:45,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:45" (1/1) ... [2018-12-03 16:44:45,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:45" (1/1) ... [2018-12-03 16:44:45,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:45" (1/1) ... [2018-12-03 16:44:45,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:45" (1/1) ... [2018-12-03 16:44:45,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:45" (1/1) ... [2018-12-03 16:44:45,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:45" (1/1) ... [2018-12-03 16:44:45,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:44:45,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:44:45,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:44:45,702 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:44:45,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:45" (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:44:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:44:45,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:44:45,983 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:44:45,983 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:44:45,984 INFO L202 PluginConnector]: Adding new model sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:44:45 BoogieIcfgContainer [2018-12-03 16:44:45,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:44:45,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:44:45,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:44:45,988 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:44:45,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:45" (1/2) ... [2018-12-03 16:44:45,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e3df4f and model type sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:44:45, skipping insertion in model container [2018-12-03 16:44:45,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:44:45" (2/2) ... [2018-12-03 16:44:45,992 INFO L112 eAbstractionObserver]: Analyzing ICFG sum02.i_3.bpl [2018-12-03 16:44:46,002 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:44:46,010 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:44:46,029 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:44:46,073 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:44:46,073 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:44:46,073 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:44:46,074 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:44:46,074 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:44:46,074 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:44:46,074 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:44:46,075 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:44:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:44:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:44:46,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:46,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:44:46,109 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:46,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:46,116 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 16:44:46,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:46,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:46,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:46,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:46,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:46,206 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:44:46,206 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:44:46,207 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 16:44:46,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:46,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:44:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:46,249 INFO L193 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-12-03 16:44:46,251 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:44:46,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:46,251 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:44:46,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:46,263 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:44:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:46,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:46,341 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:44:46,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:46,484 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2018-12-03 16:44:46,485 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:44:46,521 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:44:46,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2018-12-03 16:44:46,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:44:46,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:44:46,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:44:46,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:44:46,548 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:44:46,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:46,592 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 16:44:46,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:44:46,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:44:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:46,606 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:44:46,606 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:44:46,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:44:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:44:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:44:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:44:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 16:44:46,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 16:44:46,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:46,650 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 16:44:46,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:44:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 16:44:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:44:46,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:46,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:44:46,651 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:46,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:46,652 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 16:44:46,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:46,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:46,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:46,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:46,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:46,668 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:44:46,668 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:44:46,668 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 16:44:46,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:46,688 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:44:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:46,716 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:44:46,719 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 16:44:46,769 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:44:46,770 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:44:47,073 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:44:47,075 INFO L272 AbstractInterpreter]: Visited 4 different actions 11 times. Merged at 3 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:44:47,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:47,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:44:47,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:47,122 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:44:47,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:47,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:44:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:47,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:47,436 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:44:47,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:47,641 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:44:47,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:44:47,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-12-03 16:44:47,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:47,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:44:47,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:44:47,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:44:47,663 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2018-12-03 16:44:47,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:47,734 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 16:44:47,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:44:47,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-03 16:44:47,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:47,735 INFO L225 Difference]: With dead ends: 8 [2018-12-03 16:44:47,735 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:44:47,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:44:47,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:44:47,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:44:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:44:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:44:47,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 16:44:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:47,741 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:44:47,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:44:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:44:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:44:47,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:47,742 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:44:47,742 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:47,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 16:44:47,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:47,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:47,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:47,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:47,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:47,757 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:44:47,757 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:44:47,758 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 16:44:47,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:47,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:44:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:47,818 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:47,818 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:44:47,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:47,819 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:44:47,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:44:47,829 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:44:47,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:44:47,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:47,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:48,140 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:44:48,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:50,441 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-12-03 16:44:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:54,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:44:54,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-03 16:44:54,811 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:54,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:44:54,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:44:54,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=32, Unknown=2, NotChecked=0, Total=56 [2018-12-03 16:44:54,814 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2018-12-03 16:45:21,962 WARN L180 SmtUtils]: Spent 24.79 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-03 16:45:23,968 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-03 16:45:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:24,053 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2018-12-03 16:45:24,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:45:24,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-03 16:45:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:24,056 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:45:24,056 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:45:24,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=38, Invalid=49, Unknown=3, NotChecked=0, Total=90 [2018-12-03 16:45:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:45:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:45:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:45:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 16:45:24,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2018-12-03 16:45:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:24,061 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 16:45:24,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:45:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 16:45:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:45:24,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:24,062 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 16:45:24,062 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:24,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:24,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 3 times [2018-12-03 16:45:24,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:24,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:24,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:24,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:24,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:24,084 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:45:24,084 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:45:24,085 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 16:45:24,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:24,095 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:45:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:24,187 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:24,188 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:45:24,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:24,188 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:45:24,198 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:45:24,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:45:24,304 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:45:24,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:45:24,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:24,743 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-12-03 16:45:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:24,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:27,023 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-12-03 16:45:30,910 WARN L180 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-12-03 16:45:45,536 WARN L180 SmtUtils]: Spent 14.30 s on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-03 16:46:00,141 WARN L180 SmtUtils]: Spent 8.91 s on a formula simplification that was a NOOP. DAG size: 37 [2018-12-03 16:46:02,177 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse1 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse0 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296))) (or (<= (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) .cse0) (= (mod (div (mod (* .cse0 (+ .cse0 1)) 18446744073709551616) 2) 18446744073709551616) (mod (+ .cse1 .cse2 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) c_ULTIMATE.start_main_~sn~6 .cse3 .cse4) 18446744073709551616)) (< .cse0 .cse1) (< .cse0 .cse4) (< .cse0 .cse3) (< .cse0 .cse2)))) (= 0 (mod (+ (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) c_ULTIMATE.start_main_~sn~6 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616))) is different from true [2018-12-03 16:46:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 1 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-03 16:46:02,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:46:02,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-12-03 16:46:02,199 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:02,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:46:02,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:46:02,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=141, Unknown=2, NotChecked=26, Total=240 [2018-12-03 16:46:02,200 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 16 states. [2018-12-03 16:46:06,245 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse3 (mod c_ULTIMATE.start_main_~n~6 4294967296)) (.cse7 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296))) (let ((.cse5 (< .cse3 .cse7)) (.cse10 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse9 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse4 (< .cse3 .cse6)) (.cse0 (mod (div (mod (* .cse3 (+ .cse3 1)) 18446744073709551616) 2) 18446744073709551616))) (and (let ((.cse1 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6 .cse7) 18446744073709551616))) (or (= .cse0 .cse1) (<= .cse2 .cse3) .cse4 .cse5 (= 0 .cse1))) (let ((.cse8 (mod (+ .cse6 .cse9 c_ULTIMATE.start_main_~sn~6 .cse7 .cse2) 18446744073709551616))) (or (= .cse8 .cse0) (= .cse8 0) (< .cse3 .cse9) .cse4 (<= .cse10 .cse3))) (let ((.cse11 (mod (+ .cse6 .cse9 .cse10 c_ULTIMATE.start_main_~sn~6 .cse7 .cse2) 18446744073709551616))) (or (= 0 .cse11) .cse4 (< .cse3 .cse10) (= .cse0 .cse11) .cse5 (<= (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296) .cse3))) (let ((.cse12 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6 .cse7 .cse2) 18446744073709551616))) (or (<= .cse9 .cse3) (= 0 .cse12) .cse4 (= .cse0 .cse12) (< .cse3 .cse2))) (let ((.cse13 (mod c_ULTIMATE.start_main_~sn~6 18446744073709551616))) (or (= .cse13 .cse0) (= .cse13 0) (<= .cse6 .cse3))) (let ((.cse14 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6) 18446744073709551616))) (or .cse4 (<= .cse7 .cse3) (= .cse0 .cse14) (= 0 .cse14)))))) is different from true [2018-12-03 16:46:38,121 WARN L180 SmtUtils]: Spent 28.39 s on a formula simplification that was a NOOP. DAG size: 59 [2018-12-03 16:47:07,672 WARN L180 SmtUtils]: Spent 19.08 s on a formula simplification that was a NOOP. DAG size: 49 [2018-12-03 16:47:16,607 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 39 [2018-12-03 16:47:27,997 WARN L180 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-03 16:48:14,130 WARN L180 SmtUtils]: Spent 40.91 s on a formula simplification that was a NOOP. DAG size: 64 [2018-12-03 16:48:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:48:14,187 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-12-03 16:48:14,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:48:14,191 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 9 [2018-12-03 16:48:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:48:14,192 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:48:14,192 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:48:14,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 151.2s TimeCoverageRelationStatistics Valid=142, Invalid=235, Unknown=11, NotChecked=74, Total=462 [2018-12-03 16:48:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:48:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 16:48:14,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:48:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 16:48:14,201 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 9 [2018-12-03 16:48:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:48:14,202 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 16:48:14,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:48:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 16:48:14,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:48:14,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:48:14,203 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 16:48:14,203 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:48:14,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:48:14,204 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 4 times [2018-12-03 16:48:14,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:48:14,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:14,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:48:14,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:14,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:48:14,243 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:48:14,244 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:48:14,244 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 16:48:14,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:48:14,257 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:48:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:48:14,639 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:48:14,639 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:48:14,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:14,640 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:48:14,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:48:14,654 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:48:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-03 16:48:26,782 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-12-03 16:48:26,783 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 16:48:26,804 WARN L228 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-12-03 16:48:26,804 INFO L202 PluginConnector]: Adding new model sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:48:26 BoogieIcfgContainer [2018-12-03 16:48:26,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:48:26,805 INFO L168 Benchmark]: Toolchain (without parser) took 221182.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 362.2 MB). Peak memory consumption was 362.2 MB. Max. memory is 7.1 GB. [2018-12-03 16:48:26,806 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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:48:26,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.56 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:48:26,807 INFO L168 Benchmark]: Boogie Preprocessor took 27.97 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:48:26,808 INFO L168 Benchmark]: RCFGBuilder took 283.06 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:48:26,809 INFO L168 Benchmark]: TraceAbstraction took 220819.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 341.0 MB). Peak memory consumption was 341.0 MB. Max. memory is 7.1 GB. [2018-12-03 16:48:26,813 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.21 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 41.56 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 27.97 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 283.06 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 220819.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 341.0 MB). Peak memory consumption was 341.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 46]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L14] havoc main_#res; [L15] havoc main_#t~nondet0, main_#t~post1, main_~i~6, main_~n~6, main_~sn~6, main_~nl~6, main_~gauss~6; [L16] havoc main_~i~6; [L17] main_~n~6 := main_#t~nondet0; [L18] havoc main_#t~nondet0; [L19] main_~sn~6 := 0; [L20] assume main_~n~6 % 4294967296 % 18446744073709551616 < 4294967296; [L21] main_~i~6 := 0; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L29] assume !(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L30] main_~nl~6 := main_~n~6 % 4294967296; [L31] main_~gauss~6 := (if main_~nl~6 * (main_~nl~6 + 1) % 18446744073709551616 < 0 && main_~nl~6 * (main_~nl~6 + 1) % 18446744073709551616 % 2 != 0 then main_~nl~6 * (main_~nl~6 + 1) % 18446744073709551616 / 2 + 1 else main_~nl~6 * (main_~nl~6 + 1) % 18446744073709551616 / 2); [L32] __VERIFIER_assert_#in~cond := (if main_~sn~6 % 18446744073709551616 == main_~gauss~6 % 18446744073709551616 || main_~sn~6 % 18446744073709551616 == 0 then 1 else 0); [L33] havoc __VERIFIER_assert_~cond; [L34] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L35] assume __VERIFIER_assert_~cond == 0; [L36] assume !false; [L46] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNKNOWN Result, 220.7s OverallTime, 5 OverallIterations, 13 TraceHistogramMax, 161.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 6 SDslu, 10 SDs, 0 SdLazy, 96 SolverSat, 24 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 18.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 187.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 12.6s SatisfiabilityAnalysisTime, 45.4s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 34 ConstructedInterpolants, 3 QuantifiedInterpolants, 5915 SizeOfPredicates, 27 NumberOfNonLiveVariables, 129 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/50 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...