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/20170304-DifficultPathPrograms/diamond2.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:59:27,272 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:59:27,274 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:59:27,292 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:59:27,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:59:27,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:59:27,296 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:59:27,299 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:59:27,300 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:59:27,303 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:59:27,304 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:59:27,304 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:59:27,305 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:59:27,307 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:59:27,308 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:59:27,309 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:59:27,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:59:27,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:59:27,321 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:59:27,323 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:59:27,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:59:27,326 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:59:27,328 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:59:27,328 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:59:27,328 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:59:27,329 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:59:27,330 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:59:27,331 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:59:27,332 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:59:27,333 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:59:27,333 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:59:27,333 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:59:27,334 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:59:27,334 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:59:27,335 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:59:27,335 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:59:27,336 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:59:27,348 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:59:27,348 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:59:27,349 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:59:27,349 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:59:27,349 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:59:27,349 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:59:27,350 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:59:27,350 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:59:27,350 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:59:27,350 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 18:59:27,350 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:59:27,351 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:59:27,351 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:59:27,351 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:59:27,352 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:59:27,352 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:59:27,352 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:59:27,352 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:59:27,352 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:59:27,353 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:59:27,353 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:59:27,353 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:59:27,353 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:59:27,353 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:59:27,354 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:59:27,354 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:59:27,354 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:59:27,354 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:59:27,354 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:59:27,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:59:27,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:59:27,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:59:27,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:59:27,355 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:59:27,356 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:59:27,356 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:59:27,356 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:59:27,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:59:27,356 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:59:27,357 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:59:27,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:59:27,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:59:27,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:59:27,419 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:59:27,421 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:59:27,421 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond2.i_4.bpl [2018-12-03 18:59:27,422 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond2.i_4.bpl' [2018-12-03 18:59:27,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:59:27,490 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:59:27,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:59:27,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:59:27,491 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:59:27,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:59:27" (1/1) ... [2018-12-03 18:59:27,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:59:27" (1/1) ... [2018-12-03 18:59:27,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:59:27,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:59:27,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:59:27,535 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:59:27,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:59:27" (1/1) ... [2018-12-03 18:59:27,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:59:27" (1/1) ... [2018-12-03 18:59:27,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:59:27" (1/1) ... [2018-12-03 18:59:27,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:59:27" (1/1) ... [2018-12-03 18:59:27,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:59:27" (1/1) ... [2018-12-03 18:59:27,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:59:27" (1/1) ... [2018-12-03 18:59:27,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:59:27" (1/1) ... [2018-12-03 18:59:27,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:59:27,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:59:27,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:59:27,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:59:27,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:59:27" (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:59:27,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:59:27,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:59:27,905 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:59:27,905 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:59:27,905 INFO L202 PluginConnector]: Adding new model diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:59:27 BoogieIcfgContainer [2018-12-03 18:59:27,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:59:27,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:59:27,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:59:27,910 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:59:27,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:59:27" (1/2) ... [2018-12-03 18:59:27,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f70183 and model type diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:59:27, skipping insertion in model container [2018-12-03 18:59:27,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:59:27" (2/2) ... [2018-12-03 18:59:27,914 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond2.i_4.bpl [2018-12-03 18:59:27,923 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:59:27,931 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:59:27,948 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:59:27,981 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:59:27,982 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:59:27,982 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:59:27,982 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:59:27,982 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:59:27,982 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:59:27,983 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:59:27,983 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:59:27,998 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 18:59:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:59:28,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:28,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:59:28,008 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:28,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:28,014 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 18:59:28,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:28,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:28,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:28,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:28,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:28,396 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-03 18:59:28,398 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:59:28,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:59:28,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:59:28,401 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:59:28,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:59:28,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:59:28,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:59:28,425 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 18:59:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:28,485 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 18:59:28,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:59:28,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 18:59:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:28,499 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:59:28,499 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 18:59:28,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:59:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 18:59:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 18:59:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 18:59:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 18:59:28,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 18:59:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:28,535 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 18:59:28,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:59:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 18:59:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 18:59:28,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:28,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 18:59:28,536 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:28,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:28,537 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 18:59:28,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:28,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:28,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:28,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:28,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:28,683 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 18:59:28,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:28,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:28,685 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 18:59:28,687 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 18:59:28,748 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:59:28,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:59:28,825 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 18:59:29,712 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:59:29,714 INFO L272 AbstractInterpreter]: Visited 4 different actions 22 times. Merged at 3 different actions 18 times. Widened at 2 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:59:29,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:29,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:59:29,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:29,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:59:29,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:29,774 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:59:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:29,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:29,976 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 18:59:29,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:30,096 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 18:59:30,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:30,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 18:59:30,116 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:30,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:59:30,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:59:30,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:59:30,118 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 18:59:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:30,147 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 18:59:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:59:30,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 18:59:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:30,150 INFO L225 Difference]: With dead ends: 8 [2018-12-03 18:59:30,150 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 18:59:30,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:59:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 18:59:30,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 18:59:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 18:59:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 18:59:30,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 18:59:30,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:30,157 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 18:59:30,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:59:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 18:59:30,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:59:30,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:30,158 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 18:59:30,159 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:30,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:30,159 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 18:59:30,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:30,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:30,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:30,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:30,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:30,446 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 18:59:30,447 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 18:59:30,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:30,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:30,448 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:30,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:30,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:30,449 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 18:59:30,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:59:30,466 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:59:30,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:59:30,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:59:30,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:30,633 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 18:59:30,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:30,710 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 18:59:30,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:30,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-03 18:59:30,730 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:30,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:59:30,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:59:30,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:59:30,731 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 18:59:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:30,763 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 18:59:30,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:59:30,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 18:59:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:30,765 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:59:30,765 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:59:30,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:59:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:59:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 18:59:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 18:59:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 18:59:30,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 18:59:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:30,769 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 18:59:30,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:59:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 18:59:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:59:30,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:30,770 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 18:59:30,770 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:30,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:30,771 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 18:59:30,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:30,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:30,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:59:30,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:30,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:31,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:31,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:31,058 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:31,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:31,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:31,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:59:31,068 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:59:31,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:59:31,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:59:31,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:59:31,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:31,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:31,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:31,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 18:59:31,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:31,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:59:31,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:59:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:59:31,296 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 18:59:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:31,335 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 18:59:31,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:59:31,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 18:59:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:31,336 INFO L225 Difference]: With dead ends: 10 [2018-12-03 18:59:31,336 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 18:59:31,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:59:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 18:59:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 18:59:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 18:59:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 18:59:31,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 18:59:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:31,340 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 18:59:31,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:59:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 18:59:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:59:31,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:31,341 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 18:59:31,341 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:31,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:31,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 18:59:31,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:31,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:31,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:59:31,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:31,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:31,833 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 18:59:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:31,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:31,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:31,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:31,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:31,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:31,835 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 18:59:31,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:31,844 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:59:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:31,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:31,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:32,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:32,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 18:59:32,193 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:32,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:59:32,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:59:32,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:59:32,194 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 18:59:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:32,263 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 18:59:32,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:59:32,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 18:59:32,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:32,266 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:59:32,266 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 18:59:32,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:59:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 18:59:32,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 18:59:32,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 18:59:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 18:59:32,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 18:59:32,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:32,270 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 18:59:32,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:59:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 18:59:32,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:59:32,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:32,271 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 18:59:32,271 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:32,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:32,272 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 18:59:32,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:32,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:32,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:32,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:32,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:32,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:32,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:32,614 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:32,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:32,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:32,615 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:59:32,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:59:32,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:59:32,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:59:32,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:59:32,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:32,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:32,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:32,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 18:59:32,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:32,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:59:32,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:59:32,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:59:32,841 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 18:59:32,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:32,894 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 18:59:32,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:59:32,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 18:59:32,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:32,895 INFO L225 Difference]: With dead ends: 12 [2018-12-03 18:59:32,896 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 18:59:32,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:59:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 18:59:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 18:59:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 18:59:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 18:59:32,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 18:59:32,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:32,901 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 18:59:32,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:59:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 18:59:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:59:32,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:32,901 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 18:59:32,901 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:32,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:32,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 18:59:32,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:32,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:32,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:59:32,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:32,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:35,205 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-03 18:59:39,450 WARN L180 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-03 18:59:43,640 WARN L180 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-03 18:59:47,775 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-03 18:59:49,853 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-03 19:00:06,165 WARN L180 SmtUtils]: Spent 12.24 s on a formula simplification. DAG size of input: 121 DAG size of output: 27 [2018-12-03 19:00:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:06,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:06,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:00:06,167 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:00:06,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:00:06,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:06,168 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 19:00:06,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:00:06,176 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:00:06,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:00:06,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:00:06,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:00:06,280 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 19:00:06,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:00:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 19:00:06,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:00:06,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 4] total 12 [2018-12-03 19:00:06,603 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:00:06,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 19:00:06,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 19:00:06,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=119, Unknown=2, NotChecked=0, Total=156 [2018-12-03 19:00:06,605 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 19:00:06,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:00:06,757 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-03 19:00:06,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 19:00:06,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 19:00:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:00:06,759 INFO L225 Difference]: With dead ends: 11 [2018-12-03 19:00:06,759 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 19:00:06,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=35, Invalid=119, Unknown=2, NotChecked=0, Total=156 [2018-12-03 19:00:06,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 19:00:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 19:00:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 19:00:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 19:00:06,761 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2018-12-03 19:00:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:00:06,761 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 19:00:06,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 19:00:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 19:00:06,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 19:00:06,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 19:00:07,038 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-12-03 19:00:07,042 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 57) no Hoare annotation was computed. [2018-12-03 19:00:07,042 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 57) no Hoare annotation was computed. [2018-12-03 19:00:07,042 INFO L444 ceAbstractionStarter]: At program point L29(lines 29 55) the Hoare annotation is: false [2018-12-03 19:00:07,042 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 57) no Hoare annotation was computed. [2018-12-03 19:00:07,042 INFO L444 ceAbstractionStarter]: At program point L54(lines 16 54) the Hoare annotation is: (let ((.cse4 (div ULTIMATE.start_main_~y~5 2))) (let ((.cse2 (* 4294967296 (div (+ ULTIMATE.start_main_~y~5 (* (- 2) .cse4)) 4294967296))) (.cse3 (* 2 .cse4))) (let ((.cse1 (+ .cse2 .cse3 ULTIMATE.start_main_~x~5)) (.cse0 (<= ULTIMATE.start_main_~y~5 (+ .cse2 .cse3)))) (or (and (<= 19 ULTIMATE.start_main_~x~5) .cse0 (<= ULTIMATE.start_main_~x~5 19)) (and (<= 95 ULTIMATE.start_main_~x~5) (<= ULTIMATE.start_main_~x~5 95) .cse0) (and (<= 38 ULTIMATE.start_main_~x~5) (<= .cse1 (+ ULTIMATE.start_main_~y~5 38)) .cse0) (and (<= .cse1 (+ ULTIMATE.start_main_~y~5 114)) (<= 114 ULTIMATE.start_main_~x~5) .cse0) (and .cse0 (<= 76 ULTIMATE.start_main_~x~5) (<= ULTIMATE.start_main_~x~5 76)) (and (<= ULTIMATE.start_main_~x~5 0) (< 0 (+ (div ULTIMATE.start_main_~x~5 4294967296) 1))) (and (<= .cse1 (+ ULTIMATE.start_main_~y~5 57)) .cse0 (<= 57 ULTIMATE.start_main_~x~5)))))) [2018-12-03 19:00:07,043 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 56) no Hoare annotation was computed. [2018-12-03 19:00:07,053 INFO L202 PluginConnector]: Adding new model diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:00:07 BoogieIcfgContainer [2018-12-03 19:00:07,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 19:00:07,055 INFO L168 Benchmark]: Toolchain (without parser) took 39565.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -462.8 MB). Peak memory consumption was 269.1 MB. Max. memory is 7.1 GB. [2018-12-03 19:00:07,056 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 19:00:07,056 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.85 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 19:00:07,057 INFO L168 Benchmark]: Boogie Preprocessor took 37.69 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 19:00:07,057 INFO L168 Benchmark]: RCFGBuilder took 327.91 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 19:00:07,058 INFO L168 Benchmark]: TraceAbstraction took 39147.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -483.9 MB). Peak memory consumption was 248.0 MB. Max. memory is 7.1 GB. [2018-12-03 19:00:07,062 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 43.85 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 37.69 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 327.91 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 39147.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -483.9 MB). Peak memory consumption was 248.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 56]: 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: 16]: Loop Invariant Derived loop invariant: (((((((19 <= main_~x~5 && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2)) && main_~x~5 <= 19) || ((95 <= main_~x~5 && main_~x~5 <= 95) && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2))) || ((38 <= main_~x~5 && 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2) + main_~x~5 <= main_~y~5 + 38) && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2))) || ((4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2) + main_~x~5 <= main_~y~5 + 114 && 114 <= main_~x~5) && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2))) || ((main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2) && 76 <= main_~x~5) && main_~x~5 <= 76)) || (main_~x~5 <= 0 && 0 < main_~x~5 / 4294967296 + 1)) || ((4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2) + main_~x~5 <= main_~y~5 + 57 && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2)) && 57 <= main_~x~5) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 39.0s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 0 SDslu, 15 SDs, 0 SdLazy, 169 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 36.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 9 NumberOfFragments, 226 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 75 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 36.4s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 101 ConstructedInterpolants, 1 QuantifiedInterpolants, 7723 SizeOfPredicates, 10 NumberOfNonLiveVariables, 189 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 6/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...