java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/nested_true-unreach-call_true-termination.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:05:15,291 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:05:15,293 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:05:15,311 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:05:15,312 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:05:15,316 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:05:15,317 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:05:15,320 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:05:15,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:05:15,326 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:05:15,329 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:05:15,329 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:05:15,331 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:05:15,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:05:15,336 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:05:15,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:05:15,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:05:15,343 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:05:15,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:05:15,353 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:05:15,354 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:05:15,355 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:05:15,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:05:15,360 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:05:15,360 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:05:15,361 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:05:15,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:05:15,364 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:05:15,364 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:05:15,365 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:05:15,366 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:05:15,369 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:05:15,369 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:05:15,369 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:05:15,370 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:05:15,373 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:05:15,373 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 13:05:15,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:05:15,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:05:15,391 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:05:15,391 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:05:15,392 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:05:15,392 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:05:15,393 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:05:15,393 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:05:15,393 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:05:15,393 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:05:15,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:05:15,394 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:05:15,394 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:05:15,396 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:05:15,396 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:05:15,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:05:15,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:05:15,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:05:15,505 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:05:15,505 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:05:15,506 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/nested_true-unreach-call_true-termination.i_4.bpl [2018-10-15 13:05:15,506 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/nested_true-unreach-call_true-termination.i_4.bpl' [2018-10-15 13:05:15,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:05:15,574 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:05:15,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:05:15,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:05:15,575 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:05:15,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:15" (1/1) ... [2018-10-15 13:05:15,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:15" (1/1) ... [2018-10-15 13:05:15,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:15" (1/1) ... [2018-10-15 13:05:15,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:15" (1/1) ... [2018-10-15 13:05:15,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:15" (1/1) ... [2018-10-15 13:05:15,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:15" (1/1) ... [2018-10-15 13:05:15,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:15" (1/1) ... [2018-10-15 13:05:15,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:05:15,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:05:15,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:05:15,628 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:05:15,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:15" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 13:05:15,704 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:05:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:05:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:05:16,064 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:05:16,065 INFO L202 PluginConnector]: Adding new model nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:16 BoogieIcfgContainer [2018-10-15 13:05:16,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:05:16,066 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:05:16,066 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:05:16,067 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:05:16,071 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:16" (1/1) ... [2018-10-15 13:05:16,077 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:05:16,095 INFO L202 PluginConnector]: Adding new model nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:05:16 BasicIcfg [2018-10-15 13:05:16,095 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:05:16,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:05:16,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:05:16,100 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:05:16,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:15" (1/3) ... [2018-10-15 13:05:16,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5624f55 and model type nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:16, skipping insertion in model container [2018-10-15 13:05:16,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:16" (2/3) ... [2018-10-15 13:05:16,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5624f55 and model type nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:05:16, skipping insertion in model container [2018-10-15 13:05:16,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:05:16" (3/3) ... [2018-10-15 13:05:16,105 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call_true-termination.i_4.bplleft_unchanged_by_heapseparator [2018-10-15 13:05:16,116 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:05:16,125 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:05:16,153 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:05:16,184 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:05:16,185 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:05:16,185 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:05:16,185 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:05:16,185 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:05:16,186 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:05:16,186 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:05:16,186 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:05:16,186 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:05:16,201 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-10-15 13:05:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 13:05:16,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:16,211 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:16,212 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:16,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:16,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1088398256, now seen corresponding path program 1 times [2018-10-15 13:05:16,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:16,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:05:16,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 13:05:16,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 13:05:16,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 13:05:16,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 13:05:16,438 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 4 states. [2018-10-15 13:05:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:16,559 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-10-15 13:05:16,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 13:05:16,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-10-15 13:05:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:16,574 INFO L225 Difference]: With dead ends: 43 [2018-10-15 13:05:16,574 INFO L226 Difference]: Without dead ends: 43 [2018-10-15 13:05:16,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:05:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-15 13:05:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2018-10-15 13:05:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 13:05:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-10-15 13:05:16,616 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 20 [2018-10-15 13:05:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:16,617 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-10-15 13:05:16,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 13:05:16,617 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-10-15 13:05:16,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 13:05:16,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:16,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:16,619 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:16,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:16,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1898072359, now seen corresponding path program 1 times [2018-10-15 13:05:16,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:16,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:05:16,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 13:05:16,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 13:05:16,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 13:05:16,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 13:05:16,724 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 4 states. [2018-10-15 13:05:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:16,823 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-10-15 13:05:16,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 13:05:16,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-10-15 13:05:16,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:16,826 INFO L225 Difference]: With dead ends: 39 [2018-10-15 13:05:16,826 INFO L226 Difference]: Without dead ends: 39 [2018-10-15 13:05:16,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:05:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-15 13:05:16,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-10-15 13:05:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-15 13:05:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-10-15 13:05:16,833 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 26 [2018-10-15 13:05:16,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:16,833 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-10-15 13:05:16,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 13:05:16,834 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-10-15 13:05:16,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-15 13:05:16,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:16,835 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:16,836 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:16,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:16,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1251686605, now seen corresponding path program 1 times [2018-10-15 13:05:16,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:17,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:17,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 13:05:17,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 13:05:17,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 13:05:17,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-15 13:05:17,067 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 6 states. [2018-10-15 13:05:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:17,425 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-10-15 13:05:17,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 13:05:17,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-10-15 13:05:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:17,428 INFO L225 Difference]: With dead ends: 46 [2018-10-15 13:05:17,428 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 13:05:17,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-15 13:05:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 13:05:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-10-15 13:05:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 13:05:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-10-15 13:05:17,435 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 33 [2018-10-15 13:05:17,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:17,436 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-10-15 13:05:17,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 13:05:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-10-15 13:05:17,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 13:05:17,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:17,438 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:17,439 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:17,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:17,440 INFO L82 PathProgramCache]: Analyzing trace with hash -898016167, now seen corresponding path program 2 times [2018-10-15 13:05:17,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-15 13:05:17,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:17,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 13:05:17,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 13:05:17,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 13:05:17,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-15 13:05:17,570 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 6 states. [2018-10-15 13:05:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:17,814 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-10-15 13:05:17,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 13:05:17,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-10-15 13:05:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:17,817 INFO L225 Difference]: With dead ends: 79 [2018-10-15 13:05:17,817 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 13:05:17,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-15 13:05:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 13:05:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2018-10-15 13:05:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 13:05:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-10-15 13:05:17,826 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 40 [2018-10-15 13:05:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:17,827 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-10-15 13:05:17,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 13:05:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-10-15 13:05:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 13:05:17,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:17,829 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:17,830 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:17,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:17,830 INFO L82 PathProgramCache]: Analyzing trace with hash 548601314, now seen corresponding path program 3 times [2018-10-15 13:05:17,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-15 13:05:17,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:17,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 13:05:17,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 13:05:17,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 13:05:17,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:05:17,986 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 8 states. [2018-10-15 13:05:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:18,584 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-10-15 13:05:18,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 13:05:18,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-10-15 13:05:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:18,587 INFO L225 Difference]: With dead ends: 85 [2018-10-15 13:05:18,588 INFO L226 Difference]: Without dead ends: 85 [2018-10-15 13:05:18,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:05:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-15 13:05:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-10-15 13:05:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 13:05:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-10-15 13:05:18,595 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 60 [2018-10-15 13:05:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:18,596 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-10-15 13:05:18,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 13:05:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-10-15 13:05:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 13:05:18,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:18,598 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:18,598 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:18,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:18,599 INFO L82 PathProgramCache]: Analyzing trace with hash -224336336, now seen corresponding path program 4 times [2018-10-15 13:05:18,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-15 13:05:18,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:18,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 13:05:18,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 13:05:18,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 13:05:18,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:05:18,818 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 8 states. [2018-10-15 13:05:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:19,020 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-10-15 13:05:19,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 13:05:19,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-10-15 13:05:19,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:19,023 INFO L225 Difference]: With dead ends: 127 [2018-10-15 13:05:19,023 INFO L226 Difference]: Without dead ends: 127 [2018-10-15 13:05:19,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:05:19,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-15 13:05:19,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2018-10-15 13:05:19,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-15 13:05:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-10-15 13:05:19,035 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 74 [2018-10-15 13:05:19,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:19,035 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-10-15 13:05:19,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 13:05:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-10-15 13:05:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-15 13:05:19,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:19,038 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:19,038 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:19,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:19,039 INFO L82 PathProgramCache]: Analyzing trace with hash 494579053, now seen corresponding path program 5 times [2018-10-15 13:05:19,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 145 proven. 24 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-10-15 13:05:19,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:19,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 13:05:19,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 13:05:19,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 13:05:19,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-15 13:05:19,215 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 10 states. [2018-10-15 13:05:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:19,698 INFO L93 Difference]: Finished difference Result 138 states and 141 transitions. [2018-10-15 13:05:19,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 13:05:19,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2018-10-15 13:05:19,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:19,700 INFO L225 Difference]: With dead ends: 138 [2018-10-15 13:05:19,700 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 13:05:19,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:05:19,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 13:05:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2018-10-15 13:05:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 13:05:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2018-10-15 13:05:19,719 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 101 [2018-10-15 13:05:19,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:19,722 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2018-10-15 13:05:19,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 13:05:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2018-10-15 13:05:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 13:05:19,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:19,727 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:19,728 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:19,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:19,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1002432981, now seen corresponding path program 6 times [2018-10-15 13:05:19,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 381 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-15 13:05:20,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:20,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 13:05:20,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 13:05:20,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 13:05:20,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-15 13:05:20,014 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand 10 states. [2018-10-15 13:05:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:20,250 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2018-10-15 13:05:20,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 13:05:20,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2018-10-15 13:05:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:20,259 INFO L225 Difference]: With dead ends: 189 [2018-10-15 13:05:20,259 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 13:05:20,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:05:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 13:05:20,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 157. [2018-10-15 13:05:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 13:05:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2018-10-15 13:05:20,272 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 122 [2018-10-15 13:05:20,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:20,272 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2018-10-15 13:05:20,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 13:05:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2018-10-15 13:05:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 13:05:20,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:20,278 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:20,278 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:20,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:20,278 INFO L82 PathProgramCache]: Analyzing trace with hash 258139380, now seen corresponding path program 7 times [2018-10-15 13:05:20,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 370 proven. 46 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-10-15 13:05:20,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:20,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 13:05:20,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 13:05:20,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 13:05:20,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:05:20,760 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 12 states. [2018-10-15 13:05:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:21,110 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2018-10-15 13:05:21,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 13:05:21,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 156 [2018-10-15 13:05:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:21,114 INFO L225 Difference]: With dead ends: 205 [2018-10-15 13:05:21,114 INFO L226 Difference]: Without dead ends: 205 [2018-10-15 13:05:21,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:05:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-15 13:05:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2018-10-15 13:05:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 13:05:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2018-10-15 13:05:21,124 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 189 transitions. Word has length 156 [2018-10-15 13:05:21,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:21,124 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 189 transitions. [2018-10-15 13:05:21,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 13:05:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2018-10-15 13:05:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 13:05:21,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:21,128 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:21,128 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:21,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:21,129 INFO L82 PathProgramCache]: Analyzing trace with hash 674796944, now seen corresponding path program 8 times [2018-10-15 13:05:21,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1450 backedges. 565 proven. 75 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2018-10-15 13:05:21,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:21,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 13:05:21,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 13:05:21,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 13:05:21,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-15 13:05:21,395 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. Second operand 14 states. [2018-10-15 13:05:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:21,818 INFO L93 Difference]: Finished difference Result 233 states and 237 transitions. [2018-10-15 13:05:21,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 13:05:21,819 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 184 [2018-10-15 13:05:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:21,820 INFO L225 Difference]: With dead ends: 233 [2018-10-15 13:05:21,820 INFO L226 Difference]: Without dead ends: 233 [2018-10-15 13:05:21,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=591, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:05:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-15 13:05:21,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 213. [2018-10-15 13:05:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-15 13:05:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2018-10-15 13:05:21,830 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 184 [2018-10-15 13:05:21,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:21,830 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2018-10-15 13:05:21,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 13:05:21,831 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2018-10-15 13:05:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-15 13:05:21,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:21,834 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:21,834 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:21,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:21,835 INFO L82 PathProgramCache]: Analyzing trace with hash 642810996, now seen corresponding path program 9 times [2018-10-15 13:05:21,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2068 backedges. 0 proven. 1624 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2018-10-15 13:05:22,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:22,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 13:05:22,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 13:05:22,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 13:05:22,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:05:22,243 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 12 states. [2018-10-15 13:05:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:22,501 INFO L93 Difference]: Finished difference Result 307 states and 313 transitions. [2018-10-15 13:05:22,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 13:05:22,502 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 212 [2018-10-15 13:05:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:22,504 INFO L225 Difference]: With dead ends: 307 [2018-10-15 13:05:22,504 INFO L226 Difference]: Without dead ends: 307 [2018-10-15 13:05:22,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:05:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-15 13:05:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 261. [2018-10-15 13:05:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-15 13:05:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 266 transitions. [2018-10-15 13:05:22,512 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 266 transitions. Word has length 212 [2018-10-15 13:05:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:22,513 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 266 transitions. [2018-10-15 13:05:22,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 13:05:22,513 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 266 transitions. [2018-10-15 13:05:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-15 13:05:22,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:22,516 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:22,516 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:22,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:22,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1710462845, now seen corresponding path program 10 times [2018-10-15 13:05:22,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3260 backedges. 0 proven. 2705 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-10-15 13:05:22,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:22,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 13:05:22,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 13:05:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 13:05:22,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-15 13:05:22,871 INFO L87 Difference]: Start difference. First operand 261 states and 266 transitions. Second operand 14 states. [2018-10-15 13:05:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:23,962 INFO L93 Difference]: Finished difference Result 355 states and 362 transitions. [2018-10-15 13:05:23,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 13:05:23,962 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 260 [2018-10-15 13:05:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:23,966 INFO L225 Difference]: With dead ends: 355 [2018-10-15 13:05:23,966 INFO L226 Difference]: Without dead ends: 355 [2018-10-15 13:05:23,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=279, Invalid=591, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:05:23,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-15 13:05:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 309. [2018-10-15 13:05:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-15 13:05:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 315 transitions. [2018-10-15 13:05:23,974 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 315 transitions. Word has length 260 [2018-10-15 13:05:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:23,974 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 315 transitions. [2018-10-15 13:05:23,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 13:05:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 315 transitions. [2018-10-15 13:05:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-15 13:05:23,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:23,978 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:23,979 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:23,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:23,979 INFO L82 PathProgramCache]: Analyzing trace with hash -438627194, now seen corresponding path program 11 times [2018-10-15 13:05:23,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4722 backedges. 1336 proven. 111 refuted. 0 times theorem prover too weak. 3275 trivial. 0 not checked. [2018-10-15 13:05:25,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:25,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 13:05:25,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 13:05:25,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 13:05:25,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:05:25,081 INFO L87 Difference]: Start difference. First operand 309 states and 315 transitions. Second operand 16 states. [2018-10-15 13:05:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:25,464 INFO L93 Difference]: Finished difference Result 381 states and 387 transitions. [2018-10-15 13:05:25,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 13:05:25,466 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 308 [2018-10-15 13:05:25,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:25,468 INFO L225 Difference]: With dead ends: 381 [2018-10-15 13:05:25,468 INFO L226 Difference]: Without dead ends: 381 [2018-10-15 13:05:25,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:05:25,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-15 13:05:25,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 351. [2018-10-15 13:05:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-15 13:05:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 357 transitions. [2018-10-15 13:05:25,477 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 357 transitions. Word has length 308 [2018-10-15 13:05:25,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:25,477 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 357 transitions. [2018-10-15 13:05:25,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 13:05:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 357 transitions. [2018-10-15 13:05:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-15 13:05:25,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:25,481 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:25,481 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:25,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:25,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1671445104, now seen corresponding path program 12 times [2018-10-15 13:05:25,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6375 backedges. 0 proven. 5451 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-10-15 13:05:26,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:26,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 13:05:26,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 13:05:26,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 13:05:26,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:05:26,228 INFO L87 Difference]: Start difference. First operand 351 states and 357 transitions. Second operand 16 states. [2018-10-15 13:05:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:26,746 INFO L93 Difference]: Finished difference Result 459 states and 467 transitions. [2018-10-15 13:05:26,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 13:05:26,747 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 350 [2018-10-15 13:05:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:26,750 INFO L225 Difference]: With dead ends: 459 [2018-10-15 13:05:26,750 INFO L226 Difference]: Without dead ends: 459 [2018-10-15 13:05:26,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:05:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-15 13:05:26,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 406. [2018-10-15 13:05:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-10-15 13:05:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 413 transitions. [2018-10-15 13:05:26,759 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 413 transitions. Word has length 350 [2018-10-15 13:05:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:26,760 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 413 transitions. [2018-10-15 13:05:26,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 13:05:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 413 transitions. [2018-10-15 13:05:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-15 13:05:26,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:26,763 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:26,763 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:26,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:26,763 INFO L82 PathProgramCache]: Analyzing trace with hash 625759789, now seen corresponding path program 13 times [2018-10-15 13:05:26,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8708 backedges. 2161 proven. 154 refuted. 0 times theorem prover too weak. 6393 trivial. 0 not checked. [2018-10-15 13:05:27,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:27,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 13:05:27,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 13:05:27,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 13:05:27,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:05:27,101 INFO L87 Difference]: Start difference. First operand 406 states and 413 transitions. Second operand 18 states. [2018-10-15 13:05:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:27,533 INFO L93 Difference]: Finished difference Result 490 states and 497 transitions. [2018-10-15 13:05:27,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 13:05:27,536 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 405 [2018-10-15 13:05:27,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:27,538 INFO L225 Difference]: With dead ends: 490 [2018-10-15 13:05:27,538 INFO L226 Difference]: Without dead ends: 490 [2018-10-15 13:05:27,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=485, Invalid=1075, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 13:05:27,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-10-15 13:05:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 455. [2018-10-15 13:05:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-15 13:05:27,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 462 transitions. [2018-10-15 13:05:27,550 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 462 transitions. Word has length 405 [2018-10-15 13:05:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:27,550 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 462 transitions. [2018-10-15 13:05:27,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 13:05:27,551 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 462 transitions. [2018-10-15 13:05:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-10-15 13:05:27,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:27,554 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:27,554 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:27,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:27,554 INFO L82 PathProgramCache]: Analyzing trace with hash -801201329, now seen corresponding path program 14 times [2018-10-15 13:05:27,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11305 backedges. 0 proven. 9877 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-10-15 13:05:28,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:28,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 13:05:28,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 13:05:28,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 13:05:28,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:05:28,301 INFO L87 Difference]: Start difference. First operand 455 states and 462 transitions. Second operand 18 states. [2018-10-15 13:05:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:29,316 INFO L93 Difference]: Finished difference Result 577 states and 586 transitions. [2018-10-15 13:05:29,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 13:05:29,316 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 454 [2018-10-15 13:05:29,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:29,320 INFO L225 Difference]: With dead ends: 577 [2018-10-15 13:05:29,320 INFO L226 Difference]: Without dead ends: 577 [2018-10-15 13:05:29,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=485, Invalid=1075, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 13:05:29,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-10-15 13:05:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 517. [2018-10-15 13:05:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-10-15 13:05:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 525 transitions. [2018-10-15 13:05:29,330 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 525 transitions. Word has length 454 [2018-10-15 13:05:29,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:29,331 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 525 transitions. [2018-10-15 13:05:29,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 13:05:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 525 transitions. [2018-10-15 13:05:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-10-15 13:05:29,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:29,335 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:29,335 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:29,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:29,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1324675176, now seen corresponding path program 15 times [2018-10-15 13:05:29,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14800 backedges. 3270 proven. 204 refuted. 0 times theorem prover too weak. 11326 trivial. 0 not checked. [2018-10-15 13:05:30,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:30,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 13:05:30,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 13:05:30,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 13:05:30,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:05:30,583 INFO L87 Difference]: Start difference. First operand 517 states and 525 transitions. Second operand 20 states. [2018-10-15 13:05:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:31,426 INFO L93 Difference]: Finished difference Result 613 states and 621 transitions. [2018-10-15 13:05:31,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 13:05:31,427 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 516 [2018-10-15 13:05:31,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:31,432 INFO L225 Difference]: With dead ends: 613 [2018-10-15 13:05:31,432 INFO L226 Difference]: Without dead ends: 613 [2018-10-15 13:05:31,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=609, Invalid=1371, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:05:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-10-15 13:05:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 573. [2018-10-15 13:05:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-10-15 13:05:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 581 transitions. [2018-10-15 13:05:31,445 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 581 transitions. Word has length 516 [2018-10-15 13:05:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:31,445 INFO L481 AbstractCegarLoop]: Abstraction has 573 states and 581 transitions. [2018-10-15 13:05:31,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 13:05:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 581 transitions. [2018-10-15 13:05:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-10-15 13:05:31,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:31,451 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:31,451 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:31,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:31,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1256531152, now seen corresponding path program 16 times [2018-10-15 13:05:31,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18644 backedges. 4117 proven. 261 refuted. 0 times theorem prover too weak. 14266 trivial. 0 not checked. [2018-10-15 13:05:32,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:32,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 13:05:32,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 13:05:32,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 13:05:32,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-10-15 13:05:32,397 INFO L87 Difference]: Start difference. First operand 573 states and 581 transitions. Second operand 22 states. [2018-10-15 13:05:33,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:33,161 INFO L93 Difference]: Finished difference Result 629 states and 637 transitions. [2018-10-15 13:05:33,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 13:05:33,166 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 572 [2018-10-15 13:05:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:33,169 INFO L225 Difference]: With dead ends: 629 [2018-10-15 13:05:33,169 INFO L226 Difference]: Without dead ends: 629 [2018-10-15 13:05:33,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=747, Invalid=1703, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:05:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-15 13:05:33,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2018-10-15 13:05:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-10-15 13:05:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 637 transitions. [2018-10-15 13:05:33,181 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 637 transitions. Word has length 572 [2018-10-15 13:05:33,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:33,181 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 637 transitions. [2018-10-15 13:05:33,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 13:05:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 637 transitions. [2018-10-15 13:05:33,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2018-10-15 13:05:33,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:33,186 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 80, 80, 80, 80, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:33,187 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:33,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:33,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1699844760, now seen corresponding path program 17 times [2018-10-15 13:05:33,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 22936 backedges. 0 proven. 20336 refuted. 0 times theorem prover too weak. 2600 trivial. 0 not checked. [2018-10-15 13:05:33,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:33,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 13:05:33,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 13:05:33,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 13:05:33,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:05:33,987 INFO L87 Difference]: Start difference. First operand 629 states and 637 transitions. Second operand 20 states. [2018-10-15 13:05:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:34,609 INFO L93 Difference]: Finished difference Result 779 states and 789 transitions. [2018-10-15 13:05:34,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 13:05:34,610 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 628 [2018-10-15 13:05:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:34,617 INFO L225 Difference]: With dead ends: 779 [2018-10-15 13:05:34,617 INFO L226 Difference]: Without dead ends: 779 [2018-10-15 13:05:34,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=609, Invalid=1371, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:05:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-15 13:05:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 705. [2018-10-15 13:05:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-10-15 13:05:34,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 714 transitions. [2018-10-15 13:05:34,628 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 714 transitions. Word has length 628 [2018-10-15 13:05:34,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:34,629 INFO L481 AbstractCegarLoop]: Abstraction has 705 states and 714 transitions. [2018-10-15 13:05:34,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 13:05:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 714 transitions. [2018-10-15 13:05:34,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2018-10-15 13:05:34,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:34,635 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 90, 90, 90, 90, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:34,635 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:34,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:34,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1909490527, now seen corresponding path program 18 times [2018-10-15 13:05:34,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 29070 backedges. 0 proven. 26145 refuted. 0 times theorem prover too weak. 2925 trivial. 0 not checked. [2018-10-15 13:05:37,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:37,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 13:05:37,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 13:05:37,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 13:05:37,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-10-15 13:05:37,090 INFO L87 Difference]: Start difference. First operand 705 states and 714 transitions. Second operand 22 states. [2018-10-15 13:05:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:37,841 INFO L93 Difference]: Finished difference Result 781 states and 791 transitions. [2018-10-15 13:05:37,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 13:05:37,842 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 704 [2018-10-15 13:05:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:37,847 INFO L225 Difference]: With dead ends: 781 [2018-10-15 13:05:37,847 INFO L226 Difference]: Without dead ends: 781 [2018-10-15 13:05:37,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=747, Invalid=1703, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:05:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2018-10-15 13:05:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2018-10-15 13:05:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-10-15 13:05:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 791 transitions. [2018-10-15 13:05:37,859 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 791 transitions. Word has length 704 [2018-10-15 13:05:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:37,860 INFO L481 AbstractCegarLoop]: Abstraction has 781 states and 791 transitions. [2018-10-15 13:05:37,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 13:05:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 791 transitions. [2018-10-15 13:05:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-10-15 13:05:37,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:37,867 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 100, 100, 100, 100, 100, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:37,867 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:37,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:37,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1301227222, now seen corresponding path program 19 times [2018-10-15 13:05:37,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 35930 backedges. 35921 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-15 13:05:51,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:05:51,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [205] imperfect sequences [] total 205 [2018-10-15 13:05:51,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-10-15 13:05:51,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-10-15 13:05:51,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10407, Invalid=31413, Unknown=0, NotChecked=0, Total=41820 [2018-10-15 13:05:51,981 INFO L87 Difference]: Start difference. First operand 781 states and 791 transitions. Second operand 205 states. [2018-10-15 13:06:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:07,723 INFO L93 Difference]: Finished difference Result 32326 states and 32786 transitions. [2018-10-15 13:06:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2018-10-15 13:06:07,723 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 780 [2018-10-15 13:06:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:07,724 INFO L225 Difference]: With dead ends: 32326 [2018-10-15 13:06:07,724 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 13:06:07,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30399 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=51217, Invalid=114025, Unknown=0, NotChecked=0, Total=165242 [2018-10-15 13:06:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 13:06:07,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 13:06:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 13:06:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 13:06:07,736 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 780 [2018-10-15 13:06:07,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:07,736 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 13:06:07,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-10-15 13:06:07,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 13:06:07,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 13:06:07,742 INFO L202 PluginConnector]: Adding new model nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:06:07 BasicIcfg [2018-10-15 13:06:07,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 13:06:07,743 INFO L168 Benchmark]: Toolchain (without parser) took 52170.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.1 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 55.7 MB). Peak memory consumption was 823.8 MB. Max. memory is 7.1 GB. [2018-10-15 13:06:07,745 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 13:06:07,746 INFO L168 Benchmark]: Boogie Preprocessor took 53.03 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-10-15 13:06:07,746 INFO L168 Benchmark]: RCFGBuilder took 437.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 13:06:07,747 INFO L168 Benchmark]: IcfgTransformer took 29.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 13:06:07,748 INFO L168 Benchmark]: TraceAbstraction took 51645.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.1 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 34.5 MB). Peak memory consumption was 802.6 MB. Max. memory is 7.1 GB. [2018-10-15 13:06:07,752 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.03 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 437.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 29.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * TraceAbstraction took 51645.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.1 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 34.5 MB). Peak memory consumption was 802.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. SAFE Result, 51.5s OverallTime, 21 OverallIterations, 100 TraceHistogramMax, 25.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1647 SDtfs, 3317 SDslu, 8229 SDs, 0 SdLazy, 2565 SolverSat, 329 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 957 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 915 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33819 ImplicationChecksByTransitivity, 39.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=781occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 544 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 6005 NumberOfCodeBlocks, 6005 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5984 ConstructedInterpolants, 0 QuantifiedInterpolants, 9741916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 93745/161227 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested_true-unreach-call_true-termination.i_4.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_13-06-07-764.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested_true-unreach-call_true-termination.i_4.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_13-06-07-764.csv Received shutdown request...