java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/abstractInterpretation/regression/non_taipan/loop-110517_Martin01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:12:35,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:12:35,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:12:35,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:12:35,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:12:35,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:12:35,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:12:35,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:12:35,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:12:35,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:12:35,170 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:12:35,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:12:35,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:12:35,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:12:35,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:12:35,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:12:35,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:12:35,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:12:35,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:12:35,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:12:35,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:12:35,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:12:35,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:12:35,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:12:35,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:12:35,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:12:35,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:12:35,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:12:35,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:12:35,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:12:35,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:12:35,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:12:35,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:12:35,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:12:35,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:12:35,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:12:35,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:12:35,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:12:35,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:12:35,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:12:35,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:12:35,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:12:35,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:12:35,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:12:35,239 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:12:35,240 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:12:35,240 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_taipan/loop-110517_Martin01.bpl [2019-08-05 11:12:35,241 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_taipan/loop-110517_Martin01.bpl' [2019-08-05 11:12:35,267 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:12:35,268 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:12:35,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:12:35,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:12:35,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:12:35,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:35" (1/1) ... [2019-08-05 11:12:35,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:35" (1/1) ... [2019-08-05 11:12:35,300 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:12:35,300 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:12:35,301 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:12:35,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:12:35,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:12:35,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:12:35,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:12:35,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:35" (1/1) ... [2019-08-05 11:12:35,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:35" (1/1) ... [2019-08-05 11:12:35,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:35" (1/1) ... [2019-08-05 11:12:35,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:35" (1/1) ... [2019-08-05 11:12:35,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:35" (1/1) ... [2019-08-05 11:12:35,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:35" (1/1) ... [2019-08-05 11:12:35,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:35" (1/1) ... [2019-08-05 11:12:35,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:12:35,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:12:35,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:12:35,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:12:35,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:12:35,397 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2019-08-05 11:12:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-08-05 11:12:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-08-05 11:12:35,665 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:12:35,665 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:12:35,667 INFO L202 PluginConnector]: Adding new model loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:12:35 BoogieIcfgContainer [2019-08-05 11:12:35,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:12:35,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:12:35,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:12:35,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:12:35,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:35" (1/2) ... [2019-08-05 11:12:35,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35abd69 and model type loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:12:35, skipping insertion in model container [2019-08-05 11:12:35,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:12:35" (2/2) ... [2019-08-05 11:12:35,680 INFO L109 eAbstractionObserver]: Analyzing ICFG loop-110517_Martin01.bpl [2019-08-05 11:12:35,690 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:12:35,698 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:12:35,716 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:12:35,749 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:12:35,750 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:12:35,750 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:12:35,751 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:12:35,751 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:12:35,751 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:12:35,752 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:12:35,752 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:12:35,752 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:12:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 11:12:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:12:35,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,784 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:12:35,787 INFO L418 AbstractCegarLoop]: === Iteration 1 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,797 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-08-05 11:12:35,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 1 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:35,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:12:35,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:12:35,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-08-05 11:12:35,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-08-05 11:12:35,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-08-05 11:12:35,905 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 2 states. [2019-08-05 11:12:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,916 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 11:12:35,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-08-05 11:12:35,917 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-08-05 11:12:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,928 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:12:35,928 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:12:35,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-08-05 11:12:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:12:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:12:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:12:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:12:35,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:12:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,965 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:12:35,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-08-05 11:12:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:12:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:12:35,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,966 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:12:35,966 INFO L418 AbstractCegarLoop]: === Iteration 2 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,967 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-08-05 11:12:35,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:36,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:12:36,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:12:36,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:12:36,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:12:36,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:12:36,015 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 3 states. [2019-08-05 11:12:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,089 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:12:36,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:12:36,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:12:36,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,090 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:12:36,090 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:12:36,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:12:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:12:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 11:12:36,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:12:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:12:36,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 11:12:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,095 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:12:36,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:12:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:12:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:12:36,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:12:36,097 INFO L418 AbstractCegarLoop]: === Iteration 3 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,097 INFO L82 PathProgramCache]: Analyzing trace with hash 28754338, now seen corresponding path program 1 times [2019-08-05 11:12:36,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:36,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:12:36,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:12:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:12:36,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:12:36,247 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-08-05 11:12:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,381 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:12:36,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:12:36,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:12:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,384 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:12:36,384 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:12:36,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:12:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:12:36,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 11:12:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:12:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:12:36,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 11:12:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,392 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:12:36,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:12:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:12:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:12:36,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,393 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 11:12:36,394 INFO L418 AbstractCegarLoop]: === Iteration 4 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993252, now seen corresponding path program 2 times [2019-08-05 11:12:36,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:36,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:12:36,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:12:36,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:12:36,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:36,530 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2019-08-05 11:12:36,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,597 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:12:36,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:12:36,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:12:36,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,598 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:12:36,598 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:12:36,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:12:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 11:12:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:12:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:12:36,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 11:12:36,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,602 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:12:36,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:12:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:12:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:12:36,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,603 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2019-08-05 11:12:36,604 INFO L418 AbstractCegarLoop]: === Iteration 5 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,604 INFO L82 PathProgramCache]: Analyzing trace with hash -664969050, now seen corresponding path program 3 times [2019-08-05 11:12:36,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:36,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:12:36,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:12:36,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:12:36,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:12:36,745 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2019-08-05 11:12:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,799 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:12:36,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:12:36,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 11:12:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,800 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:12:36,800 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:12:36,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:12:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:12:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-05 11:12:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:12:36,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:12:36,804 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 11:12:36,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,804 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:12:36,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:12:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:12:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:12:36,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,805 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2019-08-05 11:12:36,806 INFO L418 AbstractCegarLoop]: === Iteration 6 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,806 INFO L82 PathProgramCache]: Analyzing trace with hash 914748264, now seen corresponding path program 4 times [2019-08-05 11:12:36,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:36,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:12:36,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:12:36,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:12:36,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:36,984 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 7 states. [2019-08-05 11:12:37,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,127 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:12:37,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:12:37,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 11:12:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,129 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:12:37,129 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:12:37,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:12:37,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-08-05 11:12:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:12:37,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:12:37,132 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 11:12:37,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,132 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:12:37,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:12:37,133 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:12:37,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:12:37,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,133 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2019-08-05 11:12:37,134 INFO L418 AbstractCegarLoop]: === Iteration 7 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335766, now seen corresponding path program 5 times [2019-08-05 11:12:37,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:37,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:12:37,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:12:37,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:12:37,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:12:37,305 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2019-08-05 11:12:37,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,425 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:12:37,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:12:37,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 11:12:37,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,426 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:12:37,426 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:12:37,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:12:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:12:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-05 11:12:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:12:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:12:37,431 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 11:12:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,431 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:12:37,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:12:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:12:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:12:37,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,432 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2019-08-05 11:12:37,433 INFO L418 AbstractCegarLoop]: === Iteration 8 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,433 INFO L82 PathProgramCache]: Analyzing trace with hash -887996564, now seen corresponding path program 6 times [2019-08-05 11:12:37,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,649 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 11:12:37,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:12:37,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:12:37,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:12:37,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:12:37,651 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-08-05 11:12:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,702 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:12:37,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:12:37,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 11:12:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,705 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:12:37,705 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:12:37,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:12:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:12:37,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-05 11:12:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:12:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:12:37,708 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 11:12:37,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,709 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:12:37,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:12:37,709 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:12:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:12:37,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,710 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2019-08-05 11:12:37,710 INFO L418 AbstractCegarLoop]: === Iteration 9 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1333672110, now seen corresponding path program 7 times [2019-08-05 11:12:37,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:37,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:12:37,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:12:37,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:12:37,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:12:37,899 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2019-08-05 11:12:38,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,136 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:12:38,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:12:38,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-08-05 11:12:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,137 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:12:38,138 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:12:38,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 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 11:12:38,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:12:38,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-05 11:12:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:12:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:12:38,141 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 11:12:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,141 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:12:38,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:12:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:12:38,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:12:38,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,142 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1] [2019-08-05 11:12:38,142 INFO L418 AbstractCegarLoop]: === Iteration 10 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521712, now seen corresponding path program 8 times [2019-08-05 11:12:38,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:38,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:12:38,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:12:38,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:12:38,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:12:38,304 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 11 states. [2019-08-05 11:12:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,349 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:12:38,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:12:38,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 11:12:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,351 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:12:38,352 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:12:38,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:12:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:12:38,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 11:12:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:12:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:12:38,357 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 11:12:38,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,357 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:12:38,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:12:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:12:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:12:38,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,359 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1] [2019-08-05 11:12:38,359 INFO L418 AbstractCegarLoop]: === Iteration 11 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2017096114, now seen corresponding path program 9 times [2019-08-05 11:12:38,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:38,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:12:38,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:12:38,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:12:38,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:12:38,594 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-08-05 11:12:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,651 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:12:38,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:12:38,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-08-05 11:12:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,653 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:12:38,653 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:12:38,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:12:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:12:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-08-05 11:12:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:12:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:12:38,659 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 11:12:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,659 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:12:38,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:12:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:12:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:12:38,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,660 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1] [2019-08-05 11:12:38,661 INFO L418 AbstractCegarLoop]: === Iteration 12 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993268, now seen corresponding path program 10 times [2019-08-05 11:12:38,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:38,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:12:38,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:12:38,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:12:38,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:12:38,924 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 13 states. [2019-08-05 11:12:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:39,009 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:12:39,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:12:39,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-08-05 11:12:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:39,010 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:12:39,010 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:12:39,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 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 11:12:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:12:39,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-08-05 11:12:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:12:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:12:39,014 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 11:12:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:39,015 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:12:39,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:12:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:12:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:12:39,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:39,020 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1] [2019-08-05 11:12:39,021 INFO L418 AbstractCegarLoop]: === Iteration 13 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:39,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:39,021 INFO L82 PathProgramCache]: Analyzing trace with hash 107645110, now seen corresponding path program 11 times [2019-08-05 11:12:39,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:39,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:12:39,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:39,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:12:39,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:12:39,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:12:39,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:12:39,209 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-08-05 11:12:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:39,422 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:12:39,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:12:39,422 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-08-05 11:12:39,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:39,423 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:12:39,423 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:12:39,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:12:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:12:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-08-05 11:12:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:12:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:12:39,427 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-08-05 11:12:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:39,427 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:12:39,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:12:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:12:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:12:39,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:39,428 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1] [2019-08-05 11:12:39,429 INFO L418 AbstractCegarLoop]: === Iteration 14 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:39,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:39,429 INFO L82 PathProgramCache]: Analyzing trace with hash 367613816, now seen corresponding path program 12 times [2019-08-05 11:12:39,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:39,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:12:39,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:39,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:12:39,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:12:39,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:12:39,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:12:39,697 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 15 states. [2019-08-05 11:12:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,007 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:12:40,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:12:40,007 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-08-05 11:12:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,007 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:12:40,008 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:12:40,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:12:40,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:12:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-08-05 11:12:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:12:40,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:12:40,012 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-08-05 11:12:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,012 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:12:40,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:12:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:12:40,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:12:40,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,013 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1] [2019-08-05 11:12:40,014 INFO L418 AbstractCegarLoop]: === Iteration 15 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1089437114, now seen corresponding path program 13 times [2019-08-05 11:12:40,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:40,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:40,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:12:40,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:12:40,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:12:40,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:12:40,402 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 16 states. [2019-08-05 11:12:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,458 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:12:40,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:12:40,460 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-08-05 11:12:40,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,461 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:12:40,461 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:12:40,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:12:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:12:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-08-05 11:12:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:12:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:12:40,465 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 11:12:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,465 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:12:40,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:12:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:12:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:12:40,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,467 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1] [2019-08-05 11:12:40,467 INFO L418 AbstractCegarLoop]: === Iteration 16 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075460, now seen corresponding path program 14 times [2019-08-05 11:12:40,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:40,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:40,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:12:40,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:12:40,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:12:40,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:12:40,652 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 17 states. [2019-08-05 11:12:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,708 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:12:40,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:12:40,708 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-08-05 11:12:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,709 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:12:40,709 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:12:40,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:12:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:12:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-08-05 11:12:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:12:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:12:40,713 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-08-05 11:12:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,713 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:12:40,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:12:40,714 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:12:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:12:40,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,714 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1] [2019-08-05 11:12:40,715 INFO L418 AbstractCegarLoop]: === Iteration 17 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,715 INFO L82 PathProgramCache]: Analyzing trace with hash 371871934, now seen corresponding path program 15 times [2019-08-05 11:12:40,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:41,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:41,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:12:41,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:12:41,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:12:41,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:12:41,047 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 18 states. [2019-08-05 11:12:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:41,145 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:12:41,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:12:41,145 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-08-05 11:12:41,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:41,146 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:12:41,146 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:12:41,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:12:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:12:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-08-05 11:12:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:12:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:12:41,150 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-08-05 11:12:41,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:41,151 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:12:41,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:12:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:12:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:12:41,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:41,152 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1] [2019-08-05 11:12:41,152 INFO L418 AbstractCegarLoop]: === Iteration 18 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:41,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:41,152 INFO L82 PathProgramCache]: Analyzing trace with hash 886521216, now seen corresponding path program 16 times [2019-08-05 11:12:41,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:41,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:12:41,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:41,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:41,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:12:41,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:12:41,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:12:41,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:41,580 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 19 states. [2019-08-05 11:12:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:41,798 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:12:41,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:12:41,798 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-08-05 11:12:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:41,799 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:12:41,799 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:12:41,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:41,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:12:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-08-05 11:12:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:12:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:12:41,804 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-08-05 11:12:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:41,804 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:12:41,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:12:41,804 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:12:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:12:41,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:41,805 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1] [2019-08-05 11:12:41,805 INFO L418 AbstractCegarLoop]: === Iteration 19 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:41,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:41,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242178, now seen corresponding path program 17 times [2019-08-05 11:12:41,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:41,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:41,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,234 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:42,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:12:42,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:12:42,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:12:42,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:42,236 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 20 states. [2019-08-05 11:12:42,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:42,293 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:12:42,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:12:42,293 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-08-05 11:12:42,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:42,294 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:12:42,295 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:12:42,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:12:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-08-05 11:12:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:12:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:12:42,300 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-08-05 11:12:42,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:42,300 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:12:42,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:12:42,301 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:12:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:12:42,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:42,302 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1] [2019-08-05 11:12:42,302 INFO L418 AbstractCegarLoop]: === Iteration 20 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:42,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:42,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894148, now seen corresponding path program 18 times [2019-08-05 11:12:42,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:42,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:42,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:42,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:12:42,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:42,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:42,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:42,641 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 21 states. [2019-08-05 11:12:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:42,744 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:12:42,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:42,745 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-08-05 11:12:42,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:42,746 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:12:42,746 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:12:42,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:12:42,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-08-05 11:12:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:12:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:12:42,749 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-08-05 11:12:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:42,749 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:12:42,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:12:42,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:12:42,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:42,750 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1] [2019-08-05 11:12:42,750 INFO L418 AbstractCegarLoop]: === Iteration 21 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:42,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:42,750 INFO L82 PathProgramCache]: Analyzing trace with hash 264605894, now seen corresponding path program 19 times [2019-08-05 11:12:42,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:42,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:12:42,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:43,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:43,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:12:43,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:12:43,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:12:43,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:12:43,041 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2019-08-05 11:12:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:43,129 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:12:43,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:12:43,130 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-08-05 11:12:43,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:43,131 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:12:43,131 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:12:43,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:12:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:12:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-08-05 11:12:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:12:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:12:43,136 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-08-05 11:12:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:43,136 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:12:43,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:12:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:12:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:12:43,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:43,137 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1] [2019-08-05 11:12:43,138 INFO L418 AbstractCegarLoop]: === Iteration 22 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:43,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:43,138 INFO L82 PathProgramCache]: Analyzing trace with hash 883071880, now seen corresponding path program 20 times [2019-08-05 11:12:43,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:43,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:12:43,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:43,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:43,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:12:43,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:12:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:12:43,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:12:43,689 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 23 states. [2019-08-05 11:12:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:43,767 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:12:43,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:12:43,770 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-08-05 11:12:43,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:43,770 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:12:43,771 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:12:43,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:12:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:12:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-08-05 11:12:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:12:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:12:43,774 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-08-05 11:12:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:43,775 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:12:43,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:12:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:12:43,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:12:43,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:43,776 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1] [2019-08-05 11:12:43,776 INFO L418 AbstractCegarLoop]: === Iteration 23 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:43,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:43,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569718, now seen corresponding path program 21 times [2019-08-05 11:12:43,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:43,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:12:43,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:44,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:44,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:12:44,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:12:44,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:12:44,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:12:44,034 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 24 states. [2019-08-05 11:12:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:44,190 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:12:44,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:12:44,191 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-08-05 11:12:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:44,192 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:12:44,192 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:12:44,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:12:44,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:12:44,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-08-05 11:12:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:12:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:12:44,196 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-08-05 11:12:44,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:44,196 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:12:44,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:12:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:12:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:12:44,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:44,197 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1] [2019-08-05 11:12:44,197 INFO L418 AbstractCegarLoop]: === Iteration 24 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:44,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:44,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571572, now seen corresponding path program 22 times [2019-08-05 11:12:44,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:44,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:12:44,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:44,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:44,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:12:44,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:12:44,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:12:44,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:12:44,506 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 25 states. [2019-08-05 11:12:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:44,582 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:12:44,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:12:44,583 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-08-05 11:12:44,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:44,583 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:12:44,583 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:12:44,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:12:44,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:12:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-08-05 11:12:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:12:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:12:44,588 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-08-05 11:12:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:44,588 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:12:44,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:12:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:12:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:12:44,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:44,589 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1] [2019-08-05 11:12:44,590 INFO L418 AbstractCegarLoop]: === Iteration 25 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:44,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:44,590 INFO L82 PathProgramCache]: Analyzing trace with hash -62633778, now seen corresponding path program 23 times [2019-08-05 11:12:44,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:44,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:12:44,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:45,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:45,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:12:45,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:12:45,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:12:45,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:12:45,177 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 26 states. [2019-08-05 11:12:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:45,267 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:12:45,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:12:45,267 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2019-08-05 11:12:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:45,268 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:12:45,268 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:12:45,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:12:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:12:45,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-08-05 11:12:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:12:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:12:45,271 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-08-05 11:12:45,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:45,272 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:12:45,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:12:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:12:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:12:45,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:45,273 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1] [2019-08-05 11:12:45,273 INFO L418 AbstractCegarLoop]: === Iteration 26 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:45,274 INFO L82 PathProgramCache]: Analyzing trace with hash -61640304, now seen corresponding path program 24 times [2019-08-05 11:12:45,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:45,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:12:45,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:46,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:46,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:12:46,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:12:46,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:12:46,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:46,047 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 27 states. [2019-08-05 11:12:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:46,123 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:12:46,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:12:46,123 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-08-05 11:12:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:46,124 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:12:46,124 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:12:46,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:12:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-08-05 11:12:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:12:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:12:46,128 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-08-05 11:12:46,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:46,128 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:12:46,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:12:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:12:46,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:12:46,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:46,129 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1] [2019-08-05 11:12:46,130 INFO L418 AbstractCegarLoop]: === Iteration 27 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:46,130 INFO L82 PathProgramCache]: Analyzing trace with hash 893088210, now seen corresponding path program 25 times [2019-08-05 11:12:46,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:46,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:46,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:46,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:46,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:12:46,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:12:46,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:12:46,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:46,744 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 28 states. [2019-08-05 11:12:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:46,816 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:12:46,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:12:46,816 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-08-05 11:12:46,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:46,817 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:12:46,817 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:12:46,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:12:46,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-08-05 11:12:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:12:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:12:46,821 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-08-05 11:12:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:46,822 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:12:46,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:12:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:12:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:12:46,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:46,823 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1] [2019-08-05 11:12:46,823 INFO L418 AbstractCegarLoop]: === Iteration 28 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:46,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:46,823 INFO L82 PathProgramCache]: Analyzing trace with hash -735811180, now seen corresponding path program 26 times [2019-08-05 11:12:46,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:46,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:12:46,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:47,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:47,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:12:47,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:47,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:47,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:47,631 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 29 states. [2019-08-05 11:12:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:47,702 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:12:47,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:47,703 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-08-05 11:12:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:47,704 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:12:47,704 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:12:47,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:47,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:12:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-08-05 11:12:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:12:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:12:47,707 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-08-05 11:12:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:47,708 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:12:47,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:47,708 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:12:47,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:12:47,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:47,709 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1] [2019-08-05 11:12:47,709 INFO L418 AbstractCegarLoop]: === Iteration 29 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:47,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:47,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1554938070, now seen corresponding path program 27 times [2019-08-05 11:12:47,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:47,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:47,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:48,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:48,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:48,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:12:48,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:12:48,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:12:48,078 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 30 states. [2019-08-05 11:12:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:48,267 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:12:48,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:12:48,268 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2019-08-05 11:12:48,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:48,268 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:12:48,269 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:12:48,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:12:48,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:12:48,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-08-05 11:12:48,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:12:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:12:48,272 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-08-05 11:12:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:48,273 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:12:48,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:12:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:12:48,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:12:48,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:48,274 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1] [2019-08-05 11:12:48,274 INFO L418 AbstractCegarLoop]: === Iteration 30 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:48,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:48,274 INFO L82 PathProgramCache]: Analyzing trace with hash -353255528, now seen corresponding path program 28 times [2019-08-05 11:12:48,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:48,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:12:48,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:48,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:48,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:12:48,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:12:48,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:12:48,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:12:48,727 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 31 states. [2019-08-05 11:12:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:48,859 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:12:48,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:12:48,860 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-08-05 11:12:48,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:48,861 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:12:48,861 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:12:48,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:12:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:12:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-08-05 11:12:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:12:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:12:48,864 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-08-05 11:12:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:48,865 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:12:48,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:12:48,865 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:12:48,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:12:48,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:48,865 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1] [2019-08-05 11:12:48,866 INFO L418 AbstractCegarLoop]: === Iteration 31 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:48,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:48,866 INFO L82 PathProgramCache]: Analyzing trace with hash -176267814, now seen corresponding path program 29 times [2019-08-05 11:12:48,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:48,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:48,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:49,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:49,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:12:49,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:12:49,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:12:49,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:12:49,522 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 32 states. [2019-08-05 11:12:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:49,616 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:12:49,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:12:49,617 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2019-08-05 11:12:49,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:49,618 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:12:49,618 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:12:49,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:12:49,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:12:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-08-05 11:12:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:12:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:12:49,621 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-08-05 11:12:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:49,621 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:12:49,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:12:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:12:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:12:49,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:49,622 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1] [2019-08-05 11:12:49,622 INFO L418 AbstractCegarLoop]: === Iteration 32 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:49,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766500, now seen corresponding path program 30 times [2019-08-05 11:12:49,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:49,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:12:49,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:50,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:50,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:12:50,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:12:50,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:12:50,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:12:50,002 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 33 states. [2019-08-05 11:12:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:50,171 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:12:50,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:12:50,171 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-08-05 11:12:50,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:50,172 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:12:50,172 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:12:50,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:12:50,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:12:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-08-05 11:12:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:12:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:12:50,178 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-08-05 11:12:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:50,179 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:12:50,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:12:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:12:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:12:50,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:50,179 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1] [2019-08-05 11:12:50,180 INFO L418 AbstractCegarLoop]: === Iteration 33 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:50,180 INFO L82 PathProgramCache]: Analyzing trace with hash 705437918, now seen corresponding path program 31 times [2019-08-05 11:12:50,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:50,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:12:50,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:50,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:50,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:12:50,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:12:50,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:12:50,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:12:50,870 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 34 states. [2019-08-05 11:12:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:50,953 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:12:50,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:12:50,953 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2019-08-05 11:12:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:50,954 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:12:50,954 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:12:50,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:12:50,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:12:50,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-08-05 11:12:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:12:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:12:50,958 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-08-05 11:12:50,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:50,958 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:12:50,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:12:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:12:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:12:50,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:50,959 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1] [2019-08-05 11:12:50,959 INFO L418 AbstractCegarLoop]: === Iteration 34 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:50,959 INFO L82 PathProgramCache]: Analyzing trace with hash -679115360, now seen corresponding path program 32 times [2019-08-05 11:12:50,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:50,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:12:50,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:51,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:51,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:12:51,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:12:51,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:12:51,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:12:51,447 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 35 states. [2019-08-05 11:12:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:51,553 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:12:51,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:12:51,554 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-08-05 11:12:51,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:51,555 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:12:51,555 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:12:51,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:12:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:12:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-08-05 11:12:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:12:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:12:51,558 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-08-05 11:12:51,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:51,558 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:12:51,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:12:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:12:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:51,559 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:51,559 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1] [2019-08-05 11:12:51,559 INFO L418 AbstractCegarLoop]: === Iteration 35 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:51,559 INFO L82 PathProgramCache]: Analyzing trace with hash 205046242, now seen corresponding path program 33 times [2019-08-05 11:12:51,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:51,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:12:51,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:52,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:52,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:12:52,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:12:52,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:12:52,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:12:52,116 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 36 states. [2019-08-05 11:12:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:52,214 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:12:52,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:12:52,214 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2019-08-05 11:12:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:52,215 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:12:52,215 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:12:52,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:12:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:12:52,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-08-05 11:12:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:12:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:12:52,219 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-08-05 11:12:52,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:52,219 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:12:52,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:12:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:12:52,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:12:52,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:52,220 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1] [2019-08-05 11:12:52,220 INFO L418 AbstractCegarLoop]: === Iteration 36 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:52,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:52,221 INFO L82 PathProgramCache]: Analyzing trace with hash -519178844, now seen corresponding path program 34 times [2019-08-05 11:12:52,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:52,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:12:52,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:52,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:52,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:12:52,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:12:52,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:12:52,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:12:52,742 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 37 states. [2019-08-05 11:12:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:52,889 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:12:52,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:12:52,889 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-08-05 11:12:52,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:52,891 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:12:52,891 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:12:52,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:12:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:12:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-08-05 11:12:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:12:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:12:52,894 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-08-05 11:12:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:52,895 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:12:52,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:12:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:12:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:12:52,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:52,896 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1] [2019-08-05 11:12:52,896 INFO L418 AbstractCegarLoop]: === Iteration 37 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:52,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:52,896 INFO L82 PathProgramCache]: Analyzing trace with hash -714784538, now seen corresponding path program 35 times [2019-08-05 11:12:52,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:52,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:12:52,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:53,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:53,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:12:53,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:12:53,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:12:53,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:12:53,521 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 38 states. [2019-08-05 11:12:53,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:53,661 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:12:53,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:12:53,662 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2019-08-05 11:12:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:53,663 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:12:53,663 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:12:53,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:12:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:12:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-08-05 11:12:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:12:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:12:53,666 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-08-05 11:12:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:53,667 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:12:53,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:12:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:12:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:12:53,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:53,667 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1] [2019-08-05 11:12:53,668 INFO L418 AbstractCegarLoop]: === Iteration 38 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:53,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:53,668 INFO L82 PathProgramCache]: Analyzing trace with hash 286704552, now seen corresponding path program 36 times [2019-08-05 11:12:53,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:53,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:12:53,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:54,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:54,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:12:54,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:12:54,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:12:54,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:12:54,635 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 39 states. [2019-08-05 11:12:54,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:54,740 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:12:54,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:12:54,740 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-08-05 11:12:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:54,741 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:12:54,742 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:12:54,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:12:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:12:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-08-05 11:12:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:12:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:12:54,746 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-08-05 11:12:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:54,747 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:12:54,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:12:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:12:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:12:54,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:54,748 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1] [2019-08-05 11:12:54,748 INFO L418 AbstractCegarLoop]: === Iteration 39 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash 645045738, now seen corresponding path program 37 times [2019-08-05 11:12:54,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:54,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:12:54,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:55,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:55,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:12:55,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:12:55,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:12:55,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:12:55,752 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 40 states. [2019-08-05 11:12:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:55,883 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:12:55,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:12:55,884 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2019-08-05 11:12:55,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:55,885 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:12:55,885 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:12:55,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:12:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:12:55,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-08-05 11:12:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:12:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:12:55,888 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-08-05 11:12:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:55,888 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:12:55,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:12:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:12:55,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:12:55,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:55,889 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1] [2019-08-05 11:12:55,889 INFO L418 AbstractCegarLoop]: === Iteration 40 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:55,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:55,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541804, now seen corresponding path program 38 times [2019-08-05 11:12:55,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:55,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:12:55,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:57,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:57,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:57,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:12:57,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:12:57,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:12:57,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:57,049 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 41 states. [2019-08-05 11:12:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:57,160 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:12:57,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:12:57,161 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-08-05 11:12:57,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:57,162 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:12:57,162 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:12:57,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:12:57,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-08-05 11:12:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:12:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:12:57,166 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-08-05 11:12:57,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:57,166 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:12:57,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:12:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:12:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:12:57,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:57,167 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1] [2019-08-05 11:12:57,167 INFO L418 AbstractCegarLoop]: === Iteration 41 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:57,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:57,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886318, now seen corresponding path program 39 times [2019-08-05 11:12:57,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:57,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:12:57,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:57,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:57,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:12:57,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:12:57,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:12:57,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:57,814 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 42 states. [2019-08-05 11:12:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:57,989 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 11:12:57,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:12:57,990 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 81 [2019-08-05 11:12:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:57,990 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:12:57,990 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:12:57,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:12:57,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-08-05 11:12:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:12:57,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 11:12:57,993 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-08-05 11:12:57,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:57,994 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 11:12:57,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:12:57,994 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 11:12:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:12:57,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:57,994 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1] [2019-08-05 11:12:57,995 INFO L418 AbstractCegarLoop]: === Iteration 42 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:57,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:57,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427184, now seen corresponding path program 40 times [2019-08-05 11:12:57,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:58,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:12:58,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:58,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:58,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:12:58,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:12:58,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:12:58,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:12:58,730 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 43 states. [2019-08-05 11:12:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:58,839 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 11:12:58,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:12:58,841 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-08-05 11:12:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:58,841 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:12:58,842 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:12:58,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:12:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:12:58,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-08-05 11:12:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:12:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 11:12:58,844 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-08-05 11:12:58,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:58,845 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 11:12:58,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:12:58,845 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 11:12:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:12:58,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:58,846 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1] [2019-08-05 11:12:58,846 INFO L418 AbstractCegarLoop]: === Iteration 43 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:58,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:58,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011954, now seen corresponding path program 41 times [2019-08-05 11:12:58,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:58,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:12:58,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:59,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:59,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:12:59,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:12:59,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:12:59,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:12:59,500 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 44 states. [2019-08-05 11:12:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:59,611 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 11:12:59,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:12:59,612 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2019-08-05 11:12:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:59,613 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:12:59,613 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:12:59,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:12:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:12:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-08-05 11:12:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:12:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 11:12:59,618 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-08-05 11:12:59,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:59,618 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 11:12:59,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:12:59,618 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 11:12:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:12:59,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:59,619 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1] [2019-08-05 11:12:59,619 INFO L418 AbstractCegarLoop]: === Iteration 44 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:59,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:59,619 INFO L82 PathProgramCache]: Analyzing trace with hash -335715916, now seen corresponding path program 42 times [2019-08-05 11:12:59,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:59,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:12:59,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:00,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:00,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:13:00,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:13:00,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:13:00,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:13:00,653 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 45 states. [2019-08-05 11:13:00,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:00,803 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 11:13:00,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:13:00,804 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-08-05 11:13:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:00,804 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:13:00,805 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:13:00,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:13:00,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:13:00,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-08-05 11:13:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:13:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 11:13:00,808 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-08-05 11:13:00,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:00,808 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 11:13:00,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:13:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 11:13:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:13:00,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:00,809 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1] [2019-08-05 11:13:00,809 INFO L418 AbstractCegarLoop]: === Iteration 45 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:00,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:00,809 INFO L82 PathProgramCache]: Analyzing trace with hash -500569866, now seen corresponding path program 43 times [2019-08-05 11:13:00,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:00,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:13:00,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:01,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:01,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:13:01,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:13:01,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:13:01,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:13:01,585 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 46 states. [2019-08-05 11:13:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:01,709 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 11:13:01,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:13:01,709 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 89 [2019-08-05 11:13:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:01,710 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:13:01,710 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:13:01,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:13:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:13:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-08-05 11:13:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:13:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 11:13:01,713 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-08-05 11:13:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:01,714 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 11:13:01,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:13:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 11:13:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:13:01,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:01,715 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1] [2019-08-05 11:13:01,715 INFO L418 AbstractCegarLoop]: === Iteration 46 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:01,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:01,715 INFO L82 PathProgramCache]: Analyzing trace with hash -11425864, now seen corresponding path program 44 times [2019-08-05 11:13:01,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:01,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:13:01,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:02,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:02,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:13:02,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:13:02,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:13:02,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:13:02,622 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 47 states. [2019-08-05 11:13:03,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:03,025 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 11:13:03,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:13:03,025 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-08-05 11:13:03,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:03,026 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:13:03,026 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:13:03,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:13:03,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:13:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-08-05 11:13:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:13:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 11:13:03,030 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-08-05 11:13:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:03,030 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 11:13:03,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:13:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 11:13:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:13:03,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:03,031 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1] [2019-08-05 11:13:03,031 INFO L418 AbstractCegarLoop]: === Iteration 47 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:03,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:03,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524794, now seen corresponding path program 45 times [2019-08-05 11:13:03,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:03,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:13:03,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:04,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:04,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:13:04,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:13:04,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:13:04,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:13:04,095 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 48 states. [2019-08-05 11:13:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:04,223 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 11:13:04,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:13:04,224 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2019-08-05 11:13:04,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:04,225 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:13:04,225 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:13:04,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:13:04,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:13:04,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-08-05 11:13:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:13:04,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 11:13:04,228 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-08-05 11:13:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:04,228 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 11:13:04,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:13:04,229 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 11:13:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:13:04,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:04,229 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1] [2019-08-05 11:13:04,229 INFO L418 AbstractCegarLoop]: === Iteration 48 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:04,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:04,230 INFO L82 PathProgramCache]: Analyzing trace with hash 592137148, now seen corresponding path program 46 times [2019-08-05 11:13:04,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:04,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:13:04,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:05,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:05,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:13:05,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:13:05,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:13:05,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:13:05,090 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 49 states. [2019-08-05 11:13:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:05,211 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 11:13:05,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:13:05,212 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-08-05 11:13:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:05,213 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:13:05,213 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:13:05,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:13:05,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:13:05,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-08-05 11:13:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:13:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 11:13:05,216 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-08-05 11:13:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:05,217 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 11:13:05,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:13:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 11:13:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:13:05,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:05,218 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1] [2019-08-05 11:13:05,218 INFO L418 AbstractCegarLoop]: === Iteration 49 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:05,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994366, now seen corresponding path program 47 times [2019-08-05 11:13:05,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:05,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:13:05,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:06,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:06,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:13:06,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:13:06,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:13:06,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:13:06,439 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 50 states. [2019-08-05 11:13:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:06,588 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 11:13:06,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:13:06,588 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2019-08-05 11:13:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:06,589 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:13:06,589 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:13:06,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:13:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:13:06,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-08-05 11:13:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:13:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 11:13:06,592 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-08-05 11:13:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:06,593 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 11:13:06,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:13:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 11:13:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:13:06,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:06,594 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1] [2019-08-05 11:13:06,594 INFO L418 AbstractCegarLoop]: === Iteration 50 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:06,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099776, now seen corresponding path program 48 times [2019-08-05 11:13:06,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:06,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:13:06,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:07,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:07,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:13:07,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:13:07,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:13:07,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:13:07,470 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 51 states. [2019-08-05 11:13:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:07,598 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 11:13:07,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:13:07,599 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-08-05 11:13:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:07,600 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:13:07,600 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:13:07,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:13:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:13:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-08-05 11:13:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:13:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 11:13:07,603 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-08-05 11:13:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:07,604 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 11:13:07,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:13:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 11:13:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:07,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:07,605 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1] [2019-08-05 11:13:07,605 INFO L418 AbstractCegarLoop]: === Iteration 51 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:07,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:07,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1416430082, now seen corresponding path program 49 times [2019-08-05 11:13:07,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:07,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:13:07,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:08,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:08,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:13:08,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:13:08,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:13:08,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:13:08,741 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 52 states. [2019-08-05 11:13:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:08,878 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 11:13:08,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:13:08,879 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2019-08-05 11:13:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:08,880 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:13:08,880 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:13:08,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:13:08,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:13:08,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-08-05 11:13:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:13:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 11:13:08,884 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-08-05 11:13:08,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:08,884 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 11:13:08,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:13:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 11:13:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:13:08,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:08,885 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1] [2019-08-05 11:13:08,885 INFO L418 AbstractCegarLoop]: === Iteration 52 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:08,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:08,886 INFO L82 PathProgramCache]: Analyzing trace with hash -315445820, now seen corresponding path program 50 times [2019-08-05 11:13:08,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:08,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:13:08,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:10,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:10,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:13:10,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:13:10,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:13:10,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:13:10,040 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 53 states. [2019-08-05 11:13:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:10,831 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 11:13:10,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:13:10,832 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-08-05 11:13:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:10,833 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:13:10,833 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:13:10,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:13:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:13:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-08-05 11:13:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:13:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 11:13:10,837 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-08-05 11:13:10,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:10,838 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 11:13:10,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:13:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 11:13:10,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:13:10,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:10,839 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1] [2019-08-05 11:13:10,839 INFO L418 AbstractCegarLoop]: === Iteration 53 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:10,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:10,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123206, now seen corresponding path program 51 times [2019-08-05 11:13:10,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:10,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:13:10,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:12,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:12,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:13:12,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:13:12,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:13:12,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:13:12,515 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 54 states. [2019-08-05 11:13:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:12,682 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 11:13:12,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:13:12,682 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 105 [2019-08-05 11:13:12,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:12,684 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:13:12,684 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:13:12,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:13:12,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:13:12,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-08-05 11:13:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:13:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 11:13:12,688 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-08-05 11:13:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:12,688 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 11:13:12,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:13:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 11:13:12,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:13:12,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:12,689 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1] [2019-08-05 11:13:12,689 INFO L418 AbstractCegarLoop]: === Iteration 54 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:12,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:12,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541112, now seen corresponding path program 52 times [2019-08-05 11:13:12,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:12,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:13:12,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:14,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:14,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:13:14,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:13:14,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:13:14,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:13:14,122 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 55 states. [2019-08-05 11:13:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:14,266 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 11:13:14,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:13:14,266 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-08-05 11:13:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:14,267 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:13:14,267 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:13:14,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:13:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:13:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-08-05 11:13:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:13:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 11:13:14,271 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-08-05 11:13:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:14,271 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 11:13:14,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:13:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 11:13:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:13:14,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:14,272 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1] [2019-08-05 11:13:14,272 INFO L418 AbstractCegarLoop]: === Iteration 55 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:14,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127734, now seen corresponding path program 53 times [2019-08-05 11:13:14,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:14,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:13:14,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:15,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:15,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:13:15,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:13:15,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:13:15,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:13:15,458 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 56 states. [2019-08-05 11:13:15,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:15,610 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 11:13:15,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:13:15,611 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2019-08-05 11:13:15,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:15,612 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:13:15,612 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:13:15,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:13:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:13:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-08-05 11:13:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:13:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 11:13:15,615 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-08-05 11:13:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:15,616 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 11:13:15,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:13:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 11:13:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:13:15,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:15,616 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1] [2019-08-05 11:13:15,617 INFO L418 AbstractCegarLoop]: === Iteration 56 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:15,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778420, now seen corresponding path program 54 times [2019-08-05 11:13:15,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:15,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:13:15,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:17,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:17,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:13:17,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:13:17,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:13:17,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:13:17,169 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 57 states. [2019-08-05 11:13:17,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:17,403 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 11:13:17,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:13:17,403 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2019-08-05 11:13:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:17,404 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:13:17,404 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:13:17,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:13:17,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:13:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-08-05 11:13:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:13:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 11:13:17,408 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-08-05 11:13:17,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:17,408 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 11:13:17,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:13:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 11:13:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:13:17,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:17,409 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1] [2019-08-05 11:13:17,410 INFO L418 AbstractCegarLoop]: === Iteration 57 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:17,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561358, now seen corresponding path program 55 times [2019-08-05 11:13:17,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:17,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:13:17,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:18,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:18,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:13:18,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:13:18,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:13:18,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:13:18,945 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 58 states. [2019-08-05 11:13:19,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,183 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 11:13:19,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:13:19,183 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 113 [2019-08-05 11:13:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,184 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:13:19,185 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:13:19,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:13:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:13:19,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-08-05 11:13:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:13:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 11:13:19,189 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-08-05 11:13:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,189 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 11:13:19,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:13:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 11:13:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:13:19,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:19,190 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1] [2019-08-05 11:13:19,191 INFO L418 AbstractCegarLoop]: === Iteration 58 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:19,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:19,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569488, now seen corresponding path program 56 times [2019-08-05 11:13:19,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:19,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:13:19,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:20,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:20,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:13:20,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:13:20,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:13:20,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:13:20,371 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 59 states. [2019-08-05 11:13:20,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:20,519 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 11:13:20,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:13:20,519 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 115 [2019-08-05 11:13:20,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:20,520 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:13:20,521 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:13:20,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:13:20,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:13:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-08-05 11:13:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:13:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 11:13:20,524 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-08-05 11:13:20,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:20,524 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 11:13:20,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:13:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 11:13:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:13:20,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:20,525 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1] [2019-08-05 11:13:20,525 INFO L418 AbstractCegarLoop]: === Iteration 59 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:20,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196306, now seen corresponding path program 57 times [2019-08-05 11:13:20,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:20,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:13:20,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:22,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:22,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:13:22,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:13:22,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:13:22,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:13:22,109 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 60 states. [2019-08-05 11:13:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:22,269 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 11:13:22,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:13:22,270 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 117 [2019-08-05 11:13:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:22,271 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:13:22,271 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:13:22,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:13:22,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:13:22,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-08-05 11:13:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:13:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 11:13:22,274 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-08-05 11:13:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:22,274 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 11:13:22,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:13:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 11:13:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:13:22,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:22,275 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1] [2019-08-05 11:13:22,275 INFO L418 AbstractCegarLoop]: === Iteration 60 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:22,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:22,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091668, now seen corresponding path program 58 times [2019-08-05 11:13:22,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:22,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:13:22,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:23,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:23,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:13:23,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:13:23,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:13:23,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:13:23,594 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 61 states. [2019-08-05 11:13:23,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:23,745 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 11:13:23,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:13:23,745 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 119 [2019-08-05 11:13:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:23,746 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:13:23,747 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:13:23,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:13:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:13:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-08-05 11:13:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 11:13:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 11:13:23,750 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-08-05 11:13:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:23,750 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 11:13:23,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:13:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 11:13:23,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:13:23,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:23,751 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1] [2019-08-05 11:13:23,752 INFO L418 AbstractCegarLoop]: === Iteration 61 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:23,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:23,752 INFO L82 PathProgramCache]: Analyzing trace with hash -656615146, now seen corresponding path program 59 times [2019-08-05 11:13:23,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:23,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:13:23,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:25,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:25,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:13:25,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:13:25,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:13:25,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:13:25,118 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 62 states. [2019-08-05 11:13:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:25,288 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-05 11:13:25,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:13:25,288 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2019-08-05 11:13:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:25,289 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:13:25,290 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:13:25,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:13:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:13:25,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-08-05 11:13:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 11:13:25,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 11:13:25,293 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-08-05 11:13:25,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:25,293 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 11:13:25,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:13:25,294 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 11:13:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 11:13:25,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:25,294 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1] [2019-08-05 11:13:25,294 INFO L418 AbstractCegarLoop]: === Iteration 62 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:25,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:25,295 INFO L82 PathProgramCache]: Analyzing trace with hash 352915416, now seen corresponding path program 60 times [2019-08-05 11:13:25,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:25,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:13:25,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:27,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:27,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:13:27,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:13:27,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:13:27,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:13:27,026 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 63 states. [2019-08-05 11:13:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:27,210 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-08-05 11:13:27,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:13:27,211 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 123 [2019-08-05 11:13:27,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:27,212 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:13:27,212 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:13:27,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:13:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:13:27,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-08-05 11:13:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 11:13:27,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-08-05 11:13:27,215 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-08-05 11:13:27,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:27,215 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-08-05 11:13:27,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:13:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-08-05 11:13:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 11:13:27,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:27,216 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1] [2019-08-05 11:13:27,217 INFO L418 AbstractCegarLoop]: === Iteration 63 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:27,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:27,217 INFO L82 PathProgramCache]: Analyzing trace with hash -150823398, now seen corresponding path program 61 times [2019-08-05 11:13:27,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:27,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:13:27,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:28,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:28,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:13:28,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:13:28,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:13:28,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:13:28,627 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 64 states. [2019-08-05 11:13:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:28,805 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-08-05 11:13:28,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:13:28,806 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 125 [2019-08-05 11:13:28,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:28,807 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:13:28,807 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:13:28,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:13:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:13:28,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-08-05 11:13:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:13:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-08-05 11:13:28,810 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-08-05 11:13:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:28,811 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-08-05 11:13:28,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:13:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-08-05 11:13:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 11:13:28,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:28,811 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1] [2019-08-05 11:13:28,812 INFO L418 AbstractCegarLoop]: === Iteration 64 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:28,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:28,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480796, now seen corresponding path program 62 times [2019-08-05 11:13:28,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:28,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:13:28,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:31,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:31,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:13:31,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:13:31,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:13:31,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:13:31,119 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 65 states. [2019-08-05 11:13:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:31,335 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-08-05 11:13:31,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:13:31,335 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 127 [2019-08-05 11:13:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:31,336 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:13:31,336 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:13:31,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:13:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:13:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-08-05 11:13:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 11:13:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-08-05 11:13:31,339 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-08-05 11:13:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:31,339 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-08-05 11:13:31,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:13:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-08-05 11:13:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 11:13:31,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:31,340 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1] [2019-08-05 11:13:31,340 INFO L418 AbstractCegarLoop]: === Iteration 65 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:31,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:31,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870238, now seen corresponding path program 63 times [2019-08-05 11:13:31,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:31,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:13:31,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:34,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:34,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:13:34,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:13:34,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:13:34,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:13:34,400 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 66 states. [2019-08-05 11:13:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:34,583 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-05 11:13:34,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:13:34,584 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 129 [2019-08-05 11:13:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:34,585 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:13:34,585 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:13:34,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:13:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:13:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-08-05 11:13:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 11:13:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 11:13:34,589 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-08-05 11:13:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:34,589 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 11:13:34,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:13:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 11:13:34,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 11:13:34,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:34,590 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1] [2019-08-05 11:13:34,590 INFO L418 AbstractCegarLoop]: === Iteration 66 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:34,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:34,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347872, now seen corresponding path program 64 times [2019-08-05 11:13:34,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:34,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:13:34,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:36,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:36,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:13:36,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:13:36,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:13:36,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:13:36,134 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 67 states. [2019-08-05 11:13:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:36,316 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-08-05 11:13:36,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:13:36,317 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 131 [2019-08-05 11:13:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:36,318 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:13:36,318 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:13:36,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:13:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:13:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-08-05 11:13:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:13:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-08-05 11:13:36,322 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-08-05 11:13:36,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:36,322 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-08-05 11:13:36,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:13:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-08-05 11:13:36,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 11:13:36,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:36,323 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1] [2019-08-05 11:13:36,323 INFO L418 AbstractCegarLoop]: === Iteration 67 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:36,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:36,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722658, now seen corresponding path program 65 times [2019-08-05 11:13:36,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:36,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:13:36,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:38,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:38,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:13:38,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:13:38,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:13:38,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:13:38,275 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 68 states. [2019-08-05 11:13:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:38,476 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-08-05 11:13:38,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:13:38,476 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 133 [2019-08-05 11:13:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:38,477 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:13:38,477 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:13:38,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:13:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:13:38,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-08-05 11:13:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 11:13:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-08-05 11:13:38,481 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-08-05 11:13:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:38,481 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-08-05 11:13:38,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:13:38,481 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-08-05 11:13:38,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 11:13:38,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:38,482 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1] [2019-08-05 11:13:38,482 INFO L418 AbstractCegarLoop]: === Iteration 68 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:38,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:38,482 INFO L82 PathProgramCache]: Analyzing trace with hash 862905828, now seen corresponding path program 66 times [2019-08-05 11:13:38,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:38,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:13:38,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:40,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:40,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:13:40,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:13:40,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:13:40,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:13:40,470 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 69 states. [2019-08-05 11:13:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:40,738 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-08-05 11:13:40,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:13:40,739 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 135 [2019-08-05 11:13:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:40,740 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:13:40,740 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:13:40,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:13:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:13:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-08-05 11:13:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 11:13:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-08-05 11:13:40,743 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-08-05 11:13:40,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:40,744 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-08-05 11:13:40,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:13:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-08-05 11:13:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 11:13:40,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:40,745 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1] [2019-08-05 11:13:40,745 INFO L418 AbstractCegarLoop]: === Iteration 69 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:40,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:40,745 INFO L82 PathProgramCache]: Analyzing trace with hash 323690790, now seen corresponding path program 67 times [2019-08-05 11:13:40,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:40,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:13:40,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:42,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:42,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:13:42,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:13:42,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:13:42,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:13:42,772 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 70 states. [2019-08-05 11:13:43,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:43,678 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-08-05 11:13:43,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:13:43,678 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 137 [2019-08-05 11:13:43,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:43,680 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:13:43,680 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:13:43,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:13:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:13:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-08-05 11:13:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 11:13:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 11:13:43,684 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2019-08-05 11:13:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:43,685 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 11:13:43,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:13:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 11:13:43,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 11:13:43,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:43,687 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1] [2019-08-05 11:13:43,687 INFO L418 AbstractCegarLoop]: === Iteration 70 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:43,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:43,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1829082088, now seen corresponding path program 68 times [2019-08-05 11:13:43,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:43,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:13:43,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:45,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:45,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:13:45,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:13:45,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:13:45,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:13:45,607 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 71 states. [2019-08-05 11:13:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:45,888 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-08-05 11:13:45,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:13:45,889 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 139 [2019-08-05 11:13:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:45,890 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:13:45,890 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:13:45,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:13:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:13:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-08-05 11:13:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 11:13:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-08-05 11:13:45,894 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2019-08-05 11:13:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:45,894 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-08-05 11:13:45,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:13:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-08-05 11:13:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 11:13:45,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:45,895 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1] [2019-08-05 11:13:45,895 INFO L418 AbstractCegarLoop]: === Iteration 71 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:45,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140714, now seen corresponding path program 69 times [2019-08-05 11:13:45,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:45,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:13:45,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:48,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:48,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:13:48,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:13:48,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:13:48,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:13:48,305 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 72 states. [2019-08-05 11:13:48,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:48,504 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-08-05 11:13:48,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:13:48,504 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2019-08-05 11:13:48,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:48,505 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:13:48,506 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:13:48,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:13:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:13:48,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2019-08-05 11:13:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 11:13:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2019-08-05 11:13:48,508 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2019-08-05 11:13:48,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:48,508 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2019-08-05 11:13:48,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:13:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2019-08-05 11:13:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 11:13:48,509 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:48,509 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1] [2019-08-05 11:13:48,509 INFO L418 AbstractCegarLoop]: === Iteration 72 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:48,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:48,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182252, now seen corresponding path program 70 times [2019-08-05 11:13:48,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:48,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:13:48,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:50,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:50,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:13:50,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:13:50,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:13:50,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:13:50,318 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 73 states. [2019-08-05 11:13:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:50,528 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-08-05 11:13:50,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:13:50,529 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 143 [2019-08-05 11:13:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:50,529 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:13:50,529 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:13:50,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:13:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:13:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-08-05 11:13:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 11:13:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-08-05 11:13:50,532 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-08-05 11:13:50,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:50,532 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-08-05 11:13:50,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:13:50,533 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-08-05 11:13:50,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 11:13:50,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:50,533 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1] [2019-08-05 11:13:50,534 INFO L418 AbstractCegarLoop]: === Iteration 73 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:50,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:50,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279698, now seen corresponding path program 71 times [2019-08-05 11:13:50,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:50,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:13:50,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:52,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:52,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:13:52,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:13:52,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:13:52,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:13:52,931 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 74 states. [2019-08-05 11:13:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:53,191 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-08-05 11:13:53,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:13:53,192 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2019-08-05 11:13:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:53,193 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:13:53,193 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:13:53,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:13:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:13:53,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-08-05 11:13:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 11:13:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 11:13:53,196 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2019-08-05 11:13:53,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:53,197 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 11:13:53,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:13:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 11:13:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 11:13:53,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:53,198 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1] [2019-08-05 11:13:53,198 INFO L418 AbstractCegarLoop]: === Iteration 74 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:53,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:53,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400784, now seen corresponding path program 72 times [2019-08-05 11:13:53,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:53,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:13:53,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:55,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:55,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:13:55,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:13:55,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:13:55,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:13:55,307 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 75 states. [2019-08-05 11:13:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:55,537 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-08-05 11:13:55,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:13:55,538 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 147 [2019-08-05 11:13:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:55,539 INFO L225 Difference]: With dead ends: 151 [2019-08-05 11:13:55,539 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 11:13:55,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:13:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 11:13:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-08-05 11:13:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 11:13:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-08-05 11:13:55,543 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2019-08-05 11:13:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:55,543 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2019-08-05 11:13:55,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:13:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2019-08-05 11:13:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 11:13:55,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:55,545 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1] [2019-08-05 11:13:55,545 INFO L418 AbstractCegarLoop]: === Iteration 75 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:55,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937522, now seen corresponding path program 73 times [2019-08-05 11:13:55,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:55,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:13:55,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:57,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:57,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:13:57,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:13:57,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:13:57,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:13:57,853 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 76 states. [2019-08-05 11:13:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:58,069 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-08-05 11:13:58,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:13:58,069 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 149 [2019-08-05 11:13:58,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:58,070 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:13:58,070 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:13:58,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:13:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:13:58,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-08-05 11:13:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 11:13:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-08-05 11:13:58,074 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2019-08-05 11:13:58,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:58,074 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-08-05 11:13:58,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:13:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-08-05 11:13:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 11:13:58,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:58,075 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1] [2019-08-05 11:13:58,076 INFO L418 AbstractCegarLoop]: === Iteration 76 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:58,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:58,076 INFO L82 PathProgramCache]: Analyzing trace with hash -386543116, now seen corresponding path program 74 times [2019-08-05 11:13:58,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:58,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:13:58,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:00,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:00,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:14:00,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:14:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:14:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:14:00,256 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 77 states. [2019-08-05 11:14:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,514 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-08-05 11:14:00,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:14:00,515 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 151 [2019-08-05 11:14:00,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,516 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:14:00,516 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:14:00,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:14:00,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:14:00,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-08-05 11:14:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 11:14:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-08-05 11:14:00,519 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2019-08-05 11:14:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,519 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-08-05 11:14:00,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:14:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-08-05 11:14:00,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 11:14:00,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,520 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1] [2019-08-05 11:14:00,520 INFO L418 AbstractCegarLoop]: === Iteration 77 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:00,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868810, now seen corresponding path program 75 times [2019-08-05 11:14:00,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:03,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:03,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:14:03,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:14:03,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:14:03,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:14:03,296 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 78 states. [2019-08-05 11:14:03,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:03,525 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-08-05 11:14:03,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:14:03,525 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2019-08-05 11:14:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:03,526 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:14:03,526 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:14:03,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:14:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:14:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-08-05 11:14:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 11:14:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-08-05 11:14:03,529 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2019-08-05 11:14:03,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:03,529 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-08-05 11:14:03,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:14:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-08-05 11:14:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 11:14:03,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:03,530 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1] [2019-08-05 11:14:03,531 INFO L418 AbstractCegarLoop]: === Iteration 78 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:03,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash -300419080, now seen corresponding path program 76 times [2019-08-05 11:14:03,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:03,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:14:03,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:05,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:05,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:14:05,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:14:05,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:14:05,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:14:05,903 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 79 states. [2019-08-05 11:14:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:06,125 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-08-05 11:14:06,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:14:06,126 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2019-08-05 11:14:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:06,127 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:14:06,127 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:14:06,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:14:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:14:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-08-05 11:14:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 11:14:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-08-05 11:14:06,130 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2019-08-05 11:14:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:06,131 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-08-05 11:14:06,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:14:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-08-05 11:14:06,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 11:14:06,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:06,132 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1] [2019-08-05 11:14:06,132 INFO L418 AbstractCegarLoop]: === Iteration 79 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:06,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:06,132 INFO L82 PathProgramCache]: Analyzing trace with hash -940048838, now seen corresponding path program 77 times [2019-08-05 11:14:06,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:06,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:14:06,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:08,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:08,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:14:08,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:14:08,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:14:08,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:14:08,722 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 80 states. [2019-08-05 11:14:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:08,941 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-08-05 11:14:08,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:14:08,941 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 157 [2019-08-05 11:14:08,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:08,943 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:14:08,943 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:14:08,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:14:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:14:08,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-08-05 11:14:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 11:14:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-08-05 11:14:08,947 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2019-08-05 11:14:08,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:08,948 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-08-05 11:14:08,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:14:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-08-05 11:14:08,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 11:14:08,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:08,949 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1] [2019-08-05 11:14:08,949 INFO L418 AbstractCegarLoop]: === Iteration 80 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:08,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:08,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1443922948, now seen corresponding path program 78 times [2019-08-05 11:14:08,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:08,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:14:08,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:11,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:11,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:11,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:14:11,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:14:11,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:14:11,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:14:11,161 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 81 states. [2019-08-05 11:14:11,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:11,387 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-08-05 11:14:11,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:14:11,388 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 159 [2019-08-05 11:14:11,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:11,389 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:14:11,389 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 11:14:11,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:14:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 11:14:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-08-05 11:14:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 11:14:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-08-05 11:14:11,392 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2019-08-05 11:14:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:11,393 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-08-05 11:14:11,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:14:11,393 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-08-05 11:14:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 11:14:11,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:11,394 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1] [2019-08-05 11:14:11,394 INFO L418 AbstractCegarLoop]: === Iteration 81 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:11,394 INFO L82 PathProgramCache]: Analyzing trace with hash -335638210, now seen corresponding path program 79 times [2019-08-05 11:14:11,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:11,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:14:11,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:14,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:14,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:14:14,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:14:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:14:14,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:14:14,093 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 82 states. [2019-08-05 11:14:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:14,322 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-08-05 11:14:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:14:14,323 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 161 [2019-08-05 11:14:14,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:14,324 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:14:14,324 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:14:14,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:14:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:14:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-08-05 11:14:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 11:14:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-05 11:14:14,328 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2019-08-05 11:14:14,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:14,329 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-05 11:14:14,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:14:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-05 11:14:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 11:14:14,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:14,330 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1] [2019-08-05 11:14:14,330 INFO L418 AbstractCegarLoop]: === Iteration 82 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:14,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:14,331 INFO L82 PathProgramCache]: Analyzing trace with hash -425894400, now seen corresponding path program 80 times [2019-08-05 11:14:14,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:14,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:14:14,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:16,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:16,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:14:16,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:14:16,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:14:16,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:14:16,809 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 83 states. [2019-08-05 11:14:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:17,054 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-08-05 11:14:17,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:14:17,054 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 163 [2019-08-05 11:14:17,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:17,055 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:14:17,055 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:14:17,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:14:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:14:17,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-08-05 11:14:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 11:14:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-08-05 11:14:17,058 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2019-08-05 11:14:17,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:17,058 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-08-05 11:14:17,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:14:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-08-05 11:14:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 11:14:17,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:17,059 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1] [2019-08-05 11:14:17,059 INFO L418 AbstractCegarLoop]: === Iteration 83 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:17,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:17,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747070, now seen corresponding path program 81 times [2019-08-05 11:14:17,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:17,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:14:17,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:19,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:19,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:14:19,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:14:19,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:14:19,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:14:19,731 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 84 states. [2019-08-05 11:14:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:20,340 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-08-05 11:14:20,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:14:20,341 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 165 [2019-08-05 11:14:20,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:20,342 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:14:20,342 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:14:20,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:14:20,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:14:20,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-08-05 11:14:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 11:14:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-08-05 11:14:20,346 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2019-08-05 11:14:20,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:20,346 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2019-08-05 11:14:20,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:14:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2019-08-05 11:14:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 11:14:20,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:20,347 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1] [2019-08-05 11:14:20,347 INFO L418 AbstractCegarLoop]: === Iteration 84 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:20,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:20,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688708, now seen corresponding path program 82 times [2019-08-05 11:14:20,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:20,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:14:20,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:23,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:23,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:14:23,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:14:23,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:14:23,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:14:23,367 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 85 states. [2019-08-05 11:14:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:23,600 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-08-05 11:14:23,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:14:23,600 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 167 [2019-08-05 11:14:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:23,601 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:14:23,602 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 11:14:23,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:14:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 11:14:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-08-05 11:14:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 11:14:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-08-05 11:14:23,605 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2019-08-05 11:14:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:23,605 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-08-05 11:14:23,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:14:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-08-05 11:14:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-05 11:14:23,606 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:23,606 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1] [2019-08-05 11:14:23,606 INFO L418 AbstractCegarLoop]: === Iteration 85 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:23,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:23,607 INFO L82 PathProgramCache]: Analyzing trace with hash 261181766, now seen corresponding path program 83 times [2019-08-05 11:14:23,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:23,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:14:23,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:26,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:26,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:14:26,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:14:26,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:14:26,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:14:26,056 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 86 states. [2019-08-05 11:14:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:26,297 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-08-05 11:14:26,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:14:26,298 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 169 [2019-08-05 11:14:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:26,299 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:14:26,299 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:14:26,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:14:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:14:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-08-05 11:14:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 11:14:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-08-05 11:14:26,303 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2019-08-05 11:14:26,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:26,303 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-08-05 11:14:26,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:14:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-08-05 11:14:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 11:14:26,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:26,305 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1] [2019-08-05 11:14:26,305 INFO L418 AbstractCegarLoop]: === Iteration 86 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:26,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:26,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452168, now seen corresponding path program 84 times [2019-08-05 11:14:26,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:26,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:14:26,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:29,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:29,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:14:29,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:14:29,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:14:29,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:14:29,098 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 87 states. [2019-08-05 11:14:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:29,357 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-08-05 11:14:29,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:14:29,358 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 171 [2019-08-05 11:14:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:29,359 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:14:29,359 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 11:14:29,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:14:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 11:14:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-08-05 11:14:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-08-05 11:14:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-08-05 11:14:29,363 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2019-08-05 11:14:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:29,364 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2019-08-05 11:14:29,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:14:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2019-08-05 11:14:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 11:14:29,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:29,366 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1] [2019-08-05 11:14:29,366 INFO L418 AbstractCegarLoop]: === Iteration 87 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:29,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:29,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212746, now seen corresponding path program 85 times [2019-08-05 11:14:29,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:29,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:14:29,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:32,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:32,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:14:32,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:14:32,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:14:32,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:14:32,033 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 88 states. [2019-08-05 11:14:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:32,276 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-08-05 11:14:32,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:14:32,276 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 173 [2019-08-05 11:14:32,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:32,278 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:14:32,278 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:14:32,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:14:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:14:32,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-08-05 11:14:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 11:14:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-08-05 11:14:32,282 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2019-08-05 11:14:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:32,282 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-08-05 11:14:32,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:14:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-08-05 11:14:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 11:14:32,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:32,283 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1] [2019-08-05 11:14:32,284 INFO L418 AbstractCegarLoop]: === Iteration 88 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:32,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301836, now seen corresponding path program 86 times [2019-08-05 11:14:32,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:32,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:14:32,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:35,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:35,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:14:35,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:14:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:14:35,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:14:35,212 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 89 states. [2019-08-05 11:14:35,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:35,475 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-08-05 11:14:35,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:14:35,475 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 175 [2019-08-05 11:14:35,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:35,477 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:14:35,477 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 11:14:35,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:14:35,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 11:14:35,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-08-05 11:14:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 11:14:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-08-05 11:14:35,480 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2019-08-05 11:14:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:35,480 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-08-05 11:14:35,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:14:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-08-05 11:14:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 11:14:35,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:35,481 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1] [2019-08-05 11:14:35,481 INFO L418 AbstractCegarLoop]: === Iteration 89 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:35,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:35,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593998, now seen corresponding path program 87 times [2019-08-05 11:14:35,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:35,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:14:35,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:38,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:38,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:14:38,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:14:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:14:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:14:38,408 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 90 states. [2019-08-05 11:14:38,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:38,662 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-08-05 11:14:38,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:14:38,662 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 177 [2019-08-05 11:14:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:38,663 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:14:38,663 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:14:38,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:14:38,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:14:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-08-05 11:14:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 11:14:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-08-05 11:14:38,667 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2019-08-05 11:14:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:38,668 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-08-05 11:14:38,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:14:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-08-05 11:14:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 11:14:38,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:38,669 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1] [2019-08-05 11:14:38,669 INFO L418 AbstractCegarLoop]: === Iteration 90 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:38,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:38,669 INFO L82 PathProgramCache]: Analyzing trace with hash -221736432, now seen corresponding path program 88 times [2019-08-05 11:14:38,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:38,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:14:38,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:41,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:41,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:14:41,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:14:41,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:14:41,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:14:41,424 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 91 states. [2019-08-05 11:14:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:41,676 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-08-05 11:14:41,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:14:41,677 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 179 [2019-08-05 11:14:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:41,678 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:14:41,678 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:14:41,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:14:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:14:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-08-05 11:14:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 11:14:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-08-05 11:14:41,682 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2019-08-05 11:14:41,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:41,682 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-08-05 11:14:41,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:14:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-08-05 11:14:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 11:14:41,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:41,683 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1] [2019-08-05 11:14:41,683 INFO L418 AbstractCegarLoop]: === Iteration 91 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:41,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1659531858, now seen corresponding path program 89 times [2019-08-05 11:14:41,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:41,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:14:41,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:44,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:44,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:14:44,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:14:44,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:14:44,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:14:44,789 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 92 states. [2019-08-05 11:14:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:45,058 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-08-05 11:14:45,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:14:45,058 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 181 [2019-08-05 11:14:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:45,059 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:14:45,060 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:14:45,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:14:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:14:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-08-05 11:14:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 11:14:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-08-05 11:14:45,063 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2019-08-05 11:14:45,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:45,063 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-08-05 11:14:45,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:14:45,063 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-08-05 11:14:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 11:14:45,064 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:45,064 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1] [2019-08-05 11:14:45,065 INFO L418 AbstractCegarLoop]: === Iteration 92 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:45,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1377126932, now seen corresponding path program 90 times [2019-08-05 11:14:45,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:45,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:14:45,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:47,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:47,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:14:47,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:14:47,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:14:47,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:14:47,901 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 93 states. [2019-08-05 11:14:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:48,227 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-08-05 11:14:48,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:14:48,227 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 183 [2019-08-05 11:14:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:48,228 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:14:48,228 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 11:14:48,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:14:48,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 11:14:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-08-05 11:14:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 11:14:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-08-05 11:14:48,231 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2019-08-05 11:14:48,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:48,231 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-08-05 11:14:48,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:14:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-08-05 11:14:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 11:14:48,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:48,233 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1] [2019-08-05 11:14:48,233 INFO L418 AbstractCegarLoop]: === Iteration 93 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:48,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:48,233 INFO L82 PathProgramCache]: Analyzing trace with hash 568932694, now seen corresponding path program 91 times [2019-08-05 11:14:48,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:48,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:14:48,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:51,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:51,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:14:51,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:14:51,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:14:51,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:14:51,518 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 94 states. [2019-08-05 11:14:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:51,790 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-08-05 11:14:51,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:14:51,790 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 185 [2019-08-05 11:14:51,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:51,791 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:14:51,791 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:14:51,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:14:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:14:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-08-05 11:14:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 11:14:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-08-05 11:14:51,794 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2019-08-05 11:14:51,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:51,795 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-08-05 11:14:51,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:14:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-08-05 11:14:51,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 11:14:51,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:51,796 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1] [2019-08-05 11:14:51,796 INFO L418 AbstractCegarLoop]: === Iteration 94 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:51,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:51,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1283350552, now seen corresponding path program 92 times [2019-08-05 11:14:51,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:51,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:14:51,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:55,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:55,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:14:55,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:14:55,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:14:55,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:14:55,110 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 95 states. [2019-08-05 11:14:55,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:55,386 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-08-05 11:14:55,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:14:55,386 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 187 [2019-08-05 11:14:55,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:55,387 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:14:55,387 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:14:55,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:14:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:14:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-08-05 11:14:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 11:14:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-08-05 11:14:55,391 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2019-08-05 11:14:55,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:55,391 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-08-05 11:14:55,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:14:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-08-05 11:14:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 11:14:55,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:55,392 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1] [2019-08-05 11:14:55,393 INFO L418 AbstractCegarLoop]: === Iteration 95 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:55,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:55,393 INFO L82 PathProgramCache]: Analyzing trace with hash 644144730, now seen corresponding path program 93 times [2019-08-05 11:14:55,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:55,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:14:55,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:58,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:58,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:14:58,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:14:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:14:58,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:14:58,911 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 96 states. [2019-08-05 11:14:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:59,194 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-08-05 11:14:59,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:14:59,194 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 189 [2019-08-05 11:14:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:59,196 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:14:59,196 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:14:59,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:14:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:14:59,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-08-05 11:14:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 11:14:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-08-05 11:14:59,199 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2019-08-05 11:14:59,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:59,200 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-08-05 11:14:59,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:14:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-08-05 11:14:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-08-05 11:14:59,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:59,201 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1] [2019-08-05 11:14:59,201 INFO L418 AbstractCegarLoop]: === Iteration 96 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:59,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:59,201 INFO L82 PathProgramCache]: Analyzing trace with hash 547673116, now seen corresponding path program 94 times [2019-08-05 11:14:59,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:59,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:14:59,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:02,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:02,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:15:02,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:15:02,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:15:02,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:15:02,869 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 97 states. [2019-08-05 11:15:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:03,149 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-08-05 11:15:03,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:15:03,149 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 191 [2019-08-05 11:15:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:03,151 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:15:03,151 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 11:15:03,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:15:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 11:15:03,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-08-05 11:15:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-08-05 11:15:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-08-05 11:15:03,154 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2019-08-05 11:15:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:03,155 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-08-05 11:15:03,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:15:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-08-05 11:15:03,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-05 11:15:03,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:03,156 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1] [2019-08-05 11:15:03,156 INFO L418 AbstractCegarLoop]: === Iteration 97 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:03,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:03,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1967234722, now seen corresponding path program 95 times [2019-08-05 11:15:03,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:03,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:15:03,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:06,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:06,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:15:06,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:15:06,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:15:06,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:15:06,530 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 98 states. [2019-08-05 11:15:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:06,822 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-08-05 11:15:06,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:15:06,823 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 193 [2019-08-05 11:15:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:06,824 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:15:06,824 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:15:06,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:15:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:15:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-08-05 11:15:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 11:15:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-08-05 11:15:06,828 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2019-08-05 11:15:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:06,828 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-08-05 11:15:06,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:15:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-08-05 11:15:06,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 11:15:06,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:06,829 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1] [2019-08-05 11:15:06,829 INFO L418 AbstractCegarLoop]: === Iteration 98 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:06,829 INFO L82 PathProgramCache]: Analyzing trace with hash -727079392, now seen corresponding path program 96 times [2019-08-05 11:15:06,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:06,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:15:06,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:10,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:10,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:15:10,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:15:10,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:15:10,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:15:10,208 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 99 states. [2019-08-05 11:15:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:10,527 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-08-05 11:15:10,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:15:10,527 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 195 [2019-08-05 11:15:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:10,528 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:15:10,529 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:15:10,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:15:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:15:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-08-05 11:15:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 11:15:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2019-08-05 11:15:10,532 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2019-08-05 11:15:10,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:10,533 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2019-08-05 11:15:10,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:15:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2019-08-05 11:15:10,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-08-05 11:15:10,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:10,534 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1] [2019-08-05 11:15:10,534 INFO L418 AbstractCegarLoop]: === Iteration 99 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:10,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1356251746, now seen corresponding path program 97 times [2019-08-05 11:15:10,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:10,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:15:10,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:14,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:14,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:15:14,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:15:14,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:15:14,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:15:14,086 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 100 states. [2019-08-05 11:15:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:14,377 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-08-05 11:15:14,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:15:14,377 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 197 [2019-08-05 11:15:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:14,379 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:15:14,379 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:15:14,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:15:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:15:14,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-08-05 11:15:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 11:15:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-08-05 11:15:14,382 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2019-08-05 11:15:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:14,382 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-08-05 11:15:14,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:15:14,382 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-08-05 11:15:14,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 11:15:14,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:14,383 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1] [2019-08-05 11:15:14,383 INFO L418 AbstractCegarLoop]: === Iteration 100 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:14,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:14,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1982715428, now seen corresponding path program 98 times [2019-08-05 11:15:14,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:14,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:15:14,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:17,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:17,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:15:17,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:15:17,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:15:17,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:15:17,773 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 101 states. [2019-08-05 11:15:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:18,070 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-08-05 11:15:18,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:15:18,070 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2019-08-05 11:15:18,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:18,071 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:15:18,071 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 11:15:18,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:15:18,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 11:15:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-08-05 11:15:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 11:15:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-08-05 11:15:18,073 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2019-08-05 11:15:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:18,074 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-08-05 11:15:18,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:15:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-08-05 11:15:18,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 11:15:18,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:18,075 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1] [2019-08-05 11:15:18,075 INFO L418 AbstractCegarLoop]: === Iteration 101 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:18,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1576074906, now seen corresponding path program 99 times [2019-08-05 11:15:18,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:18,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:15:18,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:21,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:21,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:15:21,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:15:21,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:15:21,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:15:21,782 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 102 states. [2019-08-05 11:15:22,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:22,106 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-08-05 11:15:22,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:15:22,107 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2019-08-05 11:15:22,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:22,108 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:15:22,108 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:15:22,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:15:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:15:22,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-08-05 11:15:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 11:15:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2019-08-05 11:15:22,110 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2019-08-05 11:15:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:22,110 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2019-08-05 11:15:22,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:15:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2019-08-05 11:15:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 11:15:22,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:22,112 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1] [2019-08-05 11:15:22,112 INFO L418 AbstractCegarLoop]: === Iteration 102 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:22,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:22,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1515349032, now seen corresponding path program 100 times [2019-08-05 11:15:22,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:22,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:15:22,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:25,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:25,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 11:15:25,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 11:15:25,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 11:15:25,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:15:25,911 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 103 states. [2019-08-05 11:15:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:26,228 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-08-05 11:15:26,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 11:15:26,228 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 203 [2019-08-05 11:15:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:26,230 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:15:26,230 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 11:15:26,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:15:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 11:15:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-08-05 11:15:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-08-05 11:15:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-08-05 11:15:26,234 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2019-08-05 11:15:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:26,234 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-08-05 11:15:26,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 11:15:26,234 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-08-05 11:15:26,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-08-05 11:15:26,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:26,236 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1] [2019-08-05 11:15:26,236 INFO L418 AbstractCegarLoop]: === Iteration 103 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:26,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:26,236 INFO L82 PathProgramCache]: Analyzing trace with hash 256384618, now seen corresponding path program 101 times [2019-08-05 11:15:26,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:26,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:15:26,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:30,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:30,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 11:15:30,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 11:15:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 11:15:30,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:15:30,230 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 104 states. [2019-08-05 11:15:30,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:30,574 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-08-05 11:15:30,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 11:15:30,575 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 205 [2019-08-05 11:15:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:30,576 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:15:30,577 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:15:30,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:15:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:15:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-08-05 11:15:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 11:15:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-08-05 11:15:30,580 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2019-08-05 11:15:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:30,581 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-08-05 11:15:30,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 11:15:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-08-05 11:15:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 11:15:30,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:30,581 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1] [2019-08-05 11:15:30,582 INFO L418 AbstractCegarLoop]: === Iteration 104 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:30,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1572360236, now seen corresponding path program 102 times [2019-08-05 11:15:30,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:30,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 11:15:30,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:34,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:34,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 11:15:34,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 11:15:34,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 11:15:34,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:15:34,698 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 105 states. [2019-08-05 11:15:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:35,016 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-08-05 11:15:35,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 11:15:35,017 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 207 [2019-08-05 11:15:35,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:35,018 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:15:35,018 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 11:15:35,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:15:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 11:15:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2019-08-05 11:15:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-08-05 11:15:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2019-08-05 11:15:35,021 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2019-08-05 11:15:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:35,022 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2019-08-05 11:15:35,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 11:15:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2019-08-05 11:15:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-08-05 11:15:35,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:35,022 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1] [2019-08-05 11:15:35,023 INFO L418 AbstractCegarLoop]: === Iteration 105 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:35,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:35,023 INFO L82 PathProgramCache]: Analyzing trace with hash -790423186, now seen corresponding path program 103 times [2019-08-05 11:15:35,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:35,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:15:35,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:38,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:38,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 11:15:38,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 11:15:38,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 11:15:38,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:15:38,924 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 106 states. [2019-08-05 11:15:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:39,293 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-08-05 11:15:39,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 11:15:39,293 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 209 [2019-08-05 11:15:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:39,294 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:15:39,294 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:15:39,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:15:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:15:39,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-08-05 11:15:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 11:15:39,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-08-05 11:15:39,298 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2019-08-05 11:15:39,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:39,298 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-08-05 11:15:39,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 11:15:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-08-05 11:15:39,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-08-05 11:15:39,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:39,300 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1] [2019-08-05 11:15:39,300 INFO L418 AbstractCegarLoop]: === Iteration 106 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:39,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:39,300 INFO L82 PathProgramCache]: Analyzing trace with hash 612407856, now seen corresponding path program 104 times [2019-08-05 11:15:39,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:39,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:15:39,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:43,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:43,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 11:15:43,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 11:15:43,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 11:15:43,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:15:43,334 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 107 states. [2019-08-05 11:15:43,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:43,667 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-08-05 11:15:43,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 11:15:43,668 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 211 [2019-08-05 11:15:43,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:43,669 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:15:43,669 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:15:43,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:15:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:15:43,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-08-05 11:15:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-08-05 11:15:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-08-05 11:15:43,672 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 211 [2019-08-05 11:15:43,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:43,673 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-08-05 11:15:43,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 11:15:43,673 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-08-05 11:15:43,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-08-05 11:15:43,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:43,674 INFO L399 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1] [2019-08-05 11:15:43,674 INFO L418 AbstractCegarLoop]: === Iteration 107 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:43,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:43,674 INFO L82 PathProgramCache]: Analyzing trace with hash 113308274, now seen corresponding path program 105 times [2019-08-05 11:15:43,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:43,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 11:15:43,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:47,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:47,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 11:15:47,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 11:15:47,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 11:15:47,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:15:47,823 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 108 states. [2019-08-05 11:15:48,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:48,184 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2019-08-05 11:15:48,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 11:15:48,185 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 213 [2019-08-05 11:15:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:48,186 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:15:48,186 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:15:48,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:15:48,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:15:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2019-08-05 11:15:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-08-05 11:15:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-08-05 11:15:48,190 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 213 [2019-08-05 11:15:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:48,190 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-08-05 11:15:48,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 11:15:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-08-05 11:15:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-08-05 11:15:48,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:48,191 INFO L399 BasicCegarLoop]: trace histogram [106, 106, 1, 1, 1] [2019-08-05 11:15:48,191 INFO L418 AbstractCegarLoop]: === Iteration 108 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:48,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:48,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1514947124, now seen corresponding path program 106 times [2019-08-05 11:15:48,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:48,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 11:15:48,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:52,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:52,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 11:15:52,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 11:15:52,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 11:15:52,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:15:52,355 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 109 states. [2019-08-05 11:15:52,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:52,694 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-08-05 11:15:52,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 11:15:52,694 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 215 [2019-08-05 11:15:52,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:52,695 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:15:52,695 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 11:15:52,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:15:52,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 11:15:52,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2019-08-05 11:15:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-08-05 11:15:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2019-08-05 11:15:52,698 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 215 [2019-08-05 11:15:52,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:52,699 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2019-08-05 11:15:52,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 11:15:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2019-08-05 11:15:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 11:15:52,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:52,700 INFO L399 BasicCegarLoop]: trace histogram [107, 107, 1, 1, 1] [2019-08-05 11:15:52,700 INFO L418 AbstractCegarLoop]: === Iteration 109 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:52,700 INFO L82 PathProgramCache]: Analyzing trace with hash -129848970, now seen corresponding path program 107 times [2019-08-05 11:15:52,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:52,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:15:52,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:57,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:57,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 11:15:57,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 11:15:57,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 11:15:57,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:15:57,051 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 110 states. [2019-08-05 11:15:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:57,545 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-08-05 11:15:57,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 11:15:57,545 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 217 [2019-08-05 11:15:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:57,546 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:15:57,546 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:15:57,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:15:57,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:15:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-08-05 11:15:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 11:15:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2019-08-05 11:15:57,548 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 217 [2019-08-05 11:15:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:57,548 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2019-08-05 11:15:57,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 11:15:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2019-08-05 11:15:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-08-05 11:15:57,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:57,549 INFO L399 BasicCegarLoop]: trace histogram [108, 108, 1, 1, 1] [2019-08-05 11:15:57,549 INFO L418 AbstractCegarLoop]: === Iteration 110 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:57,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:57,549 INFO L82 PathProgramCache]: Analyzing trace with hash -230930376, now seen corresponding path program 108 times [2019-08-05 11:15:57,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:57,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:15:57,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:01,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:01,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:01,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 11:16:01,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 11:16:01,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 11:16:01,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:16:01,904 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 111 states. [2019-08-05 11:16:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:02,269 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-08-05 11:16:02,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 11:16:02,269 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 219 [2019-08-05 11:16:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:02,270 INFO L225 Difference]: With dead ends: 223 [2019-08-05 11:16:02,270 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 11:16:02,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:16:02,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 11:16:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2019-08-05 11:16:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-08-05 11:16:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2019-08-05 11:16:02,274 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 219 [2019-08-05 11:16:02,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:02,274 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2019-08-05 11:16:02,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 11:16:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2019-08-05 11:16:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-08-05 11:16:02,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:02,275 INFO L399 BasicCegarLoop]: trace histogram [109, 109, 1, 1, 1] [2019-08-05 11:16:02,276 INFO L418 AbstractCegarLoop]: === Iteration 111 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:02,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:02,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1414086266, now seen corresponding path program 109 times [2019-08-05 11:16:02,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:02,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 11:16:02,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:06,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:06,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 11:16:06,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 11:16:06,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 11:16:06,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:16:06,785 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 112 states. [2019-08-05 11:16:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:07,141 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-08-05 11:16:07,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 11:16:07,142 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 221 [2019-08-05 11:16:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:07,143 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:16:07,143 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:16:07,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:16:07,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:16:07,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2019-08-05 11:16:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-05 11:16:07,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2019-08-05 11:16:07,146 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 221 [2019-08-05 11:16:07,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:07,146 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2019-08-05 11:16:07,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 11:16:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2019-08-05 11:16:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-08-05 11:16:07,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:07,147 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 1, 1, 1] [2019-08-05 11:16:07,147 INFO L418 AbstractCegarLoop]: === Iteration 112 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:07,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:07,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1727114300, now seen corresponding path program 110 times [2019-08-05 11:16:07,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:07,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:16:07,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:11,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:11,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 11:16:11,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 11:16:11,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 11:16:11,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:16:11,696 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 113 states. [2019-08-05 11:16:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:12,069 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-08-05 11:16:12,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 11:16:12,070 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 223 [2019-08-05 11:16:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:12,070 INFO L225 Difference]: With dead ends: 227 [2019-08-05 11:16:12,070 INFO L226 Difference]: Without dead ends: 227 [2019-08-05 11:16:12,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:16:12,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-08-05 11:16:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-08-05 11:16:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-08-05 11:16:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-08-05 11:16:12,074 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 223 [2019-08-05 11:16:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:12,074 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-08-05 11:16:12,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 11:16:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-08-05 11:16:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-08-05 11:16:12,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:12,075 INFO L399 BasicCegarLoop]: trace histogram [111, 111, 1, 1, 1] [2019-08-05 11:16:12,075 INFO L418 AbstractCegarLoop]: === Iteration 113 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:12,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:12,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1899344254, now seen corresponding path program 111 times [2019-08-05 11:16:12,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:12,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:16:12,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:16,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:16,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 11:16:16,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 11:16:16,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 11:16:16,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:16:16,611 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 114 states. [2019-08-05 11:16:16,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:16,996 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2019-08-05 11:16:16,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 11:16:16,997 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 225 [2019-08-05 11:16:16,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:16,998 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:16:16,998 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:16:16,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:16:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:16:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2019-08-05 11:16:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-08-05 11:16:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2019-08-05 11:16:17,000 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 225 [2019-08-05 11:16:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:17,001 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2019-08-05 11:16:17,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 11:16:17,001 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2019-08-05 11:16:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-08-05 11:16:17,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:17,002 INFO L399 BasicCegarLoop]: trace histogram [112, 112, 1, 1, 1] [2019-08-05 11:16:17,002 INFO L418 AbstractCegarLoop]: === Iteration 114 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:17,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:17,002 INFO L82 PathProgramCache]: Analyzing trace with hash -91394496, now seen corresponding path program 112 times [2019-08-05 11:16:17,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:17,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:16:17,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:21,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:21,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 11:16:21,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 11:16:21,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 11:16:21,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:16:21,773 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 115 states. [2019-08-05 11:16:22,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:22,172 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-08-05 11:16:22,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 11:16:22,173 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 227 [2019-08-05 11:16:22,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:22,174 INFO L225 Difference]: With dead ends: 231 [2019-08-05 11:16:22,174 INFO L226 Difference]: Without dead ends: 231 [2019-08-05 11:16:22,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:16:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-08-05 11:16:22,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 230. [2019-08-05 11:16:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-08-05 11:16:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2019-08-05 11:16:22,177 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 227 [2019-08-05 11:16:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:22,177 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2019-08-05 11:16:22,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 11:16:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2019-08-05 11:16:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-08-05 11:16:22,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:22,178 INFO L399 BasicCegarLoop]: trace histogram [113, 113, 1, 1, 1] [2019-08-05 11:16:22,178 INFO L418 AbstractCegarLoop]: === Iteration 115 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:22,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:22,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1930886526, now seen corresponding path program 113 times [2019-08-05 11:16:22,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:22,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 11:16:22,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:26,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:26,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 11:16:26,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 11:16:26,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 11:16:26,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:16:26,933 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 116 states. [2019-08-05 11:16:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:27,334 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2019-08-05 11:16:27,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 11:16:27,334 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 229 [2019-08-05 11:16:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:27,335 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:16:27,335 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:16:27,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:16:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:16:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2019-08-05 11:16:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-08-05 11:16:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-08-05 11:16:27,338 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 229 [2019-08-05 11:16:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:27,338 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-08-05 11:16:27,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 11:16:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-08-05 11:16:27,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-08-05 11:16:27,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:27,339 INFO L399 BasicCegarLoop]: trace histogram [114, 114, 1, 1, 1] [2019-08-05 11:16:27,339 INFO L418 AbstractCegarLoop]: === Iteration 116 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:27,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:27,340 INFO L82 PathProgramCache]: Analyzing trace with hash -156201404, now seen corresponding path program 114 times [2019-08-05 11:16:27,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:27,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 11:16:27,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:32,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:32,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 11:16:32,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 11:16:32,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 11:16:32,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:16:32,049 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 117 states. [2019-08-05 11:16:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:32,442 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-08-05 11:16:32,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 11:16:32,443 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 231 [2019-08-05 11:16:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:32,444 INFO L225 Difference]: With dead ends: 235 [2019-08-05 11:16:32,444 INFO L226 Difference]: Without dead ends: 235 [2019-08-05 11:16:32,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:16:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-08-05 11:16:32,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2019-08-05 11:16:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-08-05 11:16:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2019-08-05 11:16:32,446 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 231 [2019-08-05 11:16:32,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:32,446 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2019-08-05 11:16:32,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 11:16:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2019-08-05 11:16:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-08-05 11:16:32,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:32,448 INFO L399 BasicCegarLoop]: trace histogram [115, 115, 1, 1, 1] [2019-08-05 11:16:32,448 INFO L418 AbstractCegarLoop]: === Iteration 117 === [fooErr1ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:32,448 INFO L82 PathProgramCache]: Analyzing trace with hash 214184326, now seen corresponding path program 115 times [2019-08-05 11:16:32,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:32,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 11:16:32,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:16:35,235 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:16:35,235 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:16:35,239 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:16:35,240 INFO L202 PluginConnector]: Adding new model loop-110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:16:35 BoogieIcfgContainer [2019-08-05 11:16:35,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:16:35,242 INFO L168 Benchmark]: Toolchain (without parser) took 239973.30 ms. Allocated memory was 133.2 MB in the beginning and 706.7 MB in the end (delta: 573.6 MB). Free memory was 109.5 MB in the beginning and 350.2 MB in the end (delta: -240.8 MB). Peak memory consumption was 332.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:35,243 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:16:35,243 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.81 ms. Allocated memory is still 133.2 MB. Free memory was 109.5 MB in the beginning and 107.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:35,244 INFO L168 Benchmark]: Boogie Preprocessor took 20.61 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 106.5 MB in the end (delta: 873.3 kB). Peak memory consumption was 873.3 kB. Max. memory is 7.1 GB. [2019-08-05 11:16:35,244 INFO L168 Benchmark]: RCFGBuilder took 342.63 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 97.7 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:35,245 INFO L168 Benchmark]: TraceAbstraction took 239571.47 ms. Allocated memory was 133.2 MB in the beginning and 706.7 MB in the end (delta: 573.6 MB). Free memory was 97.2 MB in the beginning and 350.2 MB in the end (delta: -253.0 MB). Peak memory consumption was 320.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:35,247 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.81 ms. Allocated memory is still 133.2 MB. Free memory was 109.5 MB in the beginning and 107.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.61 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 106.5 MB in the end (delta: 873.3 kB). Peak memory consumption was 873.3 kB. Max. memory is 7.1 GB. * RCFGBuilder took 342.63 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 97.7 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239571.47 ms. Allocated memory was 133.2 MB in the beginning and 706.7 MB in the end (delta: 573.6 MB). Free memory was 97.2 MB in the beginning and 350.2 MB in the end (delta: -253.0 MB). Peak memory consumption was 320.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 11]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 11). Cancelled while BasicCegarLoop was analyzing trace of length 234 with TraceHistMax 115,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 92 known predicates. - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 7). Cancelled while BasicCegarLoop was analyzing trace of length 234 with TraceHistMax 115,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 92 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. TIMEOUT Result, 239.5s OverallTime, 117 OverallIterations, 115 TraceHistogramMax, 25.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 350 SDtfs, 6670 SDslu, 1075 SDs, 0 SdLazy, 14645 SolverSat, 355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13342 GetRequests, 6672 SyntacticMatches, 0 SemanticMatches, 6670 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 205.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=116, 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.3s AutomataMinimizationTime, 116 MinimizatonAttempts, 115 StatesRemovedByMinimization, 115 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 209.2s InterpolantComputationTime, 13458 NumberOfCodeBlocks, 13458 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 13342 ConstructedInterpolants, 0 QuantifiedInterpolants, 6136404 SizeOfPredicates, 115 NumberOfNonLiveVariables, 20361 ConjunctsInSsa, 6786 ConjunctsInUnsatCore, 116 InterpolantComputations, 2 PerfectInterpolantSequences, 0/500365 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown