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/AutomizerBpl.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 12:36:13,375 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:36:13,377 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:36:13,395 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:36:13,396 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:36:13,397 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:36:13,398 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:36:13,400 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:36:13,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:36:13,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:36:13,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:36:13,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:36:13,405 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:36:13,406 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:36:13,407 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:36:13,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:36:13,410 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:36:13,412 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:36:13,420 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:36:13,425 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:36:13,426 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:36:13,427 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:36:13,430 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:36:13,433 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:36:13,433 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:36:13,434 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:36:13,435 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:36:13,437 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:36:13,437 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:36:13,440 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:36:13,440 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:36:13,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:36:13,443 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:36:13,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:36:13,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:36:13,447 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:36:13,447 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 12:36:13,461 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:36:13,461 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:36:13,465 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:36:13,465 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:36:13,465 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:36:13,465 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:36:13,466 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:36:13,466 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:36:13,467 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:36:13,467 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:36:13,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:36:13,467 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:36:13,467 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:36:13,469 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:36:13,469 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:36:13,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:36:13,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:36:13,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:36:13,541 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:36:13,542 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:36:13,542 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 12:36:13,543 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 12:36:13,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:36:13,597 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:36:13,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:36:13,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:36:13,598 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:36:13,621 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 12:36:13" (1/1) ... [2018-10-15 12:36:13,622 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 12:36:13" (1/1) ... [2018-10-15 12:36:13,632 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 12:36:13" (1/1) ... [2018-10-15 12:36:13,633 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 12:36:13" (1/1) ... [2018-10-15 12:36:13,635 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 12:36:13" (1/1) ... [2018-10-15 12:36:13,637 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 12:36:13" (1/1) ... [2018-10-15 12:36:13,638 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 12:36:13" (1/1) ... [2018-10-15 12:36:13,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:36:13,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:36:13,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:36:13,641 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:36:13,642 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 12:36:13" (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 12:36:13,720 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:36:13,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:36:13,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:36:14,049 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:36:14,050 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 12:36:14 BoogieIcfgContainer [2018-10-15 12:36:14,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:36:14,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:36:14,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:36:14,063 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:36:14,067 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 12:36:13" (1/2) ... [2018-10-15 12:36:14,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19973ba7 and model type nested_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:36:14, skipping insertion in model container [2018-10-15 12:36:14,069 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 12:36:14" (2/2) ... [2018-10-15 12:36:14,074 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call_true-termination.i_4.bpl [2018-10-15 12:36:14,095 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:36:14,104 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:36:14,123 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:36:14,153 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:36:14,154 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:36:14,154 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:36:14,154 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:36:14,155 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:36:14,155 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:36:14,155 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:36:14,155 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:36:14,155 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:36:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-10-15 12:36:14,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 12:36:14,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:14,183 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 12:36:14,184 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:14,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:14,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2133805839, now seen corresponding path program 1 times [2018-10-15 12:36:14,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:14,435 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 12:36:14,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:36:14,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 12:36:14,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 12:36:14,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 12:36:14,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 12:36:14,459 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 4 states. [2018-10-15 12:36:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:14,559 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-10-15 12:36:14,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 12:36:14,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-10-15 12:36:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:14,572 INFO L225 Difference]: With dead ends: 43 [2018-10-15 12:36:14,573 INFO L226 Difference]: Without dead ends: 43 [2018-10-15 12:36:14,575 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 12:36:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-15 12:36:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2018-10-15 12:36:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 12:36:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-10-15 12:36:14,612 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 20 [2018-10-15 12:36:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:14,612 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-10-15 12:36:14,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 12:36:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-10-15 12:36:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 12:36:14,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:14,614 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 12:36:14,614 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:14,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:14,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1982417518, now seen corresponding path program 1 times [2018-10-15 12:36:14,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:14,713 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 12:36:14,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:36:14,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 12:36:14,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 12:36:14,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 12:36:14,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 12:36:14,719 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 4 states. [2018-10-15 12:36:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:14,807 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-10-15 12:36:14,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 12:36:14,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-10-15 12:36:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:14,809 INFO L225 Difference]: With dead ends: 39 [2018-10-15 12:36:14,809 INFO L226 Difference]: Without dead ends: 39 [2018-10-15 12:36:14,810 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 12:36:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-15 12:36:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-10-15 12:36:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-15 12:36:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-10-15 12:36:14,816 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 26 [2018-10-15 12:36:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:14,817 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-10-15 12:36:14,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 12:36:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-10-15 12:36:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-15 12:36:14,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:14,818 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 12:36:14,819 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:14,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:14,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1298829207, now seen corresponding path program 1 times [2018-10-15 12:36:14,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:15,052 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 12:36:15,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:15,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 12:36:15,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 12:36:15,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 12:36:15,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-15 12:36:15,055 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 6 states. [2018-10-15 12:36:15,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:15,355 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-10-15 12:36:15,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 12:36:15,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-10-15 12:36:15,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:15,358 INFO L225 Difference]: With dead ends: 46 [2018-10-15 12:36:15,358 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 12:36:15,359 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 12:36:15,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 12:36:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-10-15 12:36:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 12:36:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-10-15 12:36:15,364 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 33 [2018-10-15 12:36:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:15,365 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-10-15 12:36:15,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 12:36:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-10-15 12:36:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 12:36:15,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:15,367 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 12:36:15,367 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:15,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:15,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1328667214, now seen corresponding path program 2 times [2018-10-15 12:36:15,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:15,494 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 12:36:15,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:15,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 12:36:15,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 12:36:15,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 12:36:15,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-15 12:36:15,496 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 6 states. [2018-10-15 12:36:15,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:15,726 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-10-15 12:36:15,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 12:36:15,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-10-15 12:36:15,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:15,728 INFO L225 Difference]: With dead ends: 79 [2018-10-15 12:36:15,728 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 12:36:15,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:36:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 12:36:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2018-10-15 12:36:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 12:36:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-10-15 12:36:15,738 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 40 [2018-10-15 12:36:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:15,739 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-10-15 12:36:15,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 12:36:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-10-15 12:36:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 12:36:15,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:15,742 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 12:36:15,742 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:15,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:15,743 INFO L82 PathProgramCache]: Analyzing trace with hash 769675477, now seen corresponding path program 3 times [2018-10-15 12:36:15,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:15,862 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 12:36:15,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:15,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 12:36:15,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 12:36:15,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 12:36:15,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:36:15,864 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 8 states. [2018-10-15 12:36:16,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:16,459 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-10-15 12:36:16,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 12:36:16,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-10-15 12:36:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:16,462 INFO L225 Difference]: With dead ends: 85 [2018-10-15 12:36:16,462 INFO L226 Difference]: Without dead ends: 85 [2018-10-15 12:36:16,462 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 12:36:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-15 12:36:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-10-15 12:36:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 12:36:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-10-15 12:36:16,470 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 60 [2018-10-15 12:36:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:16,471 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-10-15 12:36:16,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 12:36:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-10-15 12:36:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 12:36:16,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:16,473 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 12:36:16,473 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:16,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1407166769, now seen corresponding path program 4 times [2018-10-15 12:36:16,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:16,664 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 12:36:16,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:16,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 12:36:16,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 12:36:16,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 12:36:16,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:36:16,666 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 8 states. [2018-10-15 12:36:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:16,891 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-10-15 12:36:16,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 12:36:16,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-10-15 12:36:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:16,893 INFO L225 Difference]: With dead ends: 127 [2018-10-15 12:36:16,894 INFO L226 Difference]: Without dead ends: 127 [2018-10-15 12:36:16,894 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 12:36:16,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-15 12:36:16,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2018-10-15 12:36:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-15 12:36:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-10-15 12:36:16,903 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 74 [2018-10-15 12:36:16,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:16,904 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-10-15 12:36:16,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 12:36:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-10-15 12:36:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-15 12:36:16,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:16,906 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 12:36:16,907 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:16,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1946892425, now seen corresponding path program 5 times [2018-10-15 12:36:16,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:17,102 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 12:36:17,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:17,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 12:36:17,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 12:36:17,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 12:36:17,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:36:17,104 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 10 states. [2018-10-15 12:36:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:17,685 INFO L93 Difference]: Finished difference Result 138 states and 141 transitions. [2018-10-15 12:36:17,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 12:36:17,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2018-10-15 12:36:17,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:17,691 INFO L225 Difference]: With dead ends: 138 [2018-10-15 12:36:17,691 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 12:36:17,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:36:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 12:36:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2018-10-15 12:36:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 12:36:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2018-10-15 12:36:17,700 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 101 [2018-10-15 12:36:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:17,701 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2018-10-15 12:36:17,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 12:36:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2018-10-15 12:36:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 12:36:17,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:17,704 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 12:36:17,704 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:17,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:17,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1944395496, now seen corresponding path program 6 times [2018-10-15 12:36:17,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:18,056 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 12:36:18,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:18,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 12:36:18,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 12:36:18,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 12:36:18,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:36:18,058 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand 10 states. [2018-10-15 12:36:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:18,299 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2018-10-15 12:36:18,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 12:36:18,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2018-10-15 12:36:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:18,309 INFO L225 Difference]: With dead ends: 189 [2018-10-15 12:36:18,309 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 12:36:18,310 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 12:36:18,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 12:36:18,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 157. [2018-10-15 12:36:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 12:36:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2018-10-15 12:36:18,322 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 122 [2018-10-15 12:36:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:18,322 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2018-10-15 12:36:18,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 12:36:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2018-10-15 12:36:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 12:36:18,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:18,331 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 12:36:18,332 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:18,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:18,332 INFO L82 PathProgramCache]: Analyzing trace with hash -980176485, now seen corresponding path program 7 times [2018-10-15 12:36:18,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:18,613 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 12:36:18,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:18,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 12:36:18,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 12:36:18,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 12:36:18,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:36:18,615 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 12 states. [2018-10-15 12:36:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:18,951 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2018-10-15 12:36:18,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 12:36:18,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 156 [2018-10-15 12:36:18,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:18,953 INFO L225 Difference]: With dead ends: 205 [2018-10-15 12:36:18,953 INFO L226 Difference]: Without dead ends: 205 [2018-10-15 12:36:18,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:36:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-15 12:36:18,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2018-10-15 12:36:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 12:36:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2018-10-15 12:36:18,963 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 189 transitions. Word has length 156 [2018-10-15 12:36:18,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:18,963 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 189 transitions. [2018-10-15 12:36:18,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 12:36:18,964 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2018-10-15 12:36:18,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:36:18,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:18,967 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 12:36:18,967 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:18,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:18,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1429505423, now seen corresponding path program 8 times [2018-10-15 12:36:18,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:19,209 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 12:36:19,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:19,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 12:36:19,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 12:36:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 12:36:19,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:36:19,211 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. Second operand 14 states. [2018-10-15 12:36:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:19,592 INFO L93 Difference]: Finished difference Result 233 states and 237 transitions. [2018-10-15 12:36:19,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 12:36:19,593 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 184 [2018-10-15 12:36:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:19,594 INFO L225 Difference]: With dead ends: 233 [2018-10-15 12:36:19,594 INFO L226 Difference]: Without dead ends: 233 [2018-10-15 12:36:19,595 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 12:36:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-15 12:36:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 213. [2018-10-15 12:36:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-15 12:36:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2018-10-15 12:36:19,602 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 184 [2018-10-15 12:36:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:19,603 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2018-10-15 12:36:19,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 12:36:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2018-10-15 12:36:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-15 12:36:19,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:19,607 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 12:36:19,607 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:19,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:19,608 INFO L82 PathProgramCache]: Analyzing trace with hash 10152603, now seen corresponding path program 9 times [2018-10-15 12:36:19,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:20,159 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 12:36:20,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:20,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 12:36:20,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 12:36:20,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 12:36:20,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:36:20,161 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 12 states. [2018-10-15 12:36:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:20,384 INFO L93 Difference]: Finished difference Result 307 states and 313 transitions. [2018-10-15 12:36:20,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 12:36:20,385 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 212 [2018-10-15 12:36:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:20,387 INFO L225 Difference]: With dead ends: 307 [2018-10-15 12:36:20,388 INFO L226 Difference]: Without dead ends: 307 [2018-10-15 12:36:20,389 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 12:36:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-15 12:36:20,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 261. [2018-10-15 12:36:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-15 12:36:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 266 transitions. [2018-10-15 12:36:20,394 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 266 transitions. Word has length 212 [2018-10-15 12:36:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:20,395 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 266 transitions. [2018-10-15 12:36:20,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 12:36:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 266 transitions. [2018-10-15 12:36:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-15 12:36:20,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:20,399 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 12:36:20,399 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:20,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:20,399 INFO L82 PathProgramCache]: Analyzing trace with hash -416500354, now seen corresponding path program 10 times [2018-10-15 12:36:20,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:20,706 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 12:36:20,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:20,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 12:36:20,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 12:36:20,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 12:36:20,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:36:20,708 INFO L87 Difference]: Start difference. First operand 261 states and 266 transitions. Second operand 14 states. [2018-10-15 12:36:21,627 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-15 12:36:21,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:21,820 INFO L93 Difference]: Finished difference Result 355 states and 362 transitions. [2018-10-15 12:36:21,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 12:36:21,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 260 [2018-10-15 12:36:21,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:21,823 INFO L225 Difference]: With dead ends: 355 [2018-10-15 12:36:21,824 INFO L226 Difference]: Without dead ends: 355 [2018-10-15 12:36:21,825 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 12:36:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-15 12:36:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 309. [2018-10-15 12:36:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-15 12:36:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 315 transitions. [2018-10-15 12:36:21,831 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 315 transitions. Word has length 260 [2018-10-15 12:36:21,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:21,832 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 315 transitions. [2018-10-15 12:36:21,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 12:36:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 315 transitions. [2018-10-15 12:36:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-15 12:36:21,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:21,836 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 12:36:21,836 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:21,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash 843452001, now seen corresponding path program 11 times [2018-10-15 12:36:21,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:22,120 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 12:36:22,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:22,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 12:36:22,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 12:36:22,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 12:36:22,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:36:22,122 INFO L87 Difference]: Start difference. First operand 309 states and 315 transitions. Second operand 16 states. [2018-10-15 12:36:22,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:22,548 INFO L93 Difference]: Finished difference Result 381 states and 387 transitions. [2018-10-15 12:36:22,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 12:36:22,551 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 308 [2018-10-15 12:36:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:22,553 INFO L225 Difference]: With dead ends: 381 [2018-10-15 12:36:22,553 INFO L226 Difference]: Without dead ends: 381 [2018-10-15 12:36:22,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:36:22,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-15 12:36:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 351. [2018-10-15 12:36:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-15 12:36:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 357 transitions. [2018-10-15 12:36:22,561 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 357 transitions. Word has length 308 [2018-10-15 12:36:22,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:22,561 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 357 transitions. [2018-10-15 12:36:22,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 12:36:22,561 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 357 transitions. [2018-10-15 12:36:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-15 12:36:22,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:22,566 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 12:36:22,566 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:22,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:22,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1755752271, now seen corresponding path program 12 times [2018-10-15 12:36:22,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:23,950 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 12:36:23,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:23,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 12:36:23,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 12:36:23,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 12:36:23,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:36:23,952 INFO L87 Difference]: Start difference. First operand 351 states and 357 transitions. Second operand 16 states. [2018-10-15 12:36:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:24,347 INFO L93 Difference]: Finished difference Result 459 states and 467 transitions. [2018-10-15 12:36:24,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 12:36:24,348 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 350 [2018-10-15 12:36:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:24,351 INFO L225 Difference]: With dead ends: 459 [2018-10-15 12:36:24,351 INFO L226 Difference]: Without dead ends: 459 [2018-10-15 12:36:24,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:36:24,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-15 12:36:24,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 406. [2018-10-15 12:36:24,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-10-15 12:36:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 413 transitions. [2018-10-15 12:36:24,359 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 413 transitions. Word has length 350 [2018-10-15 12:36:24,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:24,360 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 413 transitions. [2018-10-15 12:36:24,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 12:36:24,360 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 413 transitions. [2018-10-15 12:36:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-15 12:36:24,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:24,363 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 12:36:24,363 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:24,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:24,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1853163575, now seen corresponding path program 13 times [2018-10-15 12:36:24,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:24,716 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 12:36:24,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:24,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 12:36:24,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 12:36:24,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 12:36:24,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:36:24,718 INFO L87 Difference]: Start difference. First operand 406 states and 413 transitions. Second operand 18 states. [2018-10-15 12:36:25,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:25,343 INFO L93 Difference]: Finished difference Result 490 states and 497 transitions. [2018-10-15 12:36:25,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 12:36:25,350 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 405 [2018-10-15 12:36:25,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:25,352 INFO L225 Difference]: With dead ends: 490 [2018-10-15 12:36:25,353 INFO L226 Difference]: Without dead ends: 490 [2018-10-15 12:36:25,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=485, Invalid=1075, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:36:25,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-10-15 12:36:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 455. [2018-10-15 12:36:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-15 12:36:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 462 transitions. [2018-10-15 12:36:25,363 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 462 transitions. Word has length 405 [2018-10-15 12:36:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:25,363 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 462 transitions. [2018-10-15 12:36:25,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 12:36:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 462 transitions. [2018-10-15 12:36:25,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-10-15 12:36:25,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:25,367 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 12:36:25,367 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:25,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:25,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1919343644, now seen corresponding path program 14 times [2018-10-15 12:36:25,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:26,101 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 12:36:26,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:26,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 12:36:26,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 12:36:26,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 12:36:26,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:36:26,103 INFO L87 Difference]: Start difference. First operand 455 states and 462 transitions. Second operand 18 states. [2018-10-15 12:36:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:27,276 INFO L93 Difference]: Finished difference Result 577 states and 586 transitions. [2018-10-15 12:36:27,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 12:36:27,277 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 454 [2018-10-15 12:36:27,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:27,280 INFO L225 Difference]: With dead ends: 577 [2018-10-15 12:36:27,280 INFO L226 Difference]: Without dead ends: 577 [2018-10-15 12:36:27,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=485, Invalid=1075, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:36:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-10-15 12:36:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 517. [2018-10-15 12:36:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-10-15 12:36:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 525 transitions. [2018-10-15 12:36:27,289 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 525 transitions. Word has length 454 [2018-10-15 12:36:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:27,290 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 525 transitions. [2018-10-15 12:36:27,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 12:36:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 525 transitions. [2018-10-15 12:36:27,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-10-15 12:36:27,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:27,294 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 12:36:27,294 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:27,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:27,295 INFO L82 PathProgramCache]: Analyzing trace with hash 660408359, now seen corresponding path program 15 times [2018-10-15 12:36:27,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:27,944 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 12:36:27,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:27,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 12:36:27,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 12:36:27,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 12:36:27,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:36:27,945 INFO L87 Difference]: Start difference. First operand 517 states and 525 transitions. Second operand 20 states. [2018-10-15 12:36:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:28,727 INFO L93 Difference]: Finished difference Result 613 states and 621 transitions. [2018-10-15 12:36:28,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 12:36:28,731 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 516 [2018-10-15 12:36:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:28,734 INFO L225 Difference]: With dead ends: 613 [2018-10-15 12:36:28,734 INFO L226 Difference]: Without dead ends: 613 [2018-10-15 12:36:28,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=609, Invalid=1371, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:36:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-10-15 12:36:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 573. [2018-10-15 12:36:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-10-15 12:36:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 581 transitions. [2018-10-15 12:36:28,746 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 581 transitions. Word has length 516 [2018-10-15 12:36:28,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:28,747 INFO L481 AbstractCegarLoop]: Abstraction has 573 states and 581 transitions. [2018-10-15 12:36:28,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 12:36:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 581 transitions. [2018-10-15 12:36:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-10-15 12:36:28,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:28,753 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 12:36:28,753 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:28,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:28,754 INFO L82 PathProgramCache]: Analyzing trace with hash -214266865, now seen corresponding path program 16 times [2018-10-15 12:36:28,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:29,666 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 12:36:29,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:29,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 12:36:29,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 12:36:29,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 12:36:29,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-10-15 12:36:29,668 INFO L87 Difference]: Start difference. First operand 573 states and 581 transitions. Second operand 22 states. [2018-10-15 12:36:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:30,626 INFO L93 Difference]: Finished difference Result 629 states and 637 transitions. [2018-10-15 12:36:30,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 12:36:30,629 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 572 [2018-10-15 12:36:30,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:30,632 INFO L225 Difference]: With dead ends: 629 [2018-10-15 12:36:30,632 INFO L226 Difference]: Without dead ends: 629 [2018-10-15 12:36:30,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=747, Invalid=1703, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:36:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-15 12:36:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2018-10-15 12:36:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-10-15 12:36:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 637 transitions. [2018-10-15 12:36:30,642 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 637 transitions. Word has length 572 [2018-10-15 12:36:30,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:30,643 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 637 transitions. [2018-10-15 12:36:30,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 12:36:30,643 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 637 transitions. [2018-10-15 12:36:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2018-10-15 12:36:30,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:30,649 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 12:36:30,649 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:30,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:30,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2046630361, now seen corresponding path program 17 times [2018-10-15 12:36:30,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:33,316 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 12:36:33,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:33,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 12:36:33,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 12:36:33,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 12:36:33,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:36:33,318 INFO L87 Difference]: Start difference. First operand 629 states and 637 transitions. Second operand 20 states. [2018-10-15 12:36:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:33,919 INFO L93 Difference]: Finished difference Result 779 states and 789 transitions. [2018-10-15 12:36:33,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 12:36:33,919 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 628 [2018-10-15 12:36:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:33,924 INFO L225 Difference]: With dead ends: 779 [2018-10-15 12:36:33,925 INFO L226 Difference]: Without dead ends: 779 [2018-10-15 12:36:33,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=609, Invalid=1371, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:36:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-15 12:36:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 705. [2018-10-15 12:36:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-10-15 12:36:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 714 transitions. [2018-10-15 12:36:33,935 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 714 transitions. Word has length 628 [2018-10-15 12:36:33,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:33,936 INFO L481 AbstractCegarLoop]: Abstraction has 705 states and 714 transitions. [2018-10-15 12:36:33,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 12:36:33,937 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 714 transitions. [2018-10-15 12:36:33,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2018-10-15 12:36:33,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:33,942 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 12:36:33,942 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:33,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:33,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1298378058, now seen corresponding path program 18 times [2018-10-15 12:36:33,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:36,357 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 12:36:36,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:36,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 12:36:36,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 12:36:36,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 12:36:36,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-10-15 12:36:36,359 INFO L87 Difference]: Start difference. First operand 705 states and 714 transitions. Second operand 22 states. [2018-10-15 12:36:37,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:37,100 INFO L93 Difference]: Finished difference Result 781 states and 791 transitions. [2018-10-15 12:36:37,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 12:36:37,101 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 704 [2018-10-15 12:36:37,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:37,107 INFO L225 Difference]: With dead ends: 781 [2018-10-15 12:36:37,107 INFO L226 Difference]: Without dead ends: 781 [2018-10-15 12:36:37,108 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 12:36:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2018-10-15 12:36:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2018-10-15 12:36:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-10-15 12:36:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 791 transitions. [2018-10-15 12:36:37,119 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 791 transitions. Word has length 704 [2018-10-15 12:36:37,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:37,120 INFO L481 AbstractCegarLoop]: Abstraction has 781 states and 791 transitions. [2018-10-15 12:36:37,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 12:36:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 791 transitions. [2018-10-15 12:36:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-10-15 12:36:37,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:37,126 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 12:36:37,127 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:37,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:37,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1521139731, now seen corresponding path program 19 times [2018-10-15 12:36:37,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:50,476 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 12:36:50,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:36:50,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [205] imperfect sequences [] total 205 [2018-10-15 12:36:50,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-10-15 12:36:50,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-10-15 12:36:50,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10407, Invalid=31413, Unknown=0, NotChecked=0, Total=41820 [2018-10-15 12:36:50,490 INFO L87 Difference]: Start difference. First operand 781 states and 791 transitions. Second operand 205 states. [2018-10-15 12:37:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:05,695 INFO L93 Difference]: Finished difference Result 32326 states and 32786 transitions. [2018-10-15 12:37:05,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2018-10-15 12:37:05,695 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 780 [2018-10-15 12:37:05,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:05,697 INFO L225 Difference]: With dead ends: 32326 [2018-10-15 12:37:05,697 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 12:37:05,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30399 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=51217, Invalid=114025, Unknown=0, NotChecked=0, Total=165242 [2018-10-15 12:37:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 12:37:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 12:37:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 12:37:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 12:37:05,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 780 [2018-10-15 12:37:05,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:05,711 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 12:37:05,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-10-15 12:37:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 12:37:05,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 12:37:05,717 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 12:37:05 BoogieIcfgContainer [2018-10-15 12:37:05,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 12:37:05,718 INFO L168 Benchmark]: Toolchain (without parser) took 52121.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 193.0 MB). Peak memory consumption was 935.4 MB. Max. memory is 7.1 GB. [2018-10-15 12:37:05,721 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 12:37:05,722 INFO L168 Benchmark]: Boogie Preprocessor took 42.68 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 12:37:05,722 INFO L168 Benchmark]: RCFGBuilder took 410.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 12:37:05,725 INFO L168 Benchmark]: TraceAbstraction took 51665.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 171.9 MB). Peak memory consumption was 914.3 MB. Max. memory is 7.1 GB. [2018-10-15 12:37:05,735 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.68 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 410.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51665.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 171.9 MB). Peak memory consumption was 914.3 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, 34 locations, 1 error locations. SAFE Result, 51.5s OverallTime, 21 OverallIterations, 100 TraceHistogramMax, 25.4s 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.9s 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.6s 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_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_12-37-05-754.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_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_12-37-05-754.csv Received shutdown request...