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/toy/InvariantSynthesis/Paper_PathInvariants_Fig1_Forward.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:43:49,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:43:49,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:43:49,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:43:49,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:43:49,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:43:49,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:43:49,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:43:49,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:43:49,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:43:49,843 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:43:49,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:43:49,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:43:49,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:43:49,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:43:49,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:43:49,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:43:49,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:43:49,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:43:49,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:43:49,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:43:49,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:43:49,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:43:49,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:43:49,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:43:49,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:43:49,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:43:49,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:43:49,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:43:49,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:43:49,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:43:49,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:43:49,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:43:49,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:43:49,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:43:49,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:43:49,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:43:49,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:43:49,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:43:49,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:43:49,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:43:49,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:43:49,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:43:49,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:43:49,916 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:43:49,917 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:43:49,918 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InvariantSynthesis/Paper_PathInvariants_Fig1_Forward.bpl [2019-08-05 10:43:49,918 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InvariantSynthesis/Paper_PathInvariants_Fig1_Forward.bpl' [2019-08-05 10:43:49,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:43:49,954 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:43:49,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:49,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:43:49,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:43:49,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:49" (1/1) ... [2019-08-05 10:43:49,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:49" (1/1) ... [2019-08-05 10:43:49,986 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:43:49,987 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:43:49,987 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:43:49,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:49,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:43:49,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:43:49,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:43:50,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:49" (1/1) ... [2019-08-05 10:43:50,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:49" (1/1) ... [2019-08-05 10:43:50,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:49" (1/1) ... [2019-08-05 10:43:50,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:49" (1/1) ... [2019-08-05 10:43:50,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:49" (1/1) ... [2019-08-05 10:43:50,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:49" (1/1) ... [2019-08-05 10:43:50,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:49" (1/1) ... [2019-08-05 10:43:50,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:43:50,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:43:50,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:43:50,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:43:50,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:49" (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 10:43:50,072 INFO L124 BoogieDeclarations]: Specification and implementation of procedure forward given in one single declaration [2019-08-05 10:43:50,073 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-08-05 10:43:50,073 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-08-05 10:43:50,477 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:43:50,478 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:43:50,485 INFO L202 PluginConnector]: Adding new model Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:50 BoogieIcfgContainer [2019-08-05 10:43:50,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:43:50,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:43:50,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:43:50,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:43:50,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:49" (1/2) ... [2019-08-05 10:43:50,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67975440 and model type Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:43:50, skipping insertion in model container [2019-08-05 10:43:50,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:50" (2/2) ... [2019-08-05 10:43:50,504 INFO L109 eAbstractionObserver]: Analyzing ICFG Paper_PathInvariants_Fig1_Forward.bpl [2019-08-05 10:43:50,527 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:43:50,534 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:43:50,548 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:43:50,575 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:43:50,576 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:43:50,576 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:43:50,576 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:43:50,576 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:43:50,576 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:43:50,577 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:43:50,577 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:43:50,577 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:43:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:43:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:43:50,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:50,599 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:43:50,602 INFO L418 AbstractCegarLoop]: === Iteration 1 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:50,610 INFO L82 PathProgramCache]: Analyzing trace with hash 30208, now seen corresponding path program 1 times [2019-08-05 10:43:50,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:50,700 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:43:50,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:50,857 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 10:43:50,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:50,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:43:50,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:43:50,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:43:50,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:43:50,877 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2019-08-05 10:43:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:50,999 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:43:51,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:43:51,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:43:51,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:51,012 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:43:51,012 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:43:51,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:43:51,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:43:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:43:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:43:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:43:51,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:43:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:51,046 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:43:51,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:43:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:43:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:43:51,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:51,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:43:51,047 INFO L418 AbstractCegarLoop]: === Iteration 2 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:51,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:51,048 INFO L82 PathProgramCache]: Analyzing trace with hash 943158, now seen corresponding path program 1 times [2019-08-05 10:43:51,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:51,065 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:43:51,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:51,303 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 10:43:51,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:51,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:43:51,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:43:51,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:43:51,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:43:51,307 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 10:43:51,626 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:43:51,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:51,645 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:43:51,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:43:51,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:43:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:51,646 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:43:51,646 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:43:51,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:51,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:43:51,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:43:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:43:51,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:43:51,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:43:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:51,651 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:43:51,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:43:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:43:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:43:51,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:51,652 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:43:51,652 INFO L418 AbstractCegarLoop]: === Iteration 3 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:51,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:51,653 INFO L82 PathProgramCache]: Analyzing trace with hash 29244608, now seen corresponding path program 2 times [2019-08-05 10:43:51,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:51,672 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:43:51,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:51,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:52,043 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 10:43:52,244 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 10:43:52,245 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 10:43:52,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:52,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:43:52,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:43:52,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:43:52,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:52,247 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 10:43:52,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:52,333 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:43:52,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:43:52,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:43:52,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:52,334 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:43:52,334 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:43:52,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:52,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:43:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:43:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:43:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:43:52,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:43:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:52,341 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:43:52,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:43:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:43:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:43:52,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:52,342 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:43:52,342 INFO L418 AbstractCegarLoop]: === Iteration 4 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:52,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:52,342 INFO L82 PathProgramCache]: Analyzing trace with hash 906589558, now seen corresponding path program 3 times [2019-08-05 10:43:52,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:52,368 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:43:52,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:52,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:52,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:52,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:52,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:43:52,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:43:52,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:43:52,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:52,687 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 10:43:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:52,778 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:43:52,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:43:52,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:43:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:52,779 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:43:52,780 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:43:52,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:52,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:43:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:43:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:43:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:43:52,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:43:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:52,784 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:43:52,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:43:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:43:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:43:52,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:52,785 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:43:52,785 INFO L418 AbstractCegarLoop]: === Iteration 5 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:52,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:52,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1960488064, now seen corresponding path program 4 times [2019-08-05 10:43:52,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:52,840 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:43:52,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:52,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:53,202 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:43:53,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:43:53,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:43:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:53,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:53,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:43:53,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:43:53,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:43:53,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:53,419 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 10:43:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:53,567 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:43:53,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:43:53,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:43:53,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:53,569 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:43:53,569 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:43:53,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:53,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:43:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:43:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:43:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:43:53,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:43:53,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:53,574 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:43:53,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:43:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:43:53,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:43:53,575 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:53,576 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:43:53,576 INFO L418 AbstractCegarLoop]: === Iteration 6 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:53,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:53,576 INFO L82 PathProgramCache]: Analyzing trace with hash -645581130, now seen corresponding path program 5 times [2019-08-05 10:43:53,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:53,630 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:43:53,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:53,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:53,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:53,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:53,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:43:54,183 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-08-05 10:43:54,319 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:54,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:54,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:43:54,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:43:54,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:43:54,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:54,321 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 10:43:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:54,450 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:43:54,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:43:54,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:43:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:54,451 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:43:54,452 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:43:54,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:43:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:43:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:43:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:43:54,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:43:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:54,456 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:43:54,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:43:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:43:54,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:43:54,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:54,457 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:43:54,457 INFO L418 AbstractCegarLoop]: === Iteration 7 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:54,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:54,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1461828160, now seen corresponding path program 6 times [2019-08-05 10:43:54,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:54,506 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:43:54,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:54,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:54,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:54,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:54,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:54,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:43:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:54,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:54,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:43:54,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:43:54,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:43:54,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:54,972 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 10:43:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:55,187 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:43:55,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:43:55,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:43:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:55,189 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:43:55,189 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:43:55,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:43:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:43:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:43:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:43:55,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:43:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:55,193 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:43:55,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:43:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:43:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:43:55,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:55,194 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:43:55,195 INFO L418 AbstractCegarLoop]: === Iteration 8 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:55,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:55,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1927960586, now seen corresponding path program 7 times [2019-08-05 10:43:55,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:55,265 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:43:55,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:55,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:55,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:55,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:43:55,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:43:55,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:43:55,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-08-05 10:43:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:55,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:55,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:43:55,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:43:55,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:43:55,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:55,800 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 10:43:56,287 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-08-05 10:43:56,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:56,303 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:43:56,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:43:56,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:43:56,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:56,309 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:43:56,309 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:43:56,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:56,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:43:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:43:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:43:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:43:56,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:43:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:56,312 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:43:56,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:43:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:43:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:43:56,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:56,313 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:43:56,313 INFO L418 AbstractCegarLoop]: === Iteration 9 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:56,314 INFO L82 PathProgramCache]: Analyzing trace with hash 362770688, now seen corresponding path program 8 times [2019-08-05 10:43:56,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:56,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:43:56,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:56,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:56,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:43:56,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:43:56,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:56,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:43:56,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:56,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-08-05 10:43:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:56,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:56,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:43:56,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:43:56,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:43:56,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:56,975 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 10:43:57,253 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-08-05 10:43:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:57,268 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:43:57,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:43:57,268 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:43:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:57,269 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:43:57,269 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:43:57,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:43:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:43:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:43:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:43:57,273 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:43:57,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:57,273 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:43:57,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:43:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:43:57,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:43:57,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:57,274 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:43:57,274 INFO L418 AbstractCegarLoop]: === Iteration 10 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:57,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:57,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1639003850, now seen corresponding path program 9 times [2019-08-05 10:43:57,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:57,410 WARN L254 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:43:57,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:57,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:57,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:43:57,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:57,672 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:43:57,894 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-08-05 10:43:57,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:43:58,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-08-05 10:43:58,071 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:58,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-08-05 10:43:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:58,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:58,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:43:58,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:43:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:43:58,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:58,482 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 10:43:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:58,742 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:43:58,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:43:58,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:43:58,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:58,744 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:43:58,745 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:43:58,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:43:58,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:43:58,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:43:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:43:58,748 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:43:58,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:58,748 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:43:58,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:43:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:43:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:58,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:58,749 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:43:58,749 INFO L418 AbstractCegarLoop]: === Iteration 11 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:58,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:58,750 INFO L82 PathProgramCache]: Analyzing trace with hash 730494912, now seen corresponding path program 10 times [2019-08-05 10:43:58,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:59,009 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:43:59,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:59,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:59,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:59,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:59,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:59,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:43:59,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:59,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-08-05 10:43:59,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-08-05 10:43:59,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-08-05 10:44:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:00,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:00,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:00,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:00,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:00,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:00,123 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 10:44:00,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:00,432 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:44:00,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:00,434 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:44:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:00,435 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:44:00,435 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:44:00,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:44:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:44:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:44:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:44:00,439 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:44:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:00,439 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:44:00,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:44:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:00,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:00,440 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:44:00,440 INFO L418 AbstractCegarLoop]: === Iteration 12 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:00,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:00,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1170512502, now seen corresponding path program 11 times [2019-08-05 10:44:00,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:00,849 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:44:00,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:01,223 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:44:01,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:01,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:01,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:44:01,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:44:01,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:44:01,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:01,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-08-05 10:44:01,631 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:01,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:01,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:01,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:01,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:01,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:01,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:01,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:01,968 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-05 10:44:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:02,350 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:44:02,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:02,351 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:44:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:02,352 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:44:02,352 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:44:02,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:02,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:44:02,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:44:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:44:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:44:02,355 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:44:02,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:02,356 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:44:02,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:44:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:02,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:02,357 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:44:02,357 INFO L418 AbstractCegarLoop]: === Iteration 13 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:02,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:02,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1926155904, now seen corresponding path program 12 times [2019-08-05 10:44:02,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:03,060 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:44:03,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:03,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:03,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:44:03,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:03,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:44:03,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:03,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-08-05 10:44:03,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:03,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-08-05 10:44:03,571 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:03,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-08-05 10:44:03,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:04,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:04,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:04,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:04,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:04,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:04,025 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-08-05 10:44:04,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:04,552 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:44:04,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:04,553 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:44:04,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:04,554 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:44:04,554 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:44:04,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:44:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:44:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:44:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:44:04,559 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:44:04,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:04,559 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:44:04,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:44:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:04,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:04,560 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:44:04,560 INFO L418 AbstractCegarLoop]: === Iteration 14 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:04,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:04,561 INFO L82 PathProgramCache]: Analyzing trace with hash -418702410, now seen corresponding path program 13 times [2019-08-05 10:44:04,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:06,492 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:44:06,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:06,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:06,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:44:06,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:06,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:44:06,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:44:06,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-08-05 10:44:06,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-08-05 10:44:06,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-08-05 10:44:06,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:07,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-08-05 10:44:07,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 12 terms [2019-08-05 10:44:07,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 13 terms [2019-08-05 10:44:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:07,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:07,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:07,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:07,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:07,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:07,531 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-08-05 10:44:07,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:07,963 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:44:07,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:07,964 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:07,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:07,965 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:44:07,965 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:44:07,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:44:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:44:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:44:07,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:44:07,968 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:44:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:07,968 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:44:07,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:44:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:07,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:07,969 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:44:07,969 INFO L418 AbstractCegarLoop]: === Iteration 15 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:07,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:07,970 INFO L82 PathProgramCache]: Analyzing trace with hash -94866112, now seen corresponding path program 14 times [2019-08-05 10:44:07,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:09,813 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:44:09,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:09,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:09,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:09,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:44:09,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:10,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:10,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-08-05 10:44:10,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-08-05 10:44:10,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-08-05 10:44:10,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-08-05 10:44:10,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:10,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:10,559 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 13 terms [2019-08-05 10:44:10,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:10,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:10,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:10,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:10,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:10,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:10,934 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-08-05 10:44:11,496 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-08-05 10:44:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:11,521 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:44:11,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:11,522 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:11,523 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:44:11,523 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:44:11,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:44:11,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:44:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:44:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:44:11,528 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:44:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:11,529 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:44:11,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:11,529 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:44:11,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:11,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:11,530 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:44:11,530 INFO L418 AbstractCegarLoop]: === Iteration 16 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:11,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:11,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1354124534, now seen corresponding path program 15 times [2019-08-05 10:44:11,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:16,976 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:16,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:17,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:17,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:17,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:17,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:44:17,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:17,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-08-05 10:44:17,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-08-05 10:44:17,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:17,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:17,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-08-05 10:44:17,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:17,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:21,092 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-08-05 10:44:21,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 14 terms [2019-08-05 10:44:21,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:21,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:21,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:21,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:21,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:21,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:21,692 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-08-05 10:44:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:22,269 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:44:22,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:22,271 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:22,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:22,271 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:44:22,272 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:44:22,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:44:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:44:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:44:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:44:22,276 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:44:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:22,276 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:44:22,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:44:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:22,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:22,277 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:44:22,277 INFO L418 AbstractCegarLoop]: === Iteration 17 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:22,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:22,278 INFO L82 PathProgramCache]: Analyzing trace with hash -971805696, now seen corresponding path program 16 times [2019-08-05 10:44:22,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:35,287 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:44:35,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:35,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:35,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:44:35,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:35,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:44:35,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:44:35,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-08-05 10:44:35,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:35,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-08-05 10:44:35,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-08-05 10:44:36,294 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-08-05 10:44:36,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:36,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:36,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:36,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 14 terms [2019-08-05 10:44:36,732 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:44:36,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-08-05 10:44:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:37,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:37,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:37,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:37,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:37,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:37,175 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-08-05 10:44:37,804 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-08-05 10:44:37,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:37,832 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:44:37,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:37,833 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:37,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:37,833 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:44:37,834 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:44:37,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:37,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:44:37,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:44:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:44:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:44:37,838 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:44:37,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:37,838 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:44:37,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:44:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:44:37,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:37,839 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:44:37,839 INFO L418 AbstractCegarLoop]: === Iteration 18 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:37,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:37,840 INFO L82 PathProgramCache]: Analyzing trace with hash -61198794, now seen corresponding path program 17 times [2019-08-05 10:44:37,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:09,541 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:45:09,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:09,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:45:09,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:45:09,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:45:09,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:45:09,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:45:09,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-08-05 10:45:09,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-08-05 10:45:09,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-08-05 10:45:09,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-08-05 10:45:10,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:45:10,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:45:10,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:45:10,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 14 terms [2019-08-05 10:45:10,714 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-08-05 10:45:10,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:45:10,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-08-05 10:45:11,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:45:11,160 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-08-05 10:45:11,346 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-08-05 10:45:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:11,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:11,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:11,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:11,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:11,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:11,354 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-08-05 10:45:12,086 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-08-05 10:45:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:12,115 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:45:12,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:12,116 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:45:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:12,117 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:45:12,117 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:45:12,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:12,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:45:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:45:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:45:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:45:12,120 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:45:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:12,121 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:45:12,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:45:12,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:12,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:12,122 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:45:12,122 INFO L418 AbstractCegarLoop]: === Iteration 19 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:12,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:12,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1897155904, now seen corresponding path program 18 times [2019-08-05 10:45:12,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:46,044 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:46:46,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:46,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:46:46,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:46:46,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:46:46,222 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:46:46,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:46:46,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-08-05 10:46:46,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-08-05 10:46:46,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-08-05 10:46:46,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-08-05 10:46:46,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-08-05 10:46:46,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:46:46,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:46:46,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:46:47,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:46:47,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:46:47,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 17 terms [2019-08-05 10:46:47,615 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-08-05 10:46:47,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 18 terms [2019-08-05 10:46:47,834 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-08-05 10:46:48,034 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-08-05 10:46:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:48,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:48,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:46:48,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:46:48,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:46:48,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:46:48,043 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-08-05 10:46:48,812 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-08-05 10:46:48,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:48,843 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:46:48,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:46:48,843 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:46:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:48,844 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:46:48,844 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:46:48,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:46:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:46:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:46:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:46:48,850 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:46:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:48,850 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:46:48,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:46:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:46:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:46:48,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:48,851 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:46:48,852 INFO L418 AbstractCegarLoop]: === Iteration 20 === [forwardErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:48,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:48,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1317715830, now seen corresponding path program 19 times [2019-08-05 10:46:48,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2019-08-05 10:47:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-08-05 10:47:00,679 INFO L285 seRefinementStrategy]: Strategy FixedRefinementStrategy was unsuccessful and could not determine trace feasibility. [2019-08-05 10:47:00,679 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:47:00,688 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,688 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,688 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,690 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,690 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,690 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,690 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,691 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,691 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,691 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,691 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,691 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,692 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,692 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:47:00,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:47:00,702 WARN L226 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-08-05 10:47:00,702 INFO L202 PluginConnector]: Adding new model Paper_PathInvariants_Fig1_Forward.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:47:00 BoogieIcfgContainer [2019-08-05 10:47:00,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:47:00,704 INFO L168 Benchmark]: Toolchain (without parser) took 190750.17 ms. Allocated memory was 134.2 MB in the beginning and 5.6 GB in the end (delta: 5.5 GB). Free memory was 110.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 5.2 GB. Max. memory is 7.1 GB. [2019-08-05 10:47:00,705 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 111.7 MB in the beginning and 111.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:47:00,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.30 ms. Allocated memory is still 134.2 MB. Free memory was 110.5 MB in the beginning and 108.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:00,707 INFO L168 Benchmark]: Boogie Preprocessor took 21.24 ms. Allocated memory is still 134.2 MB. Free memory was 108.6 MB in the beginning and 107.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:00,708 INFO L168 Benchmark]: RCFGBuilder took 474.42 ms. Allocated memory is still 134.2 MB. Free memory was 107.4 MB in the beginning and 96.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:00,708 INFO L168 Benchmark]: TraceAbstraction took 190215.50 ms. Allocated memory was 134.2 MB in the beginning and 5.6 GB in the end (delta: 5.5 GB). Free memory was 96.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 5.2 GB. Max. memory is 7.1 GB. [2019-08-05 10:47:00,714 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.22 ms. Allocated memory is still 134.2 MB. Free memory was 111.7 MB in the beginning and 111.5 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 34.30 ms. Allocated memory is still 134.2 MB. Free memory was 110.5 MB in the beginning and 108.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.24 ms. Allocated memory is still 134.2 MB. Free memory was 108.6 MB in the beginning and 107.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 474.42 ms. Allocated memory is still 134.2 MB. Free memory was 107.4 MB in the beginning and 96.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190215.50 ms. Allocated memory was 134.2 MB in the beginning and 5.6 GB in the end (delta: 5.5 GB). Free memory was 96.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 5.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 27]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L13] assume n >= 0; [L14] i := 0; [L15] a := 0; [L16] b := 0; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND TRUE i < n [L22] a := a + 2; [L23] b := b + 1; [L25] i := i + 1; [L17] COND FALSE !(i < n) [L27] assert a + b == 3 * n; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNKNOWN Result, 190.1s OverallTime, 20 OverallIterations, 19 TraceHistogramMax, 7.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 21 SDslu, 0 SDs, 0 SdLazy, 3309 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=19, 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, 19 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 160.1s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 178102 SizeOfPredicates, 19 NumberOfNonLiveVariables, 893 ConjunctsInSsa, 665 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Completed graceful shutdown