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/ManyFactsAboutX.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:40:05,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:40:05,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:40:05,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:40:05,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:40:05,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:40:05,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:40:05,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:40:05,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:40:05,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:40:05,023 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:40:05,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:40:05,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:40:05,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:40:05,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:40:05,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:40:05,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:40:05,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:40:05,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:40:05,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:40:05,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:40:05,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:40:05,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:40:05,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:40:05,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:40:05,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:40:05,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:40:05,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:40:05,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:40:05,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:40:05,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:40:05,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:40:05,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:40:05,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:40:05,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:40:05,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:40:05,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:40:05,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:40:05,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:40:05,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:40:05,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:40:05,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:40:05,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:40:05,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:40:05,093 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:40:05,094 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:40:05,095 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/ManyFactsAboutX.bpl [2019-08-05 10:40:05,095 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/ManyFactsAboutX.bpl' [2019-08-05 10:40:05,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:40:05,135 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:40:05,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:40:05,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:40:05,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:40:05,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:05" (1/1) ... [2019-08-05 10:40:05,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:05" (1/1) ... [2019-08-05 10:40:05,167 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:40:05,168 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:40:05,168 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:40:05,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:40:05,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:40:05,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:40:05,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:40:05,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:05" (1/1) ... [2019-08-05 10:40:05,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:05" (1/1) ... [2019-08-05 10:40:05,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:05" (1/1) ... [2019-08-05 10:40:05,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:05" (1/1) ... [2019-08-05 10:40:05,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:05" (1/1) ... [2019-08-05 10:40:05,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:05" (1/1) ... [2019-08-05 10:40:05,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:05" (1/1) ... [2019-08-05 10:40:05,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:40:05,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:40:05,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:40:05,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:40:05,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:40:05,265 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ManyFactsAboutX given in one single declaration [2019-08-05 10:40:05,265 INFO L130 BoogieDeclarations]: Found specification of procedure ManyFactsAboutX [2019-08-05 10:40:05,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ManyFactsAboutX [2019-08-05 10:40:05,566 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:40:05,567 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:40:05,568 INFO L202 PluginConnector]: Adding new model ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:40:05 BoogieIcfgContainer [2019-08-05 10:40:05,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:40:05,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:40:05,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:40:05,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:40:05,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:05" (1/2) ... [2019-08-05 10:40:05,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737990a3 and model type ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:40:05, skipping insertion in model container [2019-08-05 10:40:05,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:40:05" (2/2) ... [2019-08-05 10:40:05,576 INFO L109 eAbstractionObserver]: Analyzing ICFG ManyFactsAboutX.bpl [2019-08-05 10:40:05,585 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:40:05,593 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:40:05,609 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:40:05,634 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:40:05,635 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:40:05,635 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:40:05,635 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:40:05,636 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:40:05,636 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:40:05,636 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:40:05,636 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:40:05,636 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:40:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-08-05 10:40:05,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:40:05,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:05,660 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:40:05,662 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash 929637, now seen corresponding path program 1 times [2019-08-05 10:40:05,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:05,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:40:05,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:05,880 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:40:05,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:40:05,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:40:05,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:40:05,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:40:05,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:40:05,907 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-08-05 10:40:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:05,962 INFO L93 Difference]: Finished difference Result 20 states and 31 transitions. [2019-08-05 10:40:05,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:40:05,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:40:05,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:05,977 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:40:05,977 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:40:05,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:40:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:40:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:40:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:40:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2019-08-05 10:40:06,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 4 [2019-08-05 10:40:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:06,016 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 28 transitions. [2019-08-05 10:40:06,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:40:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 28 transitions. [2019-08-05 10:40:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:40:06,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:06,017 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:40:06,017 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:06,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:06,018 INFO L82 PathProgramCache]: Analyzing trace with hash 28754431, now seen corresponding path program 1 times [2019-08-05 10:40:06,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:06,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:40:06,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:06,078 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:40:06,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:06,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:40:06,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:40:06,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:40:06,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:40:06,082 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. Second operand 4 states. [2019-08-05 10:40:06,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:06,114 INFO L93 Difference]: Finished difference Result 18 states and 29 transitions. [2019-08-05 10:40:06,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:40:06,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:40:06,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:06,118 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:40:06,118 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:40:06,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:40:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:40:06,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:40:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:40:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2019-08-05 10:40:06,126 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 5 [2019-08-05 10:40:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:06,126 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 29 transitions. [2019-08-05 10:40:06,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:40:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2019-08-05 10:40:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:40:06,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:06,127 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:40:06,128 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:06,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:06,128 INFO L82 PathProgramCache]: Analyzing trace with hash 891323045, now seen corresponding path program 2 times [2019-08-05 10:40:06,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:06,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:40:06,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:06,232 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:40:06,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:06,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:40:06,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:40:06,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:40:06,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:40:06,235 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. Second operand 5 states. [2019-08-05 10:40:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:06,301 INFO L93 Difference]: Finished difference Result 19 states and 30 transitions. [2019-08-05 10:40:06,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:40:06,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:40:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:06,305 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:40:06,305 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:40:06,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:40:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:40:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:40:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:40:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2019-08-05 10:40:06,310 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 30 transitions. Word has length 6 [2019-08-05 10:40:06,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:06,311 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 30 transitions. [2019-08-05 10:40:06,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:40:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2019-08-05 10:40:06,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:40:06,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:06,312 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 10:40:06,312 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:06,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:06,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146303, now seen corresponding path program 3 times [2019-08-05 10:40:06,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:06,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:40:06,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:40:06,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:40:06,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:40:06,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:40:06,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:40:06,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:40:06,459 INFO L87 Difference]: Start difference. First operand 19 states and 30 transitions. Second operand 3 states. [2019-08-05 10:40:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:06,592 INFO L93 Difference]: Finished difference Result 19 states and 29 transitions. [2019-08-05 10:40:06,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:40:06,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-08-05 10:40:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:06,594 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:40:06,594 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:40:06,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:40:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:40:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:40:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:40:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2019-08-05 10:40:06,601 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 7 [2019-08-05 10:40:06,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:06,602 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 29 transitions. [2019-08-05 10:40:06,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:40:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. [2019-08-05 10:40:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:40:06,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:06,603 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-08-05 10:40:06,603 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:06,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:06,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1860960771, now seen corresponding path program 1 times [2019-08-05 10:40:06,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:06,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:40:06,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:10,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:10,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:40:10,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:40:10,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:40:10,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 10:40:10,008 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. Second operand 6 states. [2019-08-05 10:40:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:11,595 INFO L93 Difference]: Finished difference Result 19 states and 28 transitions. [2019-08-05 10:40:11,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:40:11,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:40:11,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:11,598 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:40:11,598 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:40:11,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 10:40:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:40:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:40:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:40:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2019-08-05 10:40:11,603 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 8 [2019-08-05 10:40:11,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:11,604 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-08-05 10:40:11,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:40:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2019-08-05 10:40:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:40:11,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:11,605 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2019-08-05 10:40:11,605 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:11,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:11,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1855209434, now seen corresponding path program 1 times [2019-08-05 10:40:11,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:11,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:40:11,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:15,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:15,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:40:15,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:40:15,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:40:15,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 10:40:15,629 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. Second operand 6 states. [2019-08-05 10:40:19,621 WARN L188 SmtUtils]: Spent 1.87 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:40:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:19,672 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2019-08-05 10:40:19,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:40:19,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 10:40:19,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:19,674 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:40:19,674 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:40:19,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 10:40:19,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:40:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:40:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:40:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-08-05 10:40:19,677 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 9 [2019-08-05 10:40:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:19,678 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-08-05 10:40:19,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:40:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2019-08-05 10:40:19,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:40:19,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:19,679 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:40:19,679 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:19,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:19,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1676918142, now seen corresponding path program 1 times [2019-08-05 10:40:19,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:19,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:40:19,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:23,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:23,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:40:23,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:40:23,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:40:23,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 10:40:23,784 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand 6 states. [2019-08-05 10:40:28,541 WARN L188 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:40:28,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:28,586 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-08-05 10:40:28,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:40:28,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 10:40:28,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:28,588 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:40:28,588 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:40:28,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 10:40:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:40:28,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:40:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:40:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-08-05 10:40:28,593 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 10 [2019-08-05 10:40:28,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:28,593 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-08-05 10:40:28,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:40:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-08-05 10:40:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:40:28,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:28,594 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:40:28,595 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:28,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:28,595 INFO L82 PathProgramCache]: Analyzing trace with hash 444855541, now seen corresponding path program 1 times [2019-08-05 10:40:28,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:28,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:40:28,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:32,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:32,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:40:32,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:40:32,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:40:32,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 10:40:32,775 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 6 states. [2019-08-05 10:40:36,658 WARN L188 SmtUtils]: Spent 1.91 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:40:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:36,794 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2019-08-05 10:40:36,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:40:36,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-08-05 10:40:36,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:36,796 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:40:36,796 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:40:36,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 10:40:36,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:40:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:40:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:40:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-08-05 10:40:36,799 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2019-08-05 10:40:36,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:36,800 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-08-05 10:40:36,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:40:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-08-05 10:40:36,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:40:36,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:36,801 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:40:36,801 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:36,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:36,802 INFO L82 PathProgramCache]: Analyzing trace with hash 905620729, now seen corresponding path program 1 times [2019-08-05 10:40:36,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:36,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:40:36,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:40,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:40,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:40:40,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:40:40,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:40:40,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 10:40:40,679 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 6 states. [2019-08-05 10:40:44,422 WARN L188 SmtUtils]: Spent 1.84 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:40:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:44,593 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-08-05 10:40:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:40:44,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-08-05 10:40:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:44,594 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:40:44,594 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:40:44,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 10:40:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:40:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:40:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:40:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-08-05 10:40:44,598 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2019-08-05 10:40:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:44,598 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-08-05 10:40:44,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:40:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-08-05 10:40:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:40:44,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:44,599 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:40:44,599 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:44,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:44,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1990527472, now seen corresponding path program 1 times [2019-08-05 10:40:44,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:44,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:40:44,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:48,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:48,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:40:48,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:40:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:40:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 10:40:48,674 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 6 states. [2019-08-05 10:40:52,775 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:40:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:52,843 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-08-05 10:40:52,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:40:52,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-08-05 10:40:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:52,844 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:40:52,844 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:40:52,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 10:40:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:40:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:40:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:40:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-08-05 10:40:52,848 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2019-08-05 10:40:52,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:52,848 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-08-05 10:40:52,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:40:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-08-05 10:40:52,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:40:52,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:52,849 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:40:52,849 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:52,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:52,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1576808332, now seen corresponding path program 1 times [2019-08-05 10:40:52,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:52,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:40:52,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:56,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:56,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:40:56,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:40:56,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:40:56,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 10:40:56,955 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 6 states. [2019-08-05 10:41:00,895 WARN L188 SmtUtils]: Spent 1.88 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:41:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:00,928 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-08-05 10:41:00,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:41:00,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-08-05 10:41:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:00,931 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:41:00,931 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:41:00,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 10:41:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:41:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:41:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:41:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-08-05 10:41:00,934 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2019-08-05 10:41:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:00,934 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-08-05 10:41:00,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:41:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-08-05 10:41:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:41:00,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:00,935 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:00,935 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:00,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1636416725, now seen corresponding path program 1 times [2019-08-05 10:41:00,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:00,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:41:00,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:04,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:04,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:41:04,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:41:04,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:41:04,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 10:41:04,619 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 6 states. [2019-08-05 10:41:08,301 WARN L188 SmtUtils]: Spent 1.79 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:41:08,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:08,339 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-08-05 10:41:08,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:41:08,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-08-05 10:41:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:08,341 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:41:08,341 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:41:08,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 10:41:08,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:41:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:41:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:41:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-08-05 10:41:08,343 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2019-08-05 10:41:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:08,344 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-08-05 10:41:08,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:41:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-08-05 10:41:08,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:41:08,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:08,345 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:08,345 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:08,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash 810690543, now seen corresponding path program 1 times [2019-08-05 10:41:08,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:08,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:41:08,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:12,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:12,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:41:12,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:41:12,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:41:12,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 10:41:12,091 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 6 states. [2019-08-05 10:41:15,779 WARN L188 SmtUtils]: Spent 1.85 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:41:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:15,840 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 10:41:15,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:41:15,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-08-05 10:41:15,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:15,841 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:41:15,841 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:41:15,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 10:41:15,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:41:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:41:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:41:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 10:41:15,843 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-08-05 10:41:15,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:15,844 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 10:41:15,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:41:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 10:41:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:41:15,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:15,845 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:15,845 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:15,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:15,846 INFO L82 PathProgramCache]: Analyzing trace with hash -638395322, now seen corresponding path program 1 times [2019-08-05 10:41:15,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:15,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:41:15,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:19,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:19,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:41:19,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:41:19,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:41:19,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 10:41:19,908 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2019-08-05 10:41:25,585 WARN L188 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:41:25,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:25,613 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:41:25,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:41:25,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-08-05 10:41:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:25,614 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:41:25,614 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:41:25,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 10:41:25,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:41:25,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:41:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:41:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:41:25,617 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:41:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:25,618 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:41:25,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:41:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:41:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:41:25,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:25,619 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:41:25,619 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ManyFactsAboutXErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:25,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:25,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1684583274, now seen corresponding path program 1 times [2019-08-05 10:41:25,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:25,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:41:25,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:29,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:29,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:41:29,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:41:29,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:41:29,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2019-08-05 10:41:29,588 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 6 states. [2019-08-05 10:41:34,231 WARN L188 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:41:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:34,275 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:41:34,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:41:34,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-08-05 10:41:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:34,276 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:41:34,276 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:41:34,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=3, NotChecked=0, Total=42 [2019-08-05 10:41:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:41:34,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:41:34,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:41:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:41:34,277 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-08-05 10:41:34,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:34,278 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:41:34,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:41:34,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:41:34,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:41:34,284 INFO L202 PluginConnector]: Adding new model ManyFactsAboutX.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:41:34 BoogieIcfgContainer [2019-08-05 10:41:34,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:41:34,286 INFO L168 Benchmark]: Toolchain (without parser) took 89151.24 ms. Allocated memory was 132.1 MB in the beginning and 244.3 MB in the end (delta: 112.2 MB). Free memory was 109.7 MB in the beginning and 206.5 MB in the end (delta: -96.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:41:34,287 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory was 111.0 MB in the beginning and 110.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 10:41:34,288 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.64 ms. Allocated memory is still 132.1 MB. Free memory was 109.5 MB in the beginning and 107.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:41:34,289 INFO L168 Benchmark]: Boogie Preprocessor took 23.44 ms. Allocated memory is still 132.1 MB. Free memory was 107.6 MB in the beginning and 106.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:41:34,290 INFO L168 Benchmark]: RCFGBuilder took 373.70 ms. Allocated memory is still 132.1 MB. Free memory was 106.5 MB in the beginning and 95.1 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:41:34,291 INFO L168 Benchmark]: TraceAbstraction took 88714.88 ms. Allocated memory was 132.1 MB in the beginning and 244.3 MB in the end (delta: 112.2 MB). Free memory was 94.9 MB in the beginning and 206.5 MB in the end (delta: -111.5 MB). Peak memory consumption was 650.6 kB. Max. memory is 7.1 GB. [2019-08-05 10:41:34,295 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.23 ms. Allocated memory is still 132.1 MB. Free memory was 111.0 MB in the beginning and 110.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.64 ms. Allocated memory is still 132.1 MB. Free memory was 109.5 MB in the beginning and 107.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 23.44 ms. Allocated memory is still 132.1 MB. Free memory was 107.6 MB in the beginning and 106.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 373.70 ms. Allocated memory is still 132.1 MB. Free memory was 106.5 MB in the beginning and 95.1 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88714.88 ms. Allocated memory was 132.1 MB in the beginning and 244.3 MB in the end (delta: 112.2 MB). Free memory was 94.9 MB in the beginning and 206.5 MB in the end (delta: -111.5 MB). Peak memory consumption was 650.6 kB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 53]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 88.6s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 44.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 116 SDtfs, 554 SDslu, 123 SDs, 0 SdLazy, 279 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 81.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 43.2s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 150 ConstructedInterpolants, 112 QuantifiedInterpolants, 18150 SizeOfPredicates, 15 NumberOfNonLiveVariables, 807 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 50/76 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...