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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:40:17,293 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:40:17,295 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:40:17,313 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:40:17,313 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:40:17,314 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:40:17,316 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:40:17,319 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:40:17,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:40:17,322 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:40:17,323 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:40:17,323 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:40:17,326 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:40:17,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:40:17,328 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:40:17,331 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:40:17,332 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:40:17,335 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:40:17,343 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:40:17,348 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:40:17,349 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:40:17,352 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:40:17,357 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:40:17,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:40:17,357 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:40:17,360 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:40:17,364 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:40:17,365 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:40:17,366 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:40:17,367 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:40:17,367 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:40:17,367 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:40:17,368 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:40:17,371 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:40:17,372 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:40:17,372 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:40:17,372 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:40:17,384 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:40:17,385 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:40:17,386 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:40:17,386 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:40:17,386 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:40:17,386 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:40:17,386 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:40:17,387 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:40:17,387 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:40:17,387 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:40:17,387 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:40:17,387 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:40:17,388 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:40:17,388 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:40:17,388 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:40:17,389 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:40:17,389 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:40:17,389 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:40:17,389 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:40:17,390 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:40:17,390 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:40:17,390 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:40:17,390 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:40:17,390 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:40:17,391 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:40:17,391 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:40:17,391 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:40:17,391 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:40:17,392 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:40:17,392 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:40:17,392 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:40:17,392 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:40:17,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:40:17,393 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:40:17,393 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:40:17,393 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:40:17,393 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:40:17,393 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:40:17,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:40:17,394 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:40:17,394 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:40:17,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:40:17,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:40:17,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:40:17,464 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:40:17,464 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:40:17,465 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-12-03 15:40:17,465 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl' [2018-12-03 15:40:17,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:40:17,539 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:40:17,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:40:17,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:40:17,540 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:40:17,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:17" (1/1) ... [2018-12-03 15:40:17,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:17" (1/1) ... [2018-12-03 15:40:17,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:40:17,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:40:17,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:40:17,585 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:40:17,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:17" (1/1) ... [2018-12-03 15:40:17,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:17" (1/1) ... [2018-12-03 15:40:17,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:17" (1/1) ... [2018-12-03 15:40:17,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:17" (1/1) ... [2018-12-03 15:40:17,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:17" (1/1) ... [2018-12-03 15:40:17,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:17" (1/1) ... [2018-12-03 15:40:17,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:17" (1/1) ... [2018-12-03 15:40:17,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:40:17,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:40:17,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:40:17,642 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:40:17,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:17" (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 15:40:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:40:17,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:40:18,291 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:40:18,291 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:40:18,291 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:40:18 BoogieIcfgContainer [2018-12-03 15:40:18,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:40:18,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:40:18,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:40:18,296 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:40:18,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:17" (1/2) ... [2018-12-03 15:40:18,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfc57f7 and model type pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:40:18, skipping insertion in model container [2018-12-03 15:40:18,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:40:18" (2/2) ... [2018-12-03 15:40:18,299 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-12-03 15:40:18,309 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:40:18,317 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:40:18,330 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:40:18,361 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:40:18,362 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:40:18,362 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:40:18,362 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:40:18,362 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:40:18,362 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:40:18,362 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:40:18,363 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:40:18,378 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-03 15:40:18,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:40:18,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:18,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:18,388 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:18,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:18,394 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-12-03 15:40:18,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:18,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:18,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:18,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:18,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:18,619 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 15:40:18,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:18,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:40:18,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:18,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:18,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:18,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:18,646 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-12-03 15:40:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:18,700 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-12-03 15:40:18,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:18,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 15:40:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:18,715 INFO L225 Difference]: With dead ends: 48 [2018-12-03 15:40:18,715 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:40:18,719 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 15:40:18,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:40:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-03 15:40:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:40:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-12-03 15:40:18,763 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-12-03 15:40:18,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:18,763 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-12-03 15:40:18,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-12-03 15:40:18,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:40:18,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:18,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:18,765 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:18,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:18,765 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-12-03 15:40:18,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:18,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:18,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:18,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:18,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:18,876 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 15:40:18,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:18,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:40:18,878 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:18,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:18,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:18,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:18,881 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-12-03 15:40:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:18,938 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-12-03 15:40:18,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:18,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 15:40:18,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:18,946 INFO L225 Difference]: With dead ends: 85 [2018-12-03 15:40:18,947 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:40:18,948 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 15:40:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:40:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-12-03 15:40:18,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 15:40:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-12-03 15:40:18,986 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-12-03 15:40:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:18,986 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-12-03 15:40:18,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-12-03 15:40:18,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:40:18,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:18,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:18,988 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:18,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:18,989 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-12-03 15:40:18,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:18,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:18,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:18,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:18,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:19,127 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 15:40:19,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:19,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:40:19,128 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:19,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:19,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:19,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:19,130 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-12-03 15:40:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:19,184 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-12-03 15:40:19,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:19,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 15:40:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:19,188 INFO L225 Difference]: With dead ends: 163 [2018-12-03 15:40:19,189 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 15:40:19,190 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 15:40:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 15:40:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-12-03 15:40:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 15:40:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-12-03 15:40:19,233 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-12-03 15:40:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:19,233 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-12-03 15:40:19,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-12-03 15:40:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:40:19,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:19,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:19,235 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:19,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:19,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-12-03 15:40:19,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:19,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:19,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:19,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:19,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:19,384 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 15:40:19,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:19,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:40:19,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:19,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:19,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:19,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:19,387 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-12-03 15:40:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:19,484 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-12-03 15:40:19,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:19,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 15:40:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:19,487 INFO L225 Difference]: With dead ends: 269 [2018-12-03 15:40:19,487 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 15:40:19,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 15:40:19,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 15:40:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-12-03 15:40:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 15:40:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-12-03 15:40:19,519 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-12-03 15:40:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:19,519 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-12-03 15:40:19,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:19,521 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-12-03 15:40:19,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:40:19,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:19,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:19,522 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:19,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:19,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-12-03 15:40:19,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:19,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:19,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:19,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:19,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:19,708 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 15:40:19,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:19,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:40:19,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:19,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:40:19,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:40:19,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:40:19,710 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-12-03 15:40:19,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:19,956 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-12-03 15:40:19,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:40:19,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-03 15:40:19,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:19,960 INFO L225 Difference]: With dead ends: 293 [2018-12-03 15:40:19,960 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 15:40:19,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:40:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 15:40:20,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-12-03 15:40:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 15:40:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-12-03 15:40:20,033 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-12-03 15:40:20,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:20,034 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-12-03 15:40:20,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:40:20,034 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-12-03 15:40:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:40:20,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:20,036 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:20,037 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:20,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-12-03 15:40:20,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:20,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:20,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:20,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:20,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:20,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:20,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:40:20,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:20,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:20,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:20,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:20,242 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-12-03 15:40:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:20,354 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-12-03 15:40:20,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:20,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-03 15:40:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:20,357 INFO L225 Difference]: With dead ends: 525 [2018-12-03 15:40:20,358 INFO L226 Difference]: Without dead ends: 351 [2018-12-03 15:40:20,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-03 15:40:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-12-03 15:40:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-12-03 15:40:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-12-03 15:40:20,448 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-12-03 15:40:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:20,448 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-12-03 15:40:20,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-12-03 15:40:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:40:20,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:20,456 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:20,456 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:20,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:20,457 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-12-03 15:40:20,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:20,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:20,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:20,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:20,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:20,866 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:40:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:40:21,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:21,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:21,012 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 15:40:21,016 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [44], [46], [48], [52], [54], [56] [2018-12-03 15:40:21,069 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:40:21,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:40:22,120 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:40:22,122 INFO L272 AbstractInterpreter]: Visited 22 different actions 102 times. Merged at 20 different actions 56 times. Never widened. Found 23 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 15:40:22,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:22,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:40:22,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:22,167 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 15:40:22,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:22,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:40:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:22,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:40:22,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:22,706 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-03 15:40:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:40:22,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:22,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 7 [2018-12-03 15:40:22,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:22,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:40:22,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:40:22,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:40:22,748 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 6 states. [2018-12-03 15:40:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:23,099 INFO L93 Difference]: Finished difference Result 811 states and 1054 transitions. [2018-12-03 15:40:23,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:40:23,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-03 15:40:23,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:23,104 INFO L225 Difference]: With dead ends: 811 [2018-12-03 15:40:23,104 INFO L226 Difference]: Without dead ends: 569 [2018-12-03 15:40:23,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:40:23,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-12-03 15:40:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 557. [2018-12-03 15:40:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-12-03 15:40:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 688 transitions. [2018-12-03 15:40:23,191 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 688 transitions. Word has length 28 [2018-12-03 15:40:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:23,191 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 688 transitions. [2018-12-03 15:40:23,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:40:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 688 transitions. [2018-12-03 15:40:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:40:23,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:23,201 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:40:23,201 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:23,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:23,203 INFO L82 PathProgramCache]: Analyzing trace with hash 415408239, now seen corresponding path program 2 times [2018-12-03 15:40:23,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:23,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:23,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:23,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:23,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:23,648 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 15:40:23,793 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 15:40:24,118 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 15:40:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 15:40:24,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:24,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:24,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:24,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:40:24,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:24,135 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 15:40:24,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:40:24,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:40:24,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:40:24,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:40:24,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:40:24,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:40:24,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:24,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 15:40:24,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:24,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:40:24,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:40:24,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:40:24,965 INFO L87 Difference]: Start difference. First operand 557 states and 688 transitions. Second operand 8 states. [2018-12-03 15:40:25,617 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 15:40:26,439 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-03 15:40:27,400 WARN L180 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-12-03 15:40:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:27,952 INFO L93 Difference]: Finished difference Result 883 states and 1094 transitions. [2018-12-03 15:40:27,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:40:27,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-12-03 15:40:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:27,960 INFO L225 Difference]: With dead ends: 883 [2018-12-03 15:40:27,960 INFO L226 Difference]: Without dead ends: 220 [2018-12-03 15:40:27,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:40:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-03 15:40:28,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 149. [2018-12-03 15:40:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-03 15:40:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2018-12-03 15:40:28,007 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 54 [2018-12-03 15:40:28,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:28,007 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2018-12-03 15:40:28,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:40:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2018-12-03 15:40:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:40:28,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:28,009 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:28,012 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:28,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:28,013 INFO L82 PathProgramCache]: Analyzing trace with hash -129171151, now seen corresponding path program 3 times [2018-12-03 15:40:28,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:28,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:28,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:40:28,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:28,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-03 15:40:28,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:28,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:40:28,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:28,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:28,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:28,086 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 3 states. [2018-12-03 15:40:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:28,094 INFO L93 Difference]: Finished difference Result 149 states and 172 transitions. [2018-12-03 15:40:28,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:28,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 15:40:28,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:28,095 INFO L225 Difference]: With dead ends: 149 [2018-12-03 15:40:28,095 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:40:28,096 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 15:40:28,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:40:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:40:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:40:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:40:28,098 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-12-03 15:40:28,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:28,098 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:40:28,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:40:28,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:40:28,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:40:28,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:40:28,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:40:28,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:40:28,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:40:28,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:40:28,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:40:29,423 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-12-03 15:40:29,671 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-03 15:40:30,182 WARN L180 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-12-03 15:40:30,356 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-12-03 15:40:30,630 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-03 15:40:30,850 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-03 15:40:30,970 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-12-03 15:40:31,160 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-12-03 15:40:31,706 WARN L180 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-12-03 15:40:31,951 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-03 15:40:32,238 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-03 15:40:32,633 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-12-03 15:40:32,637 INFO L444 ceAbstractionStarter]: At program point L300(lines 300 311) the Hoare annotation is: (let ((.cse10 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (<= .cse12 127) (<= v_prenex_1 127) (= ~p3_new .cse12) (<= 0 v_prenex_1))))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~r1 1)) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~r1 0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse9 .cse10) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (<= .cse11 127) (<= v_prenex_1 127) (= .cse11 ~p3_old) (<= 0 v_prenex_1)))) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-12-03 15:40:32,637 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 375) no Hoare annotation was computed. [2018-12-03 15:40:32,637 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 376) no Hoare annotation was computed. [2018-12-03 15:40:32,638 INFO L444 ceAbstractionStarter]: At program point L317(lines 310 318) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse4 (<= ~r1 1)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3)) (.cse10 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (<= .cse12 127) (<= v_prenex_1 127) (= ~p3_new .cse12) (<= 0 v_prenex_1)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (<= .cse11 127) (<= v_prenex_1 127) (= .cse11 ~p3_old) (<= 0 v_prenex_1)))) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~r1 0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-03 15:40:32,638 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 376) no Hoare annotation was computed. [2018-12-03 15:40:32,638 INFO L444 ceAbstractionStarter]: At program point L251(lines 243 252) the Hoare annotation is: (let ((.cse13 (div ~mode2 256))) (let ((.cse4 (<= ~r1 1)) (.cse2 (exists ((v_prenex_1 Int)) (let ((.cse14 (mod v_prenex_1 256))) (and (<= .cse14 127) (<= v_prenex_1 127) (= .cse14 ~p3_old) (<= 0 v_prenex_1))))) (.cse10 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse11 (<= 1 ~mode2)) (.cse12 (<= .cse13 0)) (.cse1 (<= ~send3 127)) (.cse9 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse3 (not (= ~p1_new ~nomsg))) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse10 .cse11 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse11 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8) (and (= ~r1 0) .cse1 .cse9 .cse3 .cse5 (= ~mode2 (* 256 .cse13)) .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256))) .cse8)))) [2018-12-03 15:40:32,639 INFO L444 ceAbstractionStarter]: At program point L367(lines 367 374) the Hoare annotation is: false [2018-12-03 15:40:32,639 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 376) no Hoare annotation was computed. [2018-12-03 15:40:32,639 INFO L444 ceAbstractionStarter]: At program point L256(lines 256 266) the Hoare annotation is: (let ((.cse13 (div ~mode2 256))) (let ((.cse4 (<= ~r1 1)) (.cse2 (exists ((v_prenex_1 Int)) (let ((.cse14 (mod v_prenex_1 256))) (and (<= .cse14 127) (<= v_prenex_1 127) (= .cse14 ~p3_old) (<= 0 v_prenex_1))))) (.cse10 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse11 (<= 1 ~mode2)) (.cse12 (<= .cse13 0)) (.cse1 (<= ~send3 127)) (.cse9 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse3 (not (= ~p1_new ~nomsg))) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse10 .cse11 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse11 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8) (and (= ~r1 0) .cse1 .cse9 .cse3 .cse5 (= ~mode2 (* 256 .cse13)) .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256))) .cse8)))) [2018-12-03 15:40:32,639 INFO L444 ceAbstractionStarter]: At program point L351(lines 346 352) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse8 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (<= .cse9 127) (<= v_prenex_1 127) (= .cse9 ~p3_old) (<= 0 v_prenex_1)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2018-12-03 15:40:32,640 INFO L444 ceAbstractionStarter]: At program point L273(lines 265 274) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse5 (<= ~r1 1)) (.cse11 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= ~send3 127)) (.cse3 (<= 1 ~mode2)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse6 (< 0 (+ (div ~send1 256) 1))) (.cse7 (<= ~send1 127)) (.cse8 (<= (div ~mode2 256) 0)) (.cse9 (= 0 (+ ~nomsg 1))) (.cse10 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~r1 0) .cse11 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= ~mode4 (* 256 (div ~mode4 256))) .cse10))) [2018-12-03 15:40:32,640 INFO L444 ceAbstractionStarter]: At program point L331(lines 331 337) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse3 (<= 1 ~mode2)) (.cse4 (<= ~r1 1)) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-12-03 15:40:32,640 INFO L444 ceAbstractionStarter]: At program point L278(lines 278 288) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse5 (<= ~r1 1)) (.cse11 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= ~send3 127)) (.cse3 (<= 1 ~mode2)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse6 (< 0 (+ (div ~send1 256) 1))) (.cse7 (<= ~send1 127)) (.cse8 (<= (div ~mode2 256) 0)) (.cse9 (= 0 (+ ~nomsg 1))) (.cse10 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~r1 0) .cse11 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= ~mode4 (* 256 (div ~mode4 256))) .cse10))) [2018-12-03 15:40:32,641 INFO L444 ceAbstractionStarter]: At program point L373(lines 226 373) the Hoare annotation is: (let ((.cse10 (div ~mode2 256))) (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse3 (<= 1 ~mode2)) (.cse6 (<= .cse10 0)) (.cse1 (<= ~send3 127)) (.cse9 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse4 (< 0 (+ (div ~send1 256) 1))) (.cse5 (<= ~send1 127)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~r1 0) .cse1 .cse9 (= ~mode1 (* 256 (div ~mode1 256))) .cse4 (= ~mode2 (* 256 .cse10)) .cse5 .cse7 (= ~mode4 (* 256 (div ~mode4 256))) .cse8)))) [2018-12-03 15:40:32,641 INFO L444 ceAbstractionStarter]: At program point L340(lines 336 347) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse3 (<= 1 ~mode2)) (.cse4 (<= ~r1 1)) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-12-03 15:40:32,641 INFO L444 ceAbstractionStarter]: At program point L233(lines 233 244) the Hoare annotation is: (let ((.cse10 (div ~mode2 256))) (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse3 (<= 1 ~mode2)) (.cse6 (<= .cse10 0)) (.cse1 (<= ~send3 127)) (.cse9 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse4 (< 0 (+ (div ~send1 256) 1))) (.cse5 (<= ~send1 127)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~r1 0) .cse1 .cse9 (= ~mode1 (* 256 (div ~mode1 256))) .cse4 (= ~mode2 (* 256 .cse10)) .cse5 .cse7 (= ~mode4 (* 256 (div ~mode4 256))) .cse8)))) [2018-12-03 15:40:32,642 INFO L444 ceAbstractionStarter]: At program point L361(lines 361 368) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (<= (div ULTIMATE.start_assert_~arg 256) 0)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 1 ULTIMATE.start_assert_~arg)) (.cse9 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse10 (<= 0 ~send3))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (<= .cse11 127) (<= v_prenex_1 127) (= .cse11 ~p3_old) (<= 0 v_prenex_1)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-03 15:40:32,642 INFO L444 ceAbstractionStarter]: At program point L295(lines 287 296) the Hoare annotation is: (let ((.cse10 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (<= .cse12 127) (<= v_prenex_1 127) (= ~p3_new .cse12) (<= 0 v_prenex_1))))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~r1 1)) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~r1 0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse9 .cse10) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (<= .cse11 127) (<= v_prenex_1 127) (= .cse11 ~p3_old) (<= 0 v_prenex_1)))) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-12-03 15:40:32,669 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:40:32 BoogieIcfgContainer [2018-12-03 15:40:32,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:40:32,671 INFO L168 Benchmark]: Toolchain (without parser) took 15132.31 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 841.5 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -602.0 MB). Peak memory consumption was 610.2 MB. Max. memory is 7.1 GB. [2018-12-03 15:40:32,672 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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 15:40:32,672 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.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 15:40:32,673 INFO L168 Benchmark]: Boogie Preprocessor took 56.61 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 15:40:32,673 INFO L168 Benchmark]: RCFGBuilder took 650.11 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 15:40:32,674 INFO L168 Benchmark]: TraceAbstraction took 14377.09 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 841.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -644.3 MB). Peak memory consumption was 567.9 MB. Max. memory is 7.1 GB. [2018-12-03 15:40:32,679 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.19 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 44.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 Preprocessor took 56.61 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 650.11 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14377.09 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 841.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -644.3 MB). Peak memory consumption was 567.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 375]: 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: 243]: Loop Invariant Derived loop invariant: (((((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || ((((((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) || ((((((((((~r1 == 0 && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1))) || (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((((!(~p1_old == ~nomsg) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~send3) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~send3) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((((!(~p1_old == ~nomsg) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~83) && 0 <= ~send3) || (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~83) && 0 <= ~send3) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || ((((((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) || (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) || ((((((((((~r1 == 0 && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1))) || (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 14.2s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 4.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 240 SDtfs, 213 SDslu, 235 SDs, 0 SdLazy, 186 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 207 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 127 NumberOfFragments, 2286 HoareAnnotationTreeSize, 14 FomulaSimplifications, 5225 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 951 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 321 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 390 ConstructedInterpolants, 15 QuantifiedInterpolants, 121117 SizeOfPredicates, 12 NumberOfNonLiveVariables, 512 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 260/364 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...