java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/abstractInterpretation/unclassified/ManyFactsAboutX_incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:14:05,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:14:05,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:14:05,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:14:05,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:14:05,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:14:05,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:14:05,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:14:05,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:14:05,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:14:05,617 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:14:05,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:14:05,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:14:05,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:14:05,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:14:05,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:14:05,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:14:05,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:14:05,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:14:05,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:14:05,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:14:05,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:14:05,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:14:05,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:14:05,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:14:05,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:14:05,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:14:05,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:14:05,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:14:05,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:14:05,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:14:05,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:14:05,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:14:05,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:14:05,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:14:05,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:14:05,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:14:05,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:14:05,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:14:05,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:14:05,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:14:05,694 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:14:05,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:14:05,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:14:05,716 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:14:05,716 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:14:05,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/ManyFactsAboutX_incorrect.bpl [2019-08-05 11:14:05,717 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/ManyFactsAboutX_incorrect.bpl' [2019-08-05 11:14:05,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:14:05,765 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:14:05,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:05,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:14:05,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:14:05,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:05" (1/1) ... [2019-08-05 11:14:05,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:05" (1/1) ... [2019-08-05 11:14:05,801 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:14:05,801 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:14:05,801 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:14:05,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:05,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:14:05,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:14:05,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:14:05,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:05" (1/1) ... [2019-08-05 11:14:05,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:05" (1/1) ... [2019-08-05 11:14:05,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:05" (1/1) ... [2019-08-05 11:14:05,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:05" (1/1) ... [2019-08-05 11:14:05,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:05" (1/1) ... [2019-08-05 11:14:05,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:05" (1/1) ... [2019-08-05 11:14:05,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:05" (1/1) ... [2019-08-05 11:14:05,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:14:05,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:14:05,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:14:05,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:14:05,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:05" (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 [2019-08-05 11:14:05,909 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ManyFactsAboutX given in one single declaration [2019-08-05 11:14:05,910 INFO L130 BoogieDeclarations]: Found specification of procedure ManyFactsAboutX [2019-08-05 11:14:05,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ManyFactsAboutX [2019-08-05 11:14:06,236 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:14:06,237 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:14:06,238 INFO L202 PluginConnector]: Adding new model ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:06 BoogieIcfgContainer [2019-08-05 11:14:06,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:14:06,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:14:06,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:14:06,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:14:06,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:05" (1/2) ... [2019-08-05 11:14:06,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dce2e23 and model type ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:14:06, skipping insertion in model container [2019-08-05 11:14:06,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:06" (2/2) ... [2019-08-05 11:14:06,247 INFO L109 eAbstractionObserver]: Analyzing ICFG ManyFactsAboutX_incorrect.bpl [2019-08-05 11:14:06,258 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:14:06,280 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:14:06,306 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:14:06,348 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:14:06,349 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:14:06,349 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:14:06,349 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:14:06,350 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:14:06,350 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:14:06,350 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:14:06,350 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:14:06,350 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:14:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-08-05 11:14:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:14:06,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:06,376 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:14:06,379 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:06,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:06,385 INFO L82 PathProgramCache]: Analyzing trace with hash 929642, now seen corresponding path program 1 times [2019-08-05 11:14:06,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:06,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:14:06,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:06,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:06,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:14:06,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:06,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:06,560 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-08-05 11:14:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:06,627 INFO L93 Difference]: Finished difference Result 21 states and 33 transitions. [2019-08-05 11:14:06,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:06,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:14:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:06,644 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:14:06,646 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:14:06,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:06,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:14:06,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:14:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:14:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2019-08-05 11:14:06,685 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 30 transitions. Word has length 4 [2019-08-05 11:14:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:06,686 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 30 transitions. [2019-08-05 11:14:06,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 30 transitions. [2019-08-05 11:14:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:14:06,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:06,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:14:06,688 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:06,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash 28754436, now seen corresponding path program 1 times [2019-08-05 11:14:06,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:06,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:06,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:06,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:06,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:14:06,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:14:06,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:14:06,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:06,883 INFO L87 Difference]: Start difference. First operand 18 states and 30 transitions. Second operand 4 states. [2019-08-05 11:14:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:06,979 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2019-08-05 11:14:06,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:06,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:14:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:06,983 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:14:06,983 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:14:06,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:14:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:14:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:14:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2019-08-05 11:14:06,989 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 5 [2019-08-05 11:14:06,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:06,990 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 31 transitions. [2019-08-05 11:14:06,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2019-08-05 11:14:06,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:14:06,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:06,991 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:14:06,991 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:06,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:06,992 INFO L82 PathProgramCache]: Analyzing trace with hash 891323050, now seen corresponding path program 2 times [2019-08-05 11:14:06,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:07,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:14:07,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:07,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:07,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:14:07,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:14:07,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:14:07,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:07,167 INFO L87 Difference]: Start difference. First operand 19 states and 31 transitions. Second operand 5 states. [2019-08-05 11:14:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:07,215 INFO L93 Difference]: Finished difference Result 20 states and 32 transitions. [2019-08-05 11:14:07,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:07,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:14:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:07,217 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:14:07,217 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:14:07,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:07,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:14:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:14:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:14:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2019-08-05 11:14:07,223 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 32 transitions. Word has length 6 [2019-08-05 11:14:07,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:07,223 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 32 transitions. [2019-08-05 11:14:07,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:14:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2019-08-05 11:14:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:14:07,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:07,224 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 11:14:07,225 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:07,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146308, now seen corresponding path program 3 times [2019-08-05 11:14:07,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:07,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:07,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:14:07,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:07,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:14:07,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:07,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:07,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:07,362 INFO L87 Difference]: Start difference. First operand 20 states and 32 transitions. Second operand 3 states. [2019-08-05 11:14:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:07,534 INFO L93 Difference]: Finished difference Result 20 states and 31 transitions. [2019-08-05 11:14:07,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:07,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-08-05 11:14:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:07,536 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:14:07,536 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:14:07,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:14:07,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:14:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:14:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2019-08-05 11:14:07,543 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 7 [2019-08-05 11:14:07,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:07,543 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2019-08-05 11:14:07,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:07,544 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2019-08-05 11:14:07,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:14:07,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:07,545 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-08-05 11:14:07,545 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:07,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:07,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1860960776, now seen corresponding path program 1 times [2019-08-05 11:14:07,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:07,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:14:07,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:11,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:11,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:11,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:11,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:11,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 11:14:11,304 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 6 states. [2019-08-05 11:14:13,762 WARN L188 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:14:13,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:13,857 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2019-08-05 11:14:13,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:13,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 11:14:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:13,864 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:14:13,865 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:14:13,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 11:14:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:14:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:14:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:14:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2019-08-05 11:14:13,869 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 8 [2019-08-05 11:14:13,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:13,870 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 30 transitions. [2019-08-05 11:14:13,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2019-08-05 11:14:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:14:13,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:13,871 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:13,871 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:13,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:13,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1855209439, now seen corresponding path program 1 times [2019-08-05 11:14:13,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:13,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:14:13,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:17,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:17,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:17,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:17,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:17,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 11:14:17,791 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. Second operand 6 states. [2019-08-05 11:14:21,460 WARN L188 SmtUtils]: Spent 1.79 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:14:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:21,527 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. [2019-08-05 11:14:21,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:21,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 11:14:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:21,528 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:14:21,528 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:14:21,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 11:14:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:14:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:14:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:14:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-08-05 11:14:21,533 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 9 [2019-08-05 11:14:21,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:21,533 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-08-05 11:14:21,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2019-08-05 11:14:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:14:21,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:21,534 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:21,534 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:21,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:21,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1676918147, now seen corresponding path program 1 times [2019-08-05 11:14:21,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:21,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:21,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:25,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:25,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:25,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:25,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:25,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 11:14:25,305 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 6 states. [2019-08-05 11:14:29,019 WARN L188 SmtUtils]: Spent 1.81 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:14:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:29,085 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2019-08-05 11:14:29,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:29,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:14:29,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:29,086 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:14:29,086 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:14:29,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 11:14:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:14:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:14:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:14:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-08-05 11:14:29,090 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 10 [2019-08-05 11:14:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:29,090 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-08-05 11:14:29,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2019-08-05 11:14:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:14:29,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:29,091 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:29,091 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:29,092 INFO L82 PathProgramCache]: Analyzing trace with hash 444855546, now seen corresponding path program 1 times [2019-08-05 11:14:29,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:29,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:29,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:33,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:33,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:33,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:33,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:33,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 11:14:33,166 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 6 states. [2019-08-05 11:14:36,884 WARN L188 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:14:36,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:36,947 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2019-08-05 11:14:36,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:36,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-08-05 11:14:36,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:36,948 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:14:36,949 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:14:36,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 11:14:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:14:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:14:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:14:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-08-05 11:14:36,953 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 11 [2019-08-05 11:14:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:36,954 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-08-05 11:14:36,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2019-08-05 11:14:36,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:14:36,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:36,955 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:36,955 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:36,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:36,956 INFO L82 PathProgramCache]: Analyzing trace with hash 905620734, now seen corresponding path program 1 times [2019-08-05 11:14:36,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:36,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:36,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:40,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:40,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:40,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:40,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:40,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 11:14:40,775 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 6 states. [2019-08-05 11:14:44,454 WARN L188 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:14:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:44,500 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2019-08-05 11:14:44,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:44,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-08-05 11:14:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:44,501 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:14:44,501 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:14:44,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 11:14:44,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:14:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:14:44,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:14:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-08-05 11:14:44,505 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 12 [2019-08-05 11:14:44,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:44,506 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-08-05 11:14:44,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2019-08-05 11:14:44,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:14:44,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:44,506 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:44,507 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:44,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:44,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1990527467, now seen corresponding path program 1 times [2019-08-05 11:14:44,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:44,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:44,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:48,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:48,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:48,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:48,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:48,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 11:14:48,344 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 6 states. [2019-08-05 11:14:51,960 WARN L188 SmtUtils]: Spent 1.79 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:14:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:52,007 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2019-08-05 11:14:52,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:52,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-08-05 11:14:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:52,008 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:14:52,008 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:14:52,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 11:14:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:14:52,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:14:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:14:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-08-05 11:14:52,012 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2019-08-05 11:14:52,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:52,012 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-08-05 11:14:52,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2019-08-05 11:14:52,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:14:52,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:52,013 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:52,013 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:52,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:52,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1576808327, now seen corresponding path program 1 times [2019-08-05 11:14:52,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:52,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:52,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:55,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:55,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:55,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:55,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:55,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 11:14:55,778 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 6 states. [2019-08-05 11:14:59,502 WARN L188 SmtUtils]: Spent 1.84 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:14:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:59,544 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-08-05 11:14:59,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:59,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-08-05 11:14:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:59,545 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:14:59,545 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:14:59,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 11:14:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:14:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:14:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:14:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-08-05 11:14:59,548 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-08-05 11:14:59,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:59,549 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-08-05 11:14:59,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-08-05 11:14:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:14:59,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:59,550 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:59,550 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:59,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1636416720, now seen corresponding path program 1 times [2019-08-05 11:14:59,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:59,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:59,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:03,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:03,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:15:03,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:15:03,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:15:03,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 11:15:03,377 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 6 states. [2019-08-05 11:15:07,040 WARN L188 SmtUtils]: Spent 1.81 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:15:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:07,075 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-08-05 11:15:07,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:15:07,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-08-05 11:15:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:07,077 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:15:07,077 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:15:07,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 11:15:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:15:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:15:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:15:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-08-05 11:15:07,081 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2019-08-05 11:15:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:07,082 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-08-05 11:15:07,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:15:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-08-05 11:15:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:15:07,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:07,083 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:15:07,083 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:07,084 INFO L82 PathProgramCache]: Analyzing trace with hash 810690548, now seen corresponding path program 1 times [2019-08-05 11:15:07,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:07,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:15:07,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:10,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:10,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:15:10,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:15:10,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:15:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 11:15:10,856 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 6 states. [2019-08-05 11:15:14,561 WARN L188 SmtUtils]: Spent 1.79 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:15:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:14,613 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-08-05 11:15:14,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:15:14,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-08-05 11:15:14,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:14,614 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:15:14,614 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:15:14,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 11:15:14,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:15:14,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:15:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:15:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-08-05 11:15:14,619 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2019-08-05 11:15:14,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:14,619 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-08-05 11:15:14,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:15:14,620 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-08-05 11:15:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:15:14,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:14,620 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:15:14,621 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:14,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:14,621 INFO L82 PathProgramCache]: Analyzing trace with hash -638395317, now seen corresponding path program 1 times [2019-08-05 11:15:14,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:15:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:15:14,677 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:15:14,697 INFO L202 PluginConnector]: Adding new model ManyFactsAboutX_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:15:14 BoogieIcfgContainer [2019-08-05 11:15:14,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:15:14,700 INFO L168 Benchmark]: Toolchain (without parser) took 68934.66 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 110.4 MB in the beginning and 66.6 MB in the end (delta: 43.8 MB). Peak memory consumption was 106.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:14,700 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:15:14,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.03 ms. Allocated memory is still 141.0 MB. Free memory was 110.4 MB in the beginning and 108.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:14,702 INFO L168 Benchmark]: Boogie Preprocessor took 30.42 ms. Allocated memory is still 141.0 MB. Free memory was 108.5 MB in the beginning and 107.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:14,703 INFO L168 Benchmark]: RCFGBuilder took 404.01 ms. Allocated memory is still 141.0 MB. Free memory was 107.4 MB in the beginning and 95.7 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:14,704 INFO L168 Benchmark]: TraceAbstraction took 68457.38 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 95.5 MB in the beginning and 66.6 MB in the end (delta: 28.9 MB). Peak memory consumption was 91.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:14,708 INFO L335 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.21 ms. Allocated memory is still 141.0 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.03 ms. Allocated memory is still 141.0 MB. Free memory was 110.4 MB in the beginning and 108.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.42 ms. Allocated memory is still 141.0 MB. Free memory was 108.5 MB in the beginning and 107.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 404.01 ms. Allocated memory is still 141.0 MB. Free memory was 107.4 MB in the beginning and 95.7 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 68457.38 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 95.5 MB in the beginning and 66.6 MB in the end (delta: 28.9 MB). Peak memory consumption was 91.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 51]: assertion can be violated assertion can be violated We found a FailurePath: [L16] assume x % 2 == 0; [L17] assume x % 3 == 0; [L18] assume x % 5 == 0; [L19] assume x % 7 == 0; [L20] assume x % 11 == 0; [L21] assume x % 13 == 0; [L22] assume x % 17 == 0; [L23] assume x % 19 == 0; [L24] assume x % 23 == 0; [L25] assume x % 31 == 0; [L26] assume x % 41 == 0; [L28] i := 0; VAL [i=0, x=-1417755188850] [L29] COND TRUE i != 3 [L31] i := i + 1; [L32] x := x + x; VAL [i=1, x=-2835510377700] [L29] COND TRUE i != 3 [L31] i := i + 1; [L32] x := x + x; VAL [i=2, x=-5671020755400] [L29] COND TRUE i != 3 [L31] i := i + 1; [L32] x := x + x; VAL [i=3, x=-11342041510800] [L29] COND FALSE !(i != 3) VAL [i=3, x=-11342041510800] [L35] COND FALSE !(x % 2 != 0) VAL [i=3, x=-11342041510800] [L36] COND FALSE !(x % 3 != 0) VAL [i=3, x=-11342041510800] [L37] COND FALSE !(x % 5 != 0) VAL [i=3, x=-11342041510800] [L38] COND FALSE !(x % 7 != 0) VAL [i=3, x=-11342041510800] [L39] COND FALSE !(x % 11 != 0) VAL [i=3, x=-11342041510800] [L40] COND FALSE !(x % 13 != 0) VAL [i=3, x=-11342041510800] [L41] COND FALSE !(x % 17 != 0) VAL [i=3, x=-11342041510800] [L42] COND FALSE !(x % 19 != 0) VAL [i=3, x=-11342041510800] [L43] COND FALSE !(x % 23 != 0) VAL [i=3, x=-11342041510800] [L44] COND FALSE !(x % 31 != 0) VAL [i=3, x=-11342041510800] [L45] COND TRUE x % 37 != 0 VAL [i=3, x=-11342041510800] [L51] assert false; VAL [i=3, x=-11342041510800] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. UNSAFE Result, 68.3s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 32.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 539 SDslu, 133 SDs, 0 SdLazy, 264 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 65.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, 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.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 34.7s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 117 ConstructedInterpolants, 83 QuantifiedInterpolants, 12204 SizeOfPredicates, 13 NumberOfNonLiveVariables, 645 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 42/64 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...