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/LoopUnwinding-incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:43:33,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:43:33,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:43:33,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:43:33,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:43:33,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:43:33,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:43:33,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:43:33,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:43:33,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:43:33,917 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:43:33,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:43:33,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:43:33,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:43:33,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:43:33,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:43:33,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:43:33,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:43:33,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:43:33,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:43:33,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:43:33,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:43:33,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:43:33,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:43:33,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:43:33,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:43:33,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:43:33,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:43:33,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:43:33,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:43:33,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:43:33,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:43:33,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:43:33,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:43:33,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:43:33,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:43:33,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:43:33,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:43:33,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:43:33,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:43:33,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:43:33,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:43:34,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:43:34,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:43:34,018 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:43:34,019 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:43:34,020 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/LoopUnwinding-incorrect.bpl [2019-08-05 10:43:34,020 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/LoopUnwinding-incorrect.bpl' [2019-08-05 10:43:34,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:43:34,056 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:43:34,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:34,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:43:34,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:43:34,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,091 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:43:34,092 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:43:34,092 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:43:34,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:34,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:43:34,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:43:34,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:43:34,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:43:34,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:43:34,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:43:34,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:43:34,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (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:34,179 INFO L124 BoogieDeclarations]: Specification and implementation of procedure incorrectEx given in one single declaration [2019-08-05 10:43:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure incorrectEx [2019-08-05 10:43:34,179 INFO L138 BoogieDeclarations]: Found implementation of procedure incorrectEx [2019-08-05 10:43:34,359 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:43:34,360 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:43:34,361 INFO L202 PluginConnector]: Adding new model LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:34 BoogieIcfgContainer [2019-08-05 10:43:34,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:43:34,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:43:34,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:43:34,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:43:34,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/2) ... [2019-08-05 10:43:34,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eae3bdd and model type LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:43:34, skipping insertion in model container [2019-08-05 10:43:34,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:34" (2/2) ... [2019-08-05 10:43:34,379 INFO L109 eAbstractionObserver]: Analyzing ICFG LoopUnwinding-incorrect.bpl [2019-08-05 10:43:34,392 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:43:34,400 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:43:34,417 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:43:34,443 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:43:34,444 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:43:34,444 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:43:34,444 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:43:34,444 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:43:34,444 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:43:34,444 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:43:34,445 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:43:34,445 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:43:34,458 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-08-05 10:43:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:43:34,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:34,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:43:34,470 INFO L418 AbstractCegarLoop]: === Iteration 1 === [incorrectExErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:34,476 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2019-08-05 10:43:34,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:34,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:43:34,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:34,583 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:34,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:34,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:43:34,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:43:34,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:43:34,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:34,604 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-08-05 10:43:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:34,653 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:43:34,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:43:34,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:43:34,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:34,664 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:43:34,664 INFO L226 Difference]: Without dead ends: 4 [2019-08-05 10:43:34,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-08-05 10:43:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-08-05 10:43:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-08-05 10:43:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-08-05 10:43:34,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-08-05 10:43:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:34,698 INFO L475 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-08-05 10:43:34,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:43:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-08-05 10:43:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:43:34,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:34,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:43:34,700 INFO L418 AbstractCegarLoop]: === Iteration 2 === [incorrectExErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:34,700 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2019-08-05 10:43:34,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:34,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:43:34,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:34,842 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:34,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:34,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:43:34,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:43:34,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:43:34,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:43:34,846 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-08-05 10:43:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:34,880 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:43:34,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:43:34,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:43:34,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:34,881 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:43:34,881 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:43:34,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:43:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:43:34,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:43:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:43:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:43:34,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:43:34,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:34,885 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:43:34,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:43:34,885 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:43:34,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:43:34,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:34,886 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-08-05 10:43:34,886 INFO L418 AbstractCegarLoop]: === Iteration 3 === [incorrectExErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:34,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:34,887 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2019-08-05 10:43:34,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:34,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:43:34,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:34,972 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:34,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:34,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:43:34,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:43:34,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:43:34,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:43:34,974 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 10:43:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:35,010 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:43:35,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:43:35,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:43:35,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:35,014 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:43:35,015 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:43:35,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:43:35,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:43:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:43:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:43:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:43:35,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:43:35,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:35,019 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:43:35,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:43:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:43:35,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:43:35,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:35,020 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-08-05 10:43:35,020 INFO L418 AbstractCegarLoop]: === Iteration 4 === [incorrectExErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:35,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:35,021 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2019-08-05 10:43:35,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:35,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:43:35,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:35,137 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:35,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:35,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:43:35,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:43:35,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:43:35,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:35,139 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 10:43:35,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:35,159 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:43:35,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:43:35,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:43:35,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:35,160 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:43:35,160 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:43:35,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:43:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:43:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:43:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:43:35,163 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:43:35,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:35,163 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:43:35,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:43:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:43:35,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:43:35,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:35,164 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-08-05 10:43:35,164 INFO L418 AbstractCegarLoop]: === Iteration 5 === [incorrectExErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:35,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:35,165 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2019-08-05 10:43:35,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:35,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:43:35,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:35,397 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:35,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:35,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:43:35,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:43:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:43:35,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:35,399 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 10:43:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:35,447 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:43:35,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:43:35,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:43:35,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:35,448 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:43:35,448 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:43:35,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:43:35,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:43:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:43:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:43:35,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:43:35,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:35,451 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:43:35,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:43:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:43:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:43:35,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:35,452 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-08-05 10:43:35,452 INFO L418 AbstractCegarLoop]: === Iteration 6 === [incorrectExErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:35,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2019-08-05 10:43:35,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:35,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:43:35,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:35,700 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:35,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:35,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:43:35,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:43:35,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:43:35,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:35,701 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 10:43:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:35,723 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:43:35,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:43:35,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:43:35,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:35,725 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:43:35,725 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:43:35,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:43:35,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:43:35,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:43:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:43:35,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:43:35,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:35,728 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:43:35,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:43:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:43:35,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:43:35,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:35,729 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1] [2019-08-05 10:43:35,730 INFO L418 AbstractCegarLoop]: === Iteration 7 === [incorrectExErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:35,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:35,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2019-08-05 10:43:35,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:35,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:43:35,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:35,989 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:35,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:35,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:43:35,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:43:35,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:43:35,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:35,990 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 10:43:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:36,024 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:43:36,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:43:36,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:43:36,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:36,025 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:43:36,026 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:43:36,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:36,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:43:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:43:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:43:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:43:36,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:43:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:36,029 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:43:36,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:43:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:43:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:43:36,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:36,030 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1] [2019-08-05 10:43:36,030 INFO L418 AbstractCegarLoop]: === Iteration 8 === [incorrectExErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:36,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:36,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2019-08-05 10:43:36,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:36,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:43:36,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:36,185 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:36,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:36,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:43:36,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:43:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:43:36,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:36,187 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 10:43:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:36,236 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:43:36,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:43:36,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:43:36,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:36,237 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:43:36,237 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:43:36,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:43:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:43:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:43:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:43:36,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:43:36,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:36,241 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:43:36,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:43:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:43:36,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:43:36,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:36,242 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1] [2019-08-05 10:43:36,242 INFO L418 AbstractCegarLoop]: === Iteration 9 === [incorrectExErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:36,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:36,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2019-08-05 10:43:36,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:36,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:43:36,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:36,646 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:36,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:36,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:43:36,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:43:36,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:43:36,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:36,648 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 10:43:36,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:36,673 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:43:36,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:43:36,674 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:43:36,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:36,675 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:43:36,675 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:43:36,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:43:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:43:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:43:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:43:36,679 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:43:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:36,679 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:43:36,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:43:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:43:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:43:36,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:36,680 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1] [2019-08-05 10:43:36,681 INFO L418 AbstractCegarLoop]: === Iteration 10 === [incorrectExErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:36,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2019-08-05 10:43:36,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:36,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:43:36,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:36,845 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:36,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:36,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:43:36,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:43:36,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:43:36,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:36,847 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 10:43:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:36,949 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:43:36,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:43:36,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:43:36,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:36,950 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:43:36,950 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:43:36,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:43:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:43:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:43:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:43:36,953 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:43:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:36,954 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:43:36,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:43:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:43:36,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:43:36,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:36,955 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1] [2019-08-05 10:43:36,956 INFO L418 AbstractCegarLoop]: === Iteration 11 === [incorrectExErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:36,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:36,956 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2019-08-05 10:43:36,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:36,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:43:36,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:37,193 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:43:37,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:37,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:43:37,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:43:37,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:43:37,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:37,195 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 10:43:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:37,238 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:43:37,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:43:37,239 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:43:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:37,239 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:43:37,240 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:43:37,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:43:37,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:43:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:43:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:43:37,243 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:43:37,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:37,243 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:43:37,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:43:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:43:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:37,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:37,244 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1] [2019-08-05 10:43:37,244 INFO L418 AbstractCegarLoop]: === Iteration 12 === [incorrectExErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:37,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:37,244 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2019-08-05 10:43:37,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:37,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:43:37,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:37,556 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:43:37,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:37,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:43:37,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:43:37,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:43:37,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:37,558 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 10:43:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:37,604 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:43:37,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:43:37,605 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:43:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:37,606 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:43:37,606 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:43:37,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:37,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:43:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:43:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:43:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:43:37,610 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:43:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:37,610 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:43:37,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:43:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:43:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:37,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:37,611 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1] [2019-08-05 10:43:37,611 INFO L418 AbstractCegarLoop]: === Iteration 13 === [incorrectExErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:37,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2019-08-05 10:43:37,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:37,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:43:37,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:37,763 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:43:37,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:37,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:37,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:37,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:37,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:37,765 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-05 10:43:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:37,789 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:43:37,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:37,790 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:43:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:37,791 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:43:37,791 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:43:37,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:37,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:43:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:43:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:43:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:43:37,794 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:43:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:37,794 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:43:37,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:43:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:43:37,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:37,795 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1] [2019-08-05 10:43:37,795 INFO L418 AbstractCegarLoop]: === Iteration 14 === [incorrectExErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:37,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:37,796 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2019-08-05 10:43:37,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:43:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:43:37,828 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:43:37,846 INFO L202 PluginConnector]: Adding new model LoopUnwinding-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:43:37 BoogieIcfgContainer [2019-08-05 10:43:37,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:43:37,849 INFO L168 Benchmark]: Toolchain (without parser) took 3792.07 ms. Allocated memory was 132.6 MB in the beginning and 195.6 MB in the end (delta: 62.9 MB). Free memory was 110.1 MB in the beginning and 134.7 MB in the end (delta: -24.6 MB). Peak memory consumption was 38.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:37,850 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:43:37,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.36 ms. Allocated memory is still 132.6 MB. Free memory was 110.1 MB in the beginning and 108.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:37,852 INFO L168 Benchmark]: Boogie Preprocessor took 21.47 ms. Allocated memory is still 132.6 MB. Free memory was 108.4 MB in the beginning and 107.1 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:43:37,852 INFO L168 Benchmark]: RCFGBuilder took 244.72 ms. Allocated memory is still 132.6 MB. Free memory was 107.1 MB in the beginning and 98.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:37,853 INFO L168 Benchmark]: TraceAbstraction took 3478.24 ms. Allocated memory was 132.6 MB in the beginning and 195.6 MB in the end (delta: 62.9 MB). Free memory was 98.1 MB in the beginning and 134.7 MB in the end (delta: -36.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:37,857 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.20 ms. Allocated memory is still 132.6 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.36 ms. Allocated memory is still 132.6 MB. Free memory was 110.1 MB in the beginning and 108.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.47 ms. Allocated memory is still 132.6 MB. Free memory was 108.4 MB in the beginning and 107.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 244.72 ms. Allocated memory is still 132.6 MB. Free memory was 107.1 MB in the beginning and 98.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3478.24 ms. Allocated memory was 132.6 MB in the beginning and 195.6 MB in the end (delta: 62.9 MB). Free memory was 98.1 MB in the beginning and 134.7 MB in the end (delta: -36.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 20]: assertion can be violated assertion can be violated We found a FailurePath: [L14] i := 12; VAL [i=12] [L17] i := i - 1; VAL [i=11] [L17] i := i - 1; VAL [i=10] [L17] i := i - 1; VAL [i=9] [L17] i := i - 1; VAL [i=8] [L17] i := i - 1; VAL [i=7] [L17] i := i - 1; VAL [i=6] [L17] i := i - 1; VAL [i=5] [L17] i := i - 1; VAL [i=4] [L17] i := i - 1; VAL [i=3] [L17] i := i - 1; VAL [i=2] [L17] i := i - 1; VAL [i=1] [L17] i := i - 1; VAL [i=0] [L17] i := i - 1; VAL [i=-1] [L20] assert i >= 0; VAL [i=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 1 error locations. UNSAFE Result, 3.4s OverallTime, 14 OverallIterations, 13 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 146 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 2457 SizeOfPredicates, 0 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 0/364 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...