java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:47:07,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:47:07,325 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:47:07,339 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:47:07,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:47:07,341 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:47:07,342 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:47:07,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:47:07,345 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:47:07,346 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:47:07,347 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:47:07,348 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:47:07,348 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:47:07,349 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:47:07,351 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:47:07,353 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:47:07,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:47:07,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:47:07,361 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:47:07,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:47:07,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:47:07,367 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:47:07,369 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:47:07,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:47:07,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:47:07,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:47:07,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:47:07,373 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:47:07,373 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:47:07,374 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:47:07,374 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:47:07,375 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:47:07,375 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:47:07,375 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:47:07,376 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:47:07,377 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:47:07,377 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 18:47:07,394 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:47:07,394 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:47:07,395 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:47:07,395 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:47:07,396 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:47:07,396 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:47:07,396 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:47:07,396 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:47:07,396 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:47:07,399 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 18:47:07,400 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:47:07,400 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:47:07,400 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:47:07,400 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:47:07,401 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:47:07,401 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:47:07,401 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:47:07,402 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:47:07,402 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:47:07,402 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:47:07,404 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:47:07,404 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:47:07,404 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:47:07,405 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:47:07,405 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:47:07,405 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:47:07,405 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:47:07,405 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:47:07,406 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:47:07,406 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:47:07,406 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:47:07,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:47:07,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:47:07,406 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:47:07,407 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:47:07,407 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:47:07,407 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:47:07,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:47:07,407 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:47:07,408 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:47:07,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:47:07,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:47:07,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:47:07,462 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:47:07,463 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:47:07,464 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-12-03 18:47:07,464 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl' [2018-12-03 18:47:07,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:47:07,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:47:07,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:47:07,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:47:07,500 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:47:07,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:07" (1/1) ... [2018-12-03 18:47:07,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:07" (1/1) ... [2018-12-03 18:47:07,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:47:07,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:47:07,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:47:07,536 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:47:07,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:07" (1/1) ... [2018-12-03 18:47:07,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:07" (1/1) ... [2018-12-03 18:47:07,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:07" (1/1) ... [2018-12-03 18:47:07,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:07" (1/1) ... [2018-12-03 18:47:07,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:07" (1/1) ... [2018-12-03 18:47:07,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:07" (1/1) ... [2018-12-03 18:47:07,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:07" (1/1) ... [2018-12-03 18:47:07,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:47:07,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:47:07,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:47:07,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:47:07,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:07" (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 18:47:07,628 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 18:47:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:47:07,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:47:07,966 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:47:07,966 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 18:47:07,967 INFO L202 PluginConnector]: Adding new model down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:47:07 BoogieIcfgContainer [2018-12-03 18:47:07,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:47:07,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:47:07,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:47:07,974 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:47:07,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:07" (1/2) ... [2018-12-03 18:47:07,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bd20aa and model type down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:47:07, skipping insertion in model container [2018-12-03 18:47:07,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:47:07" (2/2) ... [2018-12-03 18:47:07,979 INFO L112 eAbstractionObserver]: Analyzing ICFG down.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-12-03 18:47:07,989 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:47:08,000 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:47:08,018 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:47:08,061 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:47:08,062 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:47:08,062 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:47:08,062 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:47:08,062 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:47:08,063 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:47:08,063 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:47:08,063 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:47:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-12-03 18:47:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:47:08,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:08,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:47:08,095 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:08,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:08,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1951930377, now seen corresponding path program 1 times [2018-12-03 18:47:08,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:08,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:08,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:08,269 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 18:47:08,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:47:08,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:47:08,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:47:08,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:47:08,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:47:08,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:47:08,297 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-12-03 18:47:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:08,444 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2018-12-03 18:47:08,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:47:08,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-03 18:47:08,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:08,457 INFO L225 Difference]: With dead ends: 23 [2018-12-03 18:47:08,457 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 18:47:08,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:47:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 18:47:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-12-03 18:47:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 18:47:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-03 18:47:08,495 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 7 [2018-12-03 18:47:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:08,495 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-03 18:47:08,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:47:08,496 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2018-12-03 18:47:08,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:47:08,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:08,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:47:08,497 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:08,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:08,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1951989959, now seen corresponding path program 1 times [2018-12-03 18:47:08,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:08,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:08,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:08,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:08,561 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 18:47:08,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:47:08,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:47:08,562 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:47:08,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:47:08,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:47:08,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:47:08,565 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 4 states. [2018-12-03 18:47:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:08,641 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-12-03 18:47:08,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:47:08,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 18:47:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:08,642 INFO L225 Difference]: With dead ends: 20 [2018-12-03 18:47:08,643 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 18:47:08,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:47:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 18:47:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 18:47:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 18:47:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-12-03 18:47:08,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 7 [2018-12-03 18:47:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:08,649 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-03 18:47:08,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:47:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2018-12-03 18:47:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:47:08,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:08,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:47:08,650 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:08,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:08,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1455783312, now seen corresponding path program 1 times [2018-12-03 18:47:08,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:08,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:08,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:08,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:08,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:47:08,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:47:08,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 18:47:08,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:47:08,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:47:08,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:47:08,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:47:08,727 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 4 states. [2018-12-03 18:47:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:08,815 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-12-03 18:47:08,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:47:08,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 18:47:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:08,817 INFO L225 Difference]: With dead ends: 19 [2018-12-03 18:47:08,817 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 18:47:08,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:47:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 18:47:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-12-03 18:47:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 18:47:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-03 18:47:08,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2018-12-03 18:47:08,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:08,823 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-03 18:47:08,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:47:08,824 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-03 18:47:08,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:47:08,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:08,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:47:08,825 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:08,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:08,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1455723730, now seen corresponding path program 1 times [2018-12-03 18:47:08,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:08,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:08,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:08,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:08,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:47:08,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:47:08,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:47:08,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:47:08,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:47:08,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:47:08,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:47:08,871 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2018-12-03 18:47:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:08,918 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-12-03 18:47:08,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:47:08,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 18:47:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:08,919 INFO L225 Difference]: With dead ends: 25 [2018-12-03 18:47:08,919 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 18:47:08,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:47:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 18:47:08,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-12-03 18:47:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 18:47:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-12-03 18:47:08,927 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2018-12-03 18:47:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:08,927 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-03 18:47:08,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:47:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-12-03 18:47:08,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:47:08,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:08,928 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:47:08,928 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:08,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:08,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1394403420, now seen corresponding path program 1 times [2018-12-03 18:47:08,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:08,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:08,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:08,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:08,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:47:09,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:09,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:09,107 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-03 18:47:09,109 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [13], [15], [17], [21], [23], [25] [2018-12-03 18:47:09,166 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:47:09,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:47:09,563 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:47:09,565 INFO L272 AbstractInterpreter]: Visited 9 different actions 62 times. Merged at 6 different actions 34 times. Widened at 4 different actions 9 times. Found 6 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:47:09,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:09,607 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:47:09,691 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 59.79% of their original sizes. [2018-12-03 18:47:09,692 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:47:10,013 INFO L418 sIntCurrentIteration]: We unified 11 AI predicates to 11 [2018-12-03 18:47:10,014 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:47:10,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:47:10,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 13 [2018-12-03 18:47:10,015 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:47:10,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:47:10,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:47:10,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:47:10,018 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 10 states. [2018-12-03 18:47:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:11,059 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-12-03 18:47:11,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:47:11,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-12-03 18:47:11,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:11,061 INFO L225 Difference]: With dead ends: 17 [2018-12-03 18:47:11,061 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 18:47:11,062 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:47:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 18:47:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 18:47:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 18:47:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 18:47:11,063 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-12-03 18:47:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:11,065 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 18:47:11,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:47:11,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 18:47:11,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 18:47:11,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 18:47:11,225 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-12-03 18:47:11,987 WARN L180 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2018-12-03 18:47:12,305 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 18 [2018-12-03 18:47:12,415 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 18 [2018-12-03 18:47:12,726 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 33 [2018-12-03 18:47:12,915 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 33 [2018-12-03 18:47:12,921 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 77) no Hoare annotation was computed. [2018-12-03 18:47:12,922 INFO L444 ceAbstractionStarter]: At program point L60(lines 60 66) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start___VERIFIER_assert_#in~cond|))) (and (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start___VERIFIER_assert_~cond ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start___VERIFIER_assert_~cond 2147483646)) (<= .cse0 2) (<= 2 .cse0) (<= (* 2 ULTIMATE.start___VERIFIER_assert_~cond) 2))) [2018-12-03 18:47:12,922 INFO L444 ceAbstractionStarter]: At program point L56(lines 52 57) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start___VERIFIER_assert_#in~cond|))) (let ((.cse1 (<= .cse4 2)) (.cse2 (<= 2 .cse4)) (.cse3 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5))) (or (let ((.cse0 (* 2 ULTIMATE.start___VERIFIER_assert_~cond))) (and (<= .cse0 2) .cse1 .cse2 (<= 2 .cse0) .cse3 (<= ULTIMATE.start___VERIFIER_assert_~cond ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start___VERIFIER_assert_~cond 2147483646)))) (and (<= (* 2 ULTIMATE.start_main_~n~5) 4294967294) (<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5) .cse1 .cse2 (<= (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) 4294967294) (<= 2 (* 2 ULTIMATE.start_main_~j~5)) .cse3 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start_main_~n~5 2147483648)))))) [2018-12-03 18:47:12,922 INFO L444 ceAbstractionStarter]: At program point L46(lines 46 53) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5))) (or (and (<= (* 2 ULTIMATE.start_main_~n~5) 4294967294) (<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) 4294967294) (<= 2 (* 2 ULTIMATE.start_main_~j~5)) .cse0 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start_main_~n~5 2147483648))) (let ((.cse2 (* 2 |ULTIMATE.start___VERIFIER_assert_#in~cond|)) (.cse1 (* 2 ULTIMATE.start___VERIFIER_assert_~cond))) (and (<= .cse1 2) (<= .cse2 2) (<= 2 .cse2) (<= 2 .cse1) .cse0 (<= ULTIMATE.start___VERIFIER_assert_~cond ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start___VERIFIER_assert_~cond 2147483646)))))) [2018-12-03 18:47:12,923 INFO L444 ceAbstractionStarter]: At program point L65(lines 65 75) the Hoare annotation is: false [2018-12-03 18:47:12,923 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2018-12-03 18:47:12,923 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 77) no Hoare annotation was computed. [2018-12-03 18:47:12,924 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 77) no Hoare annotation was computed. [2018-12-03 18:47:12,924 INFO L444 ceAbstractionStarter]: At program point L74(lines 43 74) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start_main_~j~5 2147483648))) (.cse4 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5))) (or (let ((.cse1 (* 2 |ULTIMATE.start___VERIFIER_assert_#in~cond|)) (.cse2 (* 2 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse0 (* 2 ULTIMATE.start_main_~k~5))) (and (<= .cse0 4294967294) (<= .cse1 2) (<= 2 .cse1) (<= .cse2 2) .cse3 (<= 2 .cse2) (<= 0 .cse0) .cse4)) (and (<= (* 2 ULTIMATE.start_main_~n~5) 4294967294) (<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) 4294967294) .cse3 .cse4 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start_main_~n~5 2147483648))) (and (<= ULTIMATE.start_main_~k~5 0) (<= ULTIMATE.start_main_~j~5 0) (<= ULTIMATE.start_main_~i~5 0)))) [2018-12-03 18:47:12,924 INFO L444 ceAbstractionStarter]: At program point L39(lines 26 40) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~5 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) (<= (* 2 ULTIMATE.start_main_~n~5) 4294967294) (<= (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~i~5) 4294967294) (<= 0 (* 2 ULTIMATE.start_main_~i~5)) (<= ULTIMATE.start_main_~k~5 (+ ULTIMATE.start_main_~n~5 2147483648))) [2018-12-03 18:47:12,942 INFO L202 PluginConnector]: Adding new model down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:47:12 BoogieIcfgContainer [2018-12-03 18:47:12,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:47:12,947 INFO L168 Benchmark]: Toolchain (without parser) took 5447.44 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 702.0 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -570.9 MB). Peak memory consumption was 164.2 MB. Max. memory is 7.1 GB. [2018-12-03 18:47:12,952 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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 18:47:12,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.44 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 18:47:12,953 INFO L168 Benchmark]: Boogie Preprocessor took 21.96 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 18:47:12,954 INFO L168 Benchmark]: RCFGBuilder took 409.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 18:47:12,955 INFO L168 Benchmark]: TraceAbstraction took 4973.86 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 702.0 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -592.0 MB). Peak memory consumption was 143.0 MB. Max. memory is 7.1 GB. [2018-12-03 18:47:12,961 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.22 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 35.44 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.96 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 409.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4973.86 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 702.0 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -592.0 MB). Peak memory consumption was 143.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 76]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((((2 * main_~k~5 <= 4294967294 && 2 * __VERIFIER_assert_#in~cond <= 2) && 2 <= 2 * __VERIFIER_assert_#in~cond) && 2 * __VERIFIER_assert_~cond <= 2) && main_~k~5 <= main_~j~5 + 2147483648) && 2 <= 2 * __VERIFIER_assert_~cond) && 0 <= 2 * main_~k~5) && main_~j~5 <= main_~k~5) || ((((((2 * main_~n~5 <= 4294967294 && main_~i~5 <= main_~k~5) && main_~k~5 + main_~i~5 <= 4294967294) && main_~k~5 <= main_~j~5 + 2147483648) && main_~j~5 <= main_~k~5) && main_~k~5 <= main_~i~5) && main_~k~5 <= main_~n~5 + 2147483648)) || ((main_~k~5 <= 0 && main_~j~5 <= 0) && main_~i~5 <= 0) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (((((1 <= __VERIFIER_assert_~cond && main_~j~5 <= main_~k~5) && __VERIFIER_assert_~cond <= main_~j~5) && main_~k~5 <= __VERIFIER_assert_~cond + 2147483646) && 2 * __VERIFIER_assert_#in~cond <= 2) && 2 <= 2 * __VERIFIER_assert_#in~cond) && 2 * __VERIFIER_assert_~cond <= 2 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((main_~i~5 <= main_~k~5 && main_~k~5 <= main_~i~5) && 2 * main_~n~5 <= 4294967294) && main_~k~5 + main_~i~5 <= 4294967294) && 0 <= 2 * main_~i~5) && main_~k~5 <= main_~n~5 + 2147483648 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((2 * __VERIFIER_assert_~cond <= 2 && 2 * __VERIFIER_assert_#in~cond <= 2) && 2 <= 2 * __VERIFIER_assert_#in~cond) && 2 <= 2 * __VERIFIER_assert_~cond) && main_~j~5 <= main_~k~5) && __VERIFIER_assert_~cond <= main_~j~5) && main_~k~5 <= __VERIFIER_assert_~cond + 2147483646) || ((((((((2 * main_~n~5 <= 4294967294 && main_~i~5 <= main_~k~5) && 2 * __VERIFIER_assert_#in~cond <= 2) && 2 <= 2 * __VERIFIER_assert_#in~cond) && main_~k~5 + main_~i~5 <= 4294967294) && 2 <= 2 * main_~j~5) && main_~j~5 <= main_~k~5) && main_~k~5 <= main_~i~5) && main_~k~5 <= main_~n~5 + 2147483648) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((2 * main_~n~5 <= 4294967294 && main_~i~5 <= main_~k~5) && main_~k~5 + main_~i~5 <= 4294967294) && 2 <= 2 * main_~j~5) && main_~j~5 <= main_~k~5) && main_~k~5 <= main_~i~5) && main_~k~5 <= main_~n~5 + 2147483648) || ((((((2 * __VERIFIER_assert_~cond <= 2 && 2 * __VERIFIER_assert_#in~cond <= 2) && 2 <= 2 * __VERIFIER_assert_#in~cond) && 2 <= 2 * __VERIFIER_assert_~cond) && main_~j~5 <= main_~k~5) && __VERIFIER_assert_~cond <= main_~j~5) && main_~k~5 <= __VERIFIER_assert_~cond + 2147483646) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 33 SDtfs, 36 SDslu, 41 SDs, 0 SdLazy, 46 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9297520661157024 AbsIntWeakeningRatio, 0.8181818181818182 AbsIntAvgWeakeningVarsNumRemoved, 27.818181818181817 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 274 HoareAnnotationTreeSize, 6 FomulaSimplifications, 242 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 849 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 6/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...